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_init7_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:02:37,413 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:02:37,415 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:02:37,428 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:02:37,428 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:02:37,429 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:02:37,431 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:02:37,433 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:02:37,435 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:02:37,436 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:02:37,437 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:02:37,437 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:02:37,438 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:02:37,439 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:02:37,441 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:02:37,442 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:02:37,442 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:02:37,445 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:02:37,447 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:02:37,449 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:02:37,450 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:02:37,451 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:02:37,454 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:02:37,454 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:02:37,455 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:02:37,456 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:02:37,457 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:02:37,458 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:02:37,459 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:02:37,460 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:02:37,460 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:02:37,461 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:02:37,461 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:02:37,461 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:02:37,462 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:02:37,463 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:02:37,464 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,480 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:02:37,480 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:02:37,481 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:02:37,482 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:02:37,482 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:02:37,483 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:02:37,483 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:02:37,483 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:02:37,483 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:02:37,483 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:02:37,484 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:02:37,484 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:02:37,484 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:02:37,484 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:02:37,485 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:02:37,485 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:02:37,485 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:02:37,485 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:02:37,485 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:02:37,486 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:02:37,486 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:02:37,486 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:02:37,486 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:02:37,486 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:02:37,487 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:02:37,487 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:02:37,487 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:02:37,487 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:02:37,487 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:02:37,488 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:02:37,488 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:02:37,532 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:02:37,546 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:02:37,550 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:02:37,551 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:02:37,552 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:02:37,553 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init7_true-unreach-call_ground.i [2018-11-23 12:02:37,614 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/177af6562/4480ff26063a4001b1b74b552fc60711/FLAG5b9229779 [2018-11-23 12:02:38,101 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:02:38,101 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init7_true-unreach-call_ground.i [2018-11-23 12:02:38,111 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/177af6562/4480ff26063a4001b1b74b552fc60711/FLAG5b9229779 [2018-11-23 12:02:38,453 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/177af6562/4480ff26063a4001b1b74b552fc60711 [2018-11-23 12:02:38,463 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:02:38,465 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:02:38,466 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:02:38,466 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:02:38,472 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:02:38,473 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,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d22123d 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,477 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,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:02:38,516 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:02:38,762 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:02:38,767 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:02:38,797 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:02:38,830 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:02:38,830 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,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:02:38,832 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:02:38,832 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:02:38,832 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:02:38,843 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,853 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,862 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:02:38,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:02:38,863 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:02:38,863 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:02:38,874 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,874 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,876 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,877 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,889 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,899 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,903 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,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:02:38,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:02:38,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:02:38,909 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:02:38,910 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:39,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:02:39,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:02:39,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:02:39,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:02:39,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:02:39,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:02:39,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:02:39,069 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:02:39,069 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:02:39,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:02:39,070 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:02:39,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:02:39,867 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:02:39,868 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 12:02:39,868 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,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:02:39,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:02:39,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:02:39,874 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:02:39,874 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,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db63bc0 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,876 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,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db63bc0 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,876 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,878 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init7_true-unreach-call_ground.i [2018-11-23 12:02:39,889 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:02:39,898 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:02:39,915 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:02:39,965 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:02:39,966 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:02:39,966 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:02:39,966 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:02:39,967 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:02:39,967 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:02:39,967 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:02:39,967 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:02:39,967 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:02:39,985 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-11-23 12:02:39,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:02:39,994 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:39,995 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] [2018-11-23 12:02:39,997 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:40,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:40,005 INFO L82 PathProgramCache]: Analyzing trace with hash -190793262, now seen corresponding path program 1 times [2018-11-23 12:02:40,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:40,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:40,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:40,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:40,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:40,148 INFO L256 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {38#true} is VALID [2018-11-23 12:02:40,152 INFO L273 TraceCheckUtils]: 1: Hoare triple {38#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {38#true} is VALID [2018-11-23 12:02:40,152 INFO L273 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2018-11-23 12:02:40,153 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #126#return; {38#true} is VALID [2018-11-23 12:02:40,153 INFO L256 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret2 := main(); {38#true} is VALID [2018-11-23 12:02:40,154 INFO L273 TraceCheckUtils]: 5: Hoare triple {38#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {38#true} is VALID [2018-11-23 12:02:40,155 INFO L273 TraceCheckUtils]: 6: Hoare triple {38#true} assume !true; {39#false} is VALID [2018-11-23 12:02:40,156 INFO L273 TraceCheckUtils]: 7: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2018-11-23 12:02:40,156 INFO L273 TraceCheckUtils]: 8: Hoare triple {39#false} assume !(~i~0 < 100000); {39#false} is VALID [2018-11-23 12:02:40,156 INFO L273 TraceCheckUtils]: 9: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2018-11-23 12:02:40,157 INFO L273 TraceCheckUtils]: 10: Hoare triple {39#false} assume !(~i~0 < 100000); {39#false} is VALID [2018-11-23 12:02:40,157 INFO L273 TraceCheckUtils]: 11: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2018-11-23 12:02:40,157 INFO L273 TraceCheckUtils]: 12: Hoare triple {39#false} assume !(~i~0 < 100000); {39#false} is VALID [2018-11-23 12:02:40,158 INFO L273 TraceCheckUtils]: 13: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2018-11-23 12:02:40,158 INFO L273 TraceCheckUtils]: 14: Hoare triple {39#false} assume !(~i~0 < 100000); {39#false} is VALID [2018-11-23 12:02:40,158 INFO L273 TraceCheckUtils]: 15: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2018-11-23 12:02:40,159 INFO L273 TraceCheckUtils]: 16: Hoare triple {39#false} assume !true; {39#false} is VALID [2018-11-23 12:02:40,159 INFO L273 TraceCheckUtils]: 17: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2018-11-23 12:02:40,159 INFO L273 TraceCheckUtils]: 18: Hoare triple {39#false} assume !(~i~0 < 100000); {39#false} is VALID [2018-11-23 12:02:40,160 INFO L273 TraceCheckUtils]: 19: Hoare triple {39#false} havoc ~x~0;~x~0 := 0; {39#false} is VALID [2018-11-23 12:02:40,160 INFO L273 TraceCheckUtils]: 20: Hoare triple {39#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {39#false} is VALID [2018-11-23 12:02:40,161 INFO L256 TraceCheckUtils]: 21: Hoare triple {39#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {39#false} is VALID [2018-11-23 12:02:40,161 INFO L273 TraceCheckUtils]: 22: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2018-11-23 12:02:40,161 INFO L273 TraceCheckUtils]: 23: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2018-11-23 12:02:40,162 INFO L273 TraceCheckUtils]: 24: Hoare triple {39#false} assume !false; {39#false} is VALID [2018-11-23 12:02:40,167 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:40,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:02:40,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:02:40,175 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-11-23 12:02:40,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:40,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:02:40,429 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:40,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:02:40,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:02:40,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:02:40,442 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2018-11-23 12:02:40,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:40,739 INFO L93 Difference]: Finished difference Result 63 states and 94 transitions. [2018-11-23 12:02:40,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:02:40,739 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-11-23 12:02:40,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:40,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:02:40,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 94 transitions. [2018-11-23 12:02:40,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:02:40,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 94 transitions. [2018-11-23 12:02:40,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 94 transitions. [2018-11-23 12:02:41,032 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:41,044 INFO L225 Difference]: With dead ends: 63 [2018-11-23 12:02:41,044 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:02:41,048 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:41,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:02:41,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 12:02:41,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:41,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-23 12:02:41,124 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 12:02:41,125 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 12:02:41,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:41,129 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-23 12:02:41,130 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 12:02:41,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:41,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:41,131 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 12:02:41,131 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 12:02:41,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:41,135 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-23 12:02:41,136 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 12:02:41,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:41,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:41,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:41,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:41,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:02:41,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-23 12:02:41,142 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 25 [2018-11-23 12:02:41,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:41,143 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-23 12:02:41,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:02:41,143 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 12:02:41,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:02:41,144 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:41,144 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] [2018-11-23 12:02:41,145 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:41,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:41,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1826977482, now seen corresponding path program 1 times [2018-11-23 12:02:41,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:41,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:41,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:41,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:41,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:41,236 INFO L256 TraceCheckUtils]: 0: Hoare triple {232#true} call ULTIMATE.init(); {232#true} is VALID [2018-11-23 12:02:41,237 INFO L273 TraceCheckUtils]: 1: Hoare triple {232#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {232#true} is VALID [2018-11-23 12:02:41,238 INFO L273 TraceCheckUtils]: 2: Hoare triple {232#true} assume true; {232#true} is VALID [2018-11-23 12:02:41,238 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {232#true} {232#true} #126#return; {232#true} is VALID [2018-11-23 12:02:41,239 INFO L256 TraceCheckUtils]: 4: Hoare triple {232#true} call #t~ret2 := main(); {232#true} is VALID [2018-11-23 12:02:41,243 INFO L273 TraceCheckUtils]: 5: Hoare triple {232#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {234#(= main_~i~0 0)} is VALID [2018-11-23 12:02:41,260 INFO L273 TraceCheckUtils]: 6: Hoare triple {234#(= main_~i~0 0)} assume !(~i~0 < 100000); {233#false} is VALID [2018-11-23 12:02:41,261 INFO L273 TraceCheckUtils]: 7: Hoare triple {233#false} ~i~0 := 0; {233#false} is VALID [2018-11-23 12:02:41,261 INFO L273 TraceCheckUtils]: 8: Hoare triple {233#false} assume !(~i~0 < 100000); {233#false} is VALID [2018-11-23 12:02:41,261 INFO L273 TraceCheckUtils]: 9: Hoare triple {233#false} ~i~0 := 0; {233#false} is VALID [2018-11-23 12:02:41,262 INFO L273 TraceCheckUtils]: 10: Hoare triple {233#false} assume !(~i~0 < 100000); {233#false} is VALID [2018-11-23 12:02:41,262 INFO L273 TraceCheckUtils]: 11: Hoare triple {233#false} ~i~0 := 0; {233#false} is VALID [2018-11-23 12:02:41,263 INFO L273 TraceCheckUtils]: 12: Hoare triple {233#false} assume !(~i~0 < 100000); {233#false} is VALID [2018-11-23 12:02:41,263 INFO L273 TraceCheckUtils]: 13: Hoare triple {233#false} ~i~0 := 0; {233#false} is VALID [2018-11-23 12:02:41,263 INFO L273 TraceCheckUtils]: 14: Hoare triple {233#false} assume !(~i~0 < 100000); {233#false} is VALID [2018-11-23 12:02:41,264 INFO L273 TraceCheckUtils]: 15: Hoare triple {233#false} ~i~0 := 0; {233#false} is VALID [2018-11-23 12:02:41,264 INFO L273 TraceCheckUtils]: 16: Hoare triple {233#false} assume !(~i~0 < 100000); {233#false} is VALID [2018-11-23 12:02:41,265 INFO L273 TraceCheckUtils]: 17: Hoare triple {233#false} ~i~0 := 0; {233#false} is VALID [2018-11-23 12:02:41,265 INFO L273 TraceCheckUtils]: 18: Hoare triple {233#false} assume !(~i~0 < 100000); {233#false} is VALID [2018-11-23 12:02:41,265 INFO L273 TraceCheckUtils]: 19: Hoare triple {233#false} havoc ~x~0;~x~0 := 0; {233#false} is VALID [2018-11-23 12:02:41,266 INFO L273 TraceCheckUtils]: 20: Hoare triple {233#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {233#false} is VALID [2018-11-23 12:02:41,266 INFO L256 TraceCheckUtils]: 21: Hoare triple {233#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {233#false} is VALID [2018-11-23 12:02:41,266 INFO L273 TraceCheckUtils]: 22: Hoare triple {233#false} ~cond := #in~cond; {233#false} is VALID [2018-11-23 12:02:41,267 INFO L273 TraceCheckUtils]: 23: Hoare triple {233#false} assume 0 == ~cond; {233#false} is VALID [2018-11-23 12:02:41,268 INFO L273 TraceCheckUtils]: 24: Hoare triple {233#false} assume !false; {233#false} is VALID [2018-11-23 12:02:41,269 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,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:02:41,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:02:41,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:02:41,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:41,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:02:41,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:41,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:02:41,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:02:41,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:02:41,477 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 3 states. [2018-11-23 12:02:42,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:42,001 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2018-11-23 12:02:42,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:02:42,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:02:42,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:42,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:02:42,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2018-11-23 12:02:42,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:02:42,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2018-11-23 12:02:42,009 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 80 transitions. [2018-11-23 12:02:42,180 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:42,184 INFO L225 Difference]: With dead ends: 60 [2018-11-23 12:02:42,184 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 12:02:42,186 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:42,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 12:02:42,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 12:02:42,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:42,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-23 12:02:42,218 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 12:02:42,218 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 12:02:42,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:42,221 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-11-23 12:02:42,221 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-23 12:02:42,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:42,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:42,223 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 12:02:42,223 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 12:02:42,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:42,226 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-11-23 12:02:42,226 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-23 12:02:42,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:42,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:42,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:42,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:42,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:02:42,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2018-11-23 12:02:42,230 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 25 [2018-11-23 12:02:42,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:42,231 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-23 12:02:42,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:02:42,231 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-23 12:02:42,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:02:42,232 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:42,232 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:42,233 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:42,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:42,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1635964633, now seen corresponding path program 1 times [2018-11-23 12:02:42,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:42,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:42,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:42,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:42,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:42,429 INFO L256 TraceCheckUtils]: 0: Hoare triple {459#true} call ULTIMATE.init(); {459#true} is VALID [2018-11-23 12:02:42,430 INFO L273 TraceCheckUtils]: 1: Hoare triple {459#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {459#true} is VALID [2018-11-23 12:02:42,430 INFO L273 TraceCheckUtils]: 2: Hoare triple {459#true} assume true; {459#true} is VALID [2018-11-23 12:02:42,431 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {459#true} {459#true} #126#return; {459#true} is VALID [2018-11-23 12:02:42,431 INFO L256 TraceCheckUtils]: 4: Hoare triple {459#true} call #t~ret2 := main(); {459#true} is VALID [2018-11-23 12:02:42,433 INFO L273 TraceCheckUtils]: 5: Hoare triple {459#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {461#(= main_~i~0 0)} is VALID [2018-11-23 12:02:42,434 INFO L273 TraceCheckUtils]: 6: Hoare triple {461#(= 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; {462#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:42,439 INFO L273 TraceCheckUtils]: 7: Hoare triple {462#(<= main_~i~0 1)} assume !(~i~0 < 100000); {460#false} is VALID [2018-11-23 12:02:42,439 INFO L273 TraceCheckUtils]: 8: Hoare triple {460#false} ~i~0 := 0; {460#false} is VALID [2018-11-23 12:02:42,440 INFO L273 TraceCheckUtils]: 9: Hoare triple {460#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {460#false} is VALID [2018-11-23 12:02:42,440 INFO L273 TraceCheckUtils]: 10: Hoare triple {460#false} assume !(~i~0 < 100000); {460#false} is VALID [2018-11-23 12:02:42,440 INFO L273 TraceCheckUtils]: 11: Hoare triple {460#false} ~i~0 := 0; {460#false} is VALID [2018-11-23 12:02:42,441 INFO L273 TraceCheckUtils]: 12: Hoare triple {460#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {460#false} is VALID [2018-11-23 12:02:42,442 INFO L273 TraceCheckUtils]: 13: Hoare triple {460#false} assume !(~i~0 < 100000); {460#false} is VALID [2018-11-23 12:02:42,442 INFO L273 TraceCheckUtils]: 14: Hoare triple {460#false} ~i~0 := 0; {460#false} is VALID [2018-11-23 12:02:42,442 INFO L273 TraceCheckUtils]: 15: Hoare triple {460#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {460#false} is VALID [2018-11-23 12:02:42,443 INFO L273 TraceCheckUtils]: 16: Hoare triple {460#false} assume !(~i~0 < 100000); {460#false} is VALID [2018-11-23 12:02:42,443 INFO L273 TraceCheckUtils]: 17: Hoare triple {460#false} ~i~0 := 0; {460#false} is VALID [2018-11-23 12:02:42,443 INFO L273 TraceCheckUtils]: 18: Hoare triple {460#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {460#false} is VALID [2018-11-23 12:02:42,444 INFO L273 TraceCheckUtils]: 19: Hoare triple {460#false} assume !(~i~0 < 100000); {460#false} is VALID [2018-11-23 12:02:42,444 INFO L273 TraceCheckUtils]: 20: Hoare triple {460#false} ~i~0 := 0; {460#false} is VALID [2018-11-23 12:02:42,444 INFO L273 TraceCheckUtils]: 21: Hoare triple {460#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {460#false} is VALID [2018-11-23 12:02:42,445 INFO L273 TraceCheckUtils]: 22: Hoare triple {460#false} assume !(~i~0 < 100000); {460#false} is VALID [2018-11-23 12:02:42,445 INFO L273 TraceCheckUtils]: 23: Hoare triple {460#false} ~i~0 := 0; {460#false} is VALID [2018-11-23 12:02:42,445 INFO L273 TraceCheckUtils]: 24: Hoare triple {460#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {460#false} is VALID [2018-11-23 12:02:42,446 INFO L273 TraceCheckUtils]: 25: Hoare triple {460#false} assume !(~i~0 < 100000); {460#false} is VALID [2018-11-23 12:02:42,446 INFO L273 TraceCheckUtils]: 26: Hoare triple {460#false} havoc ~x~0;~x~0 := 0; {460#false} is VALID [2018-11-23 12:02:42,446 INFO L273 TraceCheckUtils]: 27: Hoare triple {460#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {460#false} is VALID [2018-11-23 12:02:42,446 INFO L256 TraceCheckUtils]: 28: Hoare triple {460#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {460#false} is VALID [2018-11-23 12:02:42,447 INFO L273 TraceCheckUtils]: 29: Hoare triple {460#false} ~cond := #in~cond; {460#false} is VALID [2018-11-23 12:02:42,447 INFO L273 TraceCheckUtils]: 30: Hoare triple {460#false} assume 0 == ~cond; {460#false} is VALID [2018-11-23 12:02:42,447 INFO L273 TraceCheckUtils]: 31: Hoare triple {460#false} assume !false; {460#false} is VALID [2018-11-23 12:02:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:02:42,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:42,449 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:42,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:42,842 INFO L256 TraceCheckUtils]: 0: Hoare triple {459#true} call ULTIMATE.init(); {459#true} is VALID [2018-11-23 12:02:42,842 INFO L273 TraceCheckUtils]: 1: Hoare triple {459#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {459#true} is VALID [2018-11-23 12:02:42,843 INFO L273 TraceCheckUtils]: 2: Hoare triple {459#true} assume true; {459#true} is VALID [2018-11-23 12:02:42,843 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {459#true} {459#true} #126#return; {459#true} is VALID [2018-11-23 12:02:42,844 INFO L256 TraceCheckUtils]: 4: Hoare triple {459#true} call #t~ret2 := main(); {459#true} is VALID [2018-11-23 12:02:42,852 INFO L273 TraceCheckUtils]: 5: Hoare triple {459#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {481#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:42,857 INFO L273 TraceCheckUtils]: 6: Hoare triple {481#(<= 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; {462#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:42,857 INFO L273 TraceCheckUtils]: 7: Hoare triple {462#(<= main_~i~0 1)} assume !(~i~0 < 100000); {460#false} is VALID [2018-11-23 12:02:42,858 INFO L273 TraceCheckUtils]: 8: Hoare triple {460#false} ~i~0 := 0; {460#false} is VALID [2018-11-23 12:02:42,858 INFO L273 TraceCheckUtils]: 9: Hoare triple {460#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {460#false} is VALID [2018-11-23 12:02:42,858 INFO L273 TraceCheckUtils]: 10: Hoare triple {460#false} assume !(~i~0 < 100000); {460#false} is VALID [2018-11-23 12:02:42,858 INFO L273 TraceCheckUtils]: 11: Hoare triple {460#false} ~i~0 := 0; {460#false} is VALID [2018-11-23 12:02:42,859 INFO L273 TraceCheckUtils]: 12: Hoare triple {460#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {460#false} is VALID [2018-11-23 12:02:42,859 INFO L273 TraceCheckUtils]: 13: Hoare triple {460#false} assume !(~i~0 < 100000); {460#false} is VALID [2018-11-23 12:02:42,859 INFO L273 TraceCheckUtils]: 14: Hoare triple {460#false} ~i~0 := 0; {460#false} is VALID [2018-11-23 12:02:42,859 INFO L273 TraceCheckUtils]: 15: Hoare triple {460#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {460#false} is VALID [2018-11-23 12:02:42,860 INFO L273 TraceCheckUtils]: 16: Hoare triple {460#false} assume !(~i~0 < 100000); {460#false} is VALID [2018-11-23 12:02:42,860 INFO L273 TraceCheckUtils]: 17: Hoare triple {460#false} ~i~0 := 0; {460#false} is VALID [2018-11-23 12:02:42,860 INFO L273 TraceCheckUtils]: 18: Hoare triple {460#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {460#false} is VALID [2018-11-23 12:02:42,861 INFO L273 TraceCheckUtils]: 19: Hoare triple {460#false} assume !(~i~0 < 100000); {460#false} is VALID [2018-11-23 12:02:42,861 INFO L273 TraceCheckUtils]: 20: Hoare triple {460#false} ~i~0 := 0; {460#false} is VALID [2018-11-23 12:02:42,861 INFO L273 TraceCheckUtils]: 21: Hoare triple {460#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {460#false} is VALID [2018-11-23 12:02:42,861 INFO L273 TraceCheckUtils]: 22: Hoare triple {460#false} assume !(~i~0 < 100000); {460#false} is VALID [2018-11-23 12:02:42,862 INFO L273 TraceCheckUtils]: 23: Hoare triple {460#false} ~i~0 := 0; {460#false} is VALID [2018-11-23 12:02:42,862 INFO L273 TraceCheckUtils]: 24: Hoare triple {460#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {460#false} is VALID [2018-11-23 12:02:42,862 INFO L273 TraceCheckUtils]: 25: Hoare triple {460#false} assume !(~i~0 < 100000); {460#false} is VALID [2018-11-23 12:02:42,863 INFO L273 TraceCheckUtils]: 26: Hoare triple {460#false} havoc ~x~0;~x~0 := 0; {460#false} is VALID [2018-11-23 12:02:42,863 INFO L273 TraceCheckUtils]: 27: Hoare triple {460#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {460#false} is VALID [2018-11-23 12:02:42,863 INFO L256 TraceCheckUtils]: 28: Hoare triple {460#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {460#false} is VALID [2018-11-23 12:02:42,864 INFO L273 TraceCheckUtils]: 29: Hoare triple {460#false} ~cond := #in~cond; {460#false} is VALID [2018-11-23 12:02:42,864 INFO L273 TraceCheckUtils]: 30: Hoare triple {460#false} assume 0 == ~cond; {460#false} is VALID [2018-11-23 12:02:42,864 INFO L273 TraceCheckUtils]: 31: Hoare triple {460#false} assume !false; {460#false} is VALID [2018-11-23 12:02:42,866 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:02:42,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:42,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:02:42,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-23 12:02:42,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:42,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:02:43,021 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:43,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:02:43,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:02:43,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:02:43,022 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 5 states. [2018-11-23 12:02:43,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:43,439 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2018-11-23 12:02:43,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:02:43,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-23 12:02:43,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:43,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:02:43,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2018-11-23 12:02:43,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:02:43,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2018-11-23 12:02:43,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2018-11-23 12:02:43,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:43,630 INFO L225 Difference]: With dead ends: 73 [2018-11-23 12:02:43,630 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:02:43,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:02:43,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 12:02:43,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:43,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-23 12:02:43,674 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 12:02:43,674 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 12:02:43,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:43,676 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-11-23 12:02:43,676 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-23 12:02:43,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:43,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:43,677 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 12:02:43,678 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 12:02:43,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:43,681 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-11-23 12:02:43,681 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-23 12:02:43,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:43,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:43,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:43,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:43,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:02:43,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-11-23 12:02:43,684 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 32 [2018-11-23 12:02:43,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:43,685 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-23 12:02:43,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:02:43,685 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-23 12:02:43,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 12:02:43,687 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:43,687 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:43,687 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:43,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:43,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1768739882, now seen corresponding path program 2 times [2018-11-23 12:02:43,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:43,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:43,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:43,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:43,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:43,835 INFO L256 TraceCheckUtils]: 0: Hoare triple {835#true} call ULTIMATE.init(); {835#true} is VALID [2018-11-23 12:02:43,835 INFO L273 TraceCheckUtils]: 1: Hoare triple {835#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {835#true} is VALID [2018-11-23 12:02:43,836 INFO L273 TraceCheckUtils]: 2: Hoare triple {835#true} assume true; {835#true} is VALID [2018-11-23 12:02:43,836 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {835#true} {835#true} #126#return; {835#true} is VALID [2018-11-23 12:02:43,836 INFO L256 TraceCheckUtils]: 4: Hoare triple {835#true} call #t~ret2 := main(); {835#true} is VALID [2018-11-23 12:02:43,837 INFO L273 TraceCheckUtils]: 5: Hoare triple {835#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {837#(= main_~i~0 0)} is VALID [2018-11-23 12:02:43,838 INFO L273 TraceCheckUtils]: 6: Hoare triple {837#(= 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; {838#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:43,855 INFO L273 TraceCheckUtils]: 7: Hoare triple {838#(<= 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; {839#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:43,857 INFO L273 TraceCheckUtils]: 8: Hoare triple {839#(<= main_~i~0 2)} assume !(~i~0 < 100000); {836#false} is VALID [2018-11-23 12:02:43,857 INFO L273 TraceCheckUtils]: 9: Hoare triple {836#false} ~i~0 := 0; {836#false} is VALID [2018-11-23 12:02:43,857 INFO L273 TraceCheckUtils]: 10: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 12:02:43,858 INFO L273 TraceCheckUtils]: 11: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 12:02:43,858 INFO L273 TraceCheckUtils]: 12: Hoare triple {836#false} assume !(~i~0 < 100000); {836#false} is VALID [2018-11-23 12:02:43,858 INFO L273 TraceCheckUtils]: 13: Hoare triple {836#false} ~i~0 := 0; {836#false} is VALID [2018-11-23 12:02:43,858 INFO L273 TraceCheckUtils]: 14: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 12:02:43,859 INFO L273 TraceCheckUtils]: 15: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 12:02:43,859 INFO L273 TraceCheckUtils]: 16: Hoare triple {836#false} assume !(~i~0 < 100000); {836#false} is VALID [2018-11-23 12:02:43,859 INFO L273 TraceCheckUtils]: 17: Hoare triple {836#false} ~i~0 := 0; {836#false} is VALID [2018-11-23 12:02:43,859 INFO L273 TraceCheckUtils]: 18: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 12:02:43,860 INFO L273 TraceCheckUtils]: 19: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 12:02:43,860 INFO L273 TraceCheckUtils]: 20: Hoare triple {836#false} assume !(~i~0 < 100000); {836#false} is VALID [2018-11-23 12:02:43,860 INFO L273 TraceCheckUtils]: 21: Hoare triple {836#false} ~i~0 := 0; {836#false} is VALID [2018-11-23 12:02:43,860 INFO L273 TraceCheckUtils]: 22: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 12:02:43,861 INFO L273 TraceCheckUtils]: 23: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 12:02:43,861 INFO L273 TraceCheckUtils]: 24: Hoare triple {836#false} assume !(~i~0 < 100000); {836#false} is VALID [2018-11-23 12:02:43,861 INFO L273 TraceCheckUtils]: 25: Hoare triple {836#false} ~i~0 := 0; {836#false} is VALID [2018-11-23 12:02:43,861 INFO L273 TraceCheckUtils]: 26: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 12:02:43,861 INFO L273 TraceCheckUtils]: 27: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 12:02:43,862 INFO L273 TraceCheckUtils]: 28: Hoare triple {836#false} assume !(~i~0 < 100000); {836#false} is VALID [2018-11-23 12:02:43,862 INFO L273 TraceCheckUtils]: 29: Hoare triple {836#false} ~i~0 := 0; {836#false} is VALID [2018-11-23 12:02:43,862 INFO L273 TraceCheckUtils]: 30: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 12:02:43,862 INFO L273 TraceCheckUtils]: 31: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 12:02:43,862 INFO L273 TraceCheckUtils]: 32: Hoare triple {836#false} assume !(~i~0 < 100000); {836#false} is VALID [2018-11-23 12:02:43,863 INFO L273 TraceCheckUtils]: 33: Hoare triple {836#false} havoc ~x~0;~x~0 := 0; {836#false} is VALID [2018-11-23 12:02:43,863 INFO L273 TraceCheckUtils]: 34: Hoare triple {836#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {836#false} is VALID [2018-11-23 12:02:43,863 INFO L256 TraceCheckUtils]: 35: Hoare triple {836#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {836#false} is VALID [2018-11-23 12:02:43,864 INFO L273 TraceCheckUtils]: 36: Hoare triple {836#false} ~cond := #in~cond; {836#false} is VALID [2018-11-23 12:02:43,864 INFO L273 TraceCheckUtils]: 37: Hoare triple {836#false} assume 0 == ~cond; {836#false} is VALID [2018-11-23 12:02:43,864 INFO L273 TraceCheckUtils]: 38: Hoare triple {836#false} assume !false; {836#false} is VALID [2018-11-23 12:02:43,867 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 12:02:43,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:43,867 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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,880 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:02:43,914 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:02:43,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:43,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:44,058 INFO L256 TraceCheckUtils]: 0: Hoare triple {835#true} call ULTIMATE.init(); {835#true} is VALID [2018-11-23 12:02:44,058 INFO L273 TraceCheckUtils]: 1: Hoare triple {835#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {835#true} is VALID [2018-11-23 12:02:44,059 INFO L273 TraceCheckUtils]: 2: Hoare triple {835#true} assume true; {835#true} is VALID [2018-11-23 12:02:44,059 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {835#true} {835#true} #126#return; {835#true} is VALID [2018-11-23 12:02:44,059 INFO L256 TraceCheckUtils]: 4: Hoare triple {835#true} call #t~ret2 := main(); {835#true} is VALID [2018-11-23 12:02:44,060 INFO L273 TraceCheckUtils]: 5: Hoare triple {835#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {858#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:44,060 INFO L273 TraceCheckUtils]: 6: Hoare triple {858#(<= 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; {838#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:44,061 INFO L273 TraceCheckUtils]: 7: Hoare triple {838#(<= 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; {839#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:44,062 INFO L273 TraceCheckUtils]: 8: Hoare triple {839#(<= main_~i~0 2)} assume !(~i~0 < 100000); {836#false} is VALID [2018-11-23 12:02:44,062 INFO L273 TraceCheckUtils]: 9: Hoare triple {836#false} ~i~0 := 0; {836#false} is VALID [2018-11-23 12:02:44,062 INFO L273 TraceCheckUtils]: 10: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 12:02:44,062 INFO L273 TraceCheckUtils]: 11: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 12:02:44,063 INFO L273 TraceCheckUtils]: 12: Hoare triple {836#false} assume !(~i~0 < 100000); {836#false} is VALID [2018-11-23 12:02:44,063 INFO L273 TraceCheckUtils]: 13: Hoare triple {836#false} ~i~0 := 0; {836#false} is VALID [2018-11-23 12:02:44,063 INFO L273 TraceCheckUtils]: 14: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 12:02:44,064 INFO L273 TraceCheckUtils]: 15: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 12:02:44,064 INFO L273 TraceCheckUtils]: 16: Hoare triple {836#false} assume !(~i~0 < 100000); {836#false} is VALID [2018-11-23 12:02:44,064 INFO L273 TraceCheckUtils]: 17: Hoare triple {836#false} ~i~0 := 0; {836#false} is VALID [2018-11-23 12:02:44,065 INFO L273 TraceCheckUtils]: 18: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 12:02:44,065 INFO L273 TraceCheckUtils]: 19: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 12:02:44,065 INFO L273 TraceCheckUtils]: 20: Hoare triple {836#false} assume !(~i~0 < 100000); {836#false} is VALID [2018-11-23 12:02:44,066 INFO L273 TraceCheckUtils]: 21: Hoare triple {836#false} ~i~0 := 0; {836#false} is VALID [2018-11-23 12:02:44,066 INFO L273 TraceCheckUtils]: 22: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 12:02:44,066 INFO L273 TraceCheckUtils]: 23: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 12:02:44,067 INFO L273 TraceCheckUtils]: 24: Hoare triple {836#false} assume !(~i~0 < 100000); {836#false} is VALID [2018-11-23 12:02:44,067 INFO L273 TraceCheckUtils]: 25: Hoare triple {836#false} ~i~0 := 0; {836#false} is VALID [2018-11-23 12:02:44,067 INFO L273 TraceCheckUtils]: 26: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 12:02:44,067 INFO L273 TraceCheckUtils]: 27: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 12:02:44,068 INFO L273 TraceCheckUtils]: 28: Hoare triple {836#false} assume !(~i~0 < 100000); {836#false} is VALID [2018-11-23 12:02:44,068 INFO L273 TraceCheckUtils]: 29: Hoare triple {836#false} ~i~0 := 0; {836#false} is VALID [2018-11-23 12:02:44,068 INFO L273 TraceCheckUtils]: 30: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 12:02:44,068 INFO L273 TraceCheckUtils]: 31: Hoare triple {836#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {836#false} is VALID [2018-11-23 12:02:44,069 INFO L273 TraceCheckUtils]: 32: Hoare triple {836#false} assume !(~i~0 < 100000); {836#false} is VALID [2018-11-23 12:02:44,069 INFO L273 TraceCheckUtils]: 33: Hoare triple {836#false} havoc ~x~0;~x~0 := 0; {836#false} is VALID [2018-11-23 12:02:44,069 INFO L273 TraceCheckUtils]: 34: Hoare triple {836#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {836#false} is VALID [2018-11-23 12:02:44,069 INFO L256 TraceCheckUtils]: 35: Hoare triple {836#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {836#false} is VALID [2018-11-23 12:02:44,070 INFO L273 TraceCheckUtils]: 36: Hoare triple {836#false} ~cond := #in~cond; {836#false} is VALID [2018-11-23 12:02:44,070 INFO L273 TraceCheckUtils]: 37: Hoare triple {836#false} assume 0 == ~cond; {836#false} is VALID [2018-11-23 12:02:44,070 INFO L273 TraceCheckUtils]: 38: Hoare triple {836#false} assume !false; {836#false} is VALID [2018-11-23 12:02:44,073 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 12:02:44,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:44,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:02:44,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-11-23 12:02:44,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:44,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:02:44,144 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:44,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:02:44,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:02:44,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:02:44,145 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 6 states. [2018-11-23 12:02:44,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:44,559 INFO L93 Difference]: Finished difference Result 86 states and 106 transitions. [2018-11-23 12:02:44,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:02:44,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-11-23 12:02:44,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:44,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:02:44,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2018-11-23 12:02:44,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:02:44,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2018-11-23 12:02:44,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 94 transitions. [2018-11-23 12:02:44,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:44,675 INFO L225 Difference]: With dead ends: 86 [2018-11-23 12:02:44,676 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 12:02:44,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 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,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 12:02:44,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-23 12:02:44,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:44,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 51 states. [2018-11-23 12:02:44,735 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-23 12:02:44,735 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-23 12:02:44,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:44,739 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-11-23 12:02:44,739 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-23 12:02:44,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:44,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:44,740 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-23 12:02:44,740 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-23 12:02:44,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:44,743 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-11-23 12:02:44,744 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-23 12:02:44,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:44,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:44,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:44,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:44,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:02:44,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-11-23 12:02:44,748 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 39 [2018-11-23 12:02:44,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:44,748 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-11-23 12:02:44,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:02:44,748 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-23 12:02:44,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:02:44,750 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:44,750 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:44,750 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:44,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:44,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1394041657, now seen corresponding path program 3 times [2018-11-23 12:02:44,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:44,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:44,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:44,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:44,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:44,917 INFO L256 TraceCheckUtils]: 0: Hoare triple {1287#true} call ULTIMATE.init(); {1287#true} is VALID [2018-11-23 12:02:44,917 INFO L273 TraceCheckUtils]: 1: Hoare triple {1287#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1287#true} is VALID [2018-11-23 12:02:44,918 INFO L273 TraceCheckUtils]: 2: Hoare triple {1287#true} assume true; {1287#true} is VALID [2018-11-23 12:02:44,918 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1287#true} {1287#true} #126#return; {1287#true} is VALID [2018-11-23 12:02:44,918 INFO L256 TraceCheckUtils]: 4: Hoare triple {1287#true} call #t~ret2 := main(); {1287#true} is VALID [2018-11-23 12:02:44,919 INFO L273 TraceCheckUtils]: 5: Hoare triple {1287#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1289#(= main_~i~0 0)} is VALID [2018-11-23 12:02:44,920 INFO L273 TraceCheckUtils]: 6: Hoare triple {1289#(= 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; {1290#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:44,921 INFO L273 TraceCheckUtils]: 7: Hoare triple {1290#(<= 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; {1291#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:44,921 INFO L273 TraceCheckUtils]: 8: Hoare triple {1291#(<= 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; {1292#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:44,922 INFO L273 TraceCheckUtils]: 9: Hoare triple {1292#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1288#false} is VALID [2018-11-23 12:02:44,922 INFO L273 TraceCheckUtils]: 10: Hoare triple {1288#false} ~i~0 := 0; {1288#false} is VALID [2018-11-23 12:02:44,922 INFO L273 TraceCheckUtils]: 11: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 12:02:44,922 INFO L273 TraceCheckUtils]: 12: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 12:02:44,923 INFO L273 TraceCheckUtils]: 13: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 12:02:44,923 INFO L273 TraceCheckUtils]: 14: Hoare triple {1288#false} assume !(~i~0 < 100000); {1288#false} is VALID [2018-11-23 12:02:44,923 INFO L273 TraceCheckUtils]: 15: Hoare triple {1288#false} ~i~0 := 0; {1288#false} is VALID [2018-11-23 12:02:44,924 INFO L273 TraceCheckUtils]: 16: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 12:02:44,924 INFO L273 TraceCheckUtils]: 17: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 12:02:44,924 INFO L273 TraceCheckUtils]: 18: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 12:02:44,924 INFO L273 TraceCheckUtils]: 19: Hoare triple {1288#false} assume !(~i~0 < 100000); {1288#false} is VALID [2018-11-23 12:02:44,925 INFO L273 TraceCheckUtils]: 20: Hoare triple {1288#false} ~i~0 := 0; {1288#false} is VALID [2018-11-23 12:02:44,925 INFO L273 TraceCheckUtils]: 21: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 12:02:44,925 INFO L273 TraceCheckUtils]: 22: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 12:02:44,926 INFO L273 TraceCheckUtils]: 23: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 12:02:44,926 INFO L273 TraceCheckUtils]: 24: Hoare triple {1288#false} assume !(~i~0 < 100000); {1288#false} is VALID [2018-11-23 12:02:44,926 INFO L273 TraceCheckUtils]: 25: Hoare triple {1288#false} ~i~0 := 0; {1288#false} is VALID [2018-11-23 12:02:44,926 INFO L273 TraceCheckUtils]: 26: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 12:02:44,927 INFO L273 TraceCheckUtils]: 27: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 12:02:44,927 INFO L273 TraceCheckUtils]: 28: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 12:02:44,927 INFO L273 TraceCheckUtils]: 29: Hoare triple {1288#false} assume !(~i~0 < 100000); {1288#false} is VALID [2018-11-23 12:02:44,927 INFO L273 TraceCheckUtils]: 30: Hoare triple {1288#false} ~i~0 := 0; {1288#false} is VALID [2018-11-23 12:02:44,928 INFO L273 TraceCheckUtils]: 31: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 12:02:44,928 INFO L273 TraceCheckUtils]: 32: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 12:02:44,928 INFO L273 TraceCheckUtils]: 33: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 12:02:44,928 INFO L273 TraceCheckUtils]: 34: Hoare triple {1288#false} assume !(~i~0 < 100000); {1288#false} is VALID [2018-11-23 12:02:44,929 INFO L273 TraceCheckUtils]: 35: Hoare triple {1288#false} ~i~0 := 0; {1288#false} is VALID [2018-11-23 12:02:44,929 INFO L273 TraceCheckUtils]: 36: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 12:02:44,929 INFO L273 TraceCheckUtils]: 37: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 12:02:44,930 INFO L273 TraceCheckUtils]: 38: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 12:02:44,930 INFO L273 TraceCheckUtils]: 39: Hoare triple {1288#false} assume !(~i~0 < 100000); {1288#false} is VALID [2018-11-23 12:02:44,930 INFO L273 TraceCheckUtils]: 40: Hoare triple {1288#false} havoc ~x~0;~x~0 := 0; {1288#false} is VALID [2018-11-23 12:02:44,930 INFO L273 TraceCheckUtils]: 41: Hoare triple {1288#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1288#false} is VALID [2018-11-23 12:02:44,931 INFO L256 TraceCheckUtils]: 42: Hoare triple {1288#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {1288#false} is VALID [2018-11-23 12:02:44,931 INFO L273 TraceCheckUtils]: 43: Hoare triple {1288#false} ~cond := #in~cond; {1288#false} is VALID [2018-11-23 12:02:44,931 INFO L273 TraceCheckUtils]: 44: Hoare triple {1288#false} assume 0 == ~cond; {1288#false} is VALID [2018-11-23 12:02:44,932 INFO L273 TraceCheckUtils]: 45: Hoare triple {1288#false} assume !false; {1288#false} is VALID [2018-11-23 12:02:44,935 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:02:44,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:44,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 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,954 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:02:45,016 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:02:45,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:45,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:45,182 INFO L256 TraceCheckUtils]: 0: Hoare triple {1287#true} call ULTIMATE.init(); {1287#true} is VALID [2018-11-23 12:02:45,183 INFO L273 TraceCheckUtils]: 1: Hoare triple {1287#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1287#true} is VALID [2018-11-23 12:02:45,183 INFO L273 TraceCheckUtils]: 2: Hoare triple {1287#true} assume true; {1287#true} is VALID [2018-11-23 12:02:45,183 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1287#true} {1287#true} #126#return; {1287#true} is VALID [2018-11-23 12:02:45,184 INFO L256 TraceCheckUtils]: 4: Hoare triple {1287#true} call #t~ret2 := main(); {1287#true} is VALID [2018-11-23 12:02:45,184 INFO L273 TraceCheckUtils]: 5: Hoare triple {1287#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1287#true} is VALID [2018-11-23 12:02:45,184 INFO L273 TraceCheckUtils]: 6: Hoare triple {1287#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#true} is VALID [2018-11-23 12:02:45,185 INFO L273 TraceCheckUtils]: 7: Hoare triple {1287#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#true} is VALID [2018-11-23 12:02:45,185 INFO L273 TraceCheckUtils]: 8: Hoare triple {1287#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#true} is VALID [2018-11-23 12:02:45,185 INFO L273 TraceCheckUtils]: 9: Hoare triple {1287#true} assume !(~i~0 < 100000); {1287#true} is VALID [2018-11-23 12:02:45,186 INFO L273 TraceCheckUtils]: 10: Hoare triple {1287#true} ~i~0 := 0; {1287#true} is VALID [2018-11-23 12:02:45,186 INFO L273 TraceCheckUtils]: 11: Hoare triple {1287#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#true} is VALID [2018-11-23 12:02:45,186 INFO L273 TraceCheckUtils]: 12: Hoare triple {1287#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#true} is VALID [2018-11-23 12:02:45,187 INFO L273 TraceCheckUtils]: 13: Hoare triple {1287#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#true} is VALID [2018-11-23 12:02:45,187 INFO L273 TraceCheckUtils]: 14: Hoare triple {1287#true} assume !(~i~0 < 100000); {1287#true} is VALID [2018-11-23 12:02:45,187 INFO L273 TraceCheckUtils]: 15: Hoare triple {1287#true} ~i~0 := 0; {1287#true} is VALID [2018-11-23 12:02:45,188 INFO L273 TraceCheckUtils]: 16: Hoare triple {1287#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#true} is VALID [2018-11-23 12:02:45,188 INFO L273 TraceCheckUtils]: 17: Hoare triple {1287#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#true} is VALID [2018-11-23 12:02:45,188 INFO L273 TraceCheckUtils]: 18: Hoare triple {1287#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#true} is VALID [2018-11-23 12:02:45,188 INFO L273 TraceCheckUtils]: 19: Hoare triple {1287#true} assume !(~i~0 < 100000); {1287#true} is VALID [2018-11-23 12:02:45,189 INFO L273 TraceCheckUtils]: 20: Hoare triple {1287#true} ~i~0 := 0; {1287#true} is VALID [2018-11-23 12:02:45,189 INFO L273 TraceCheckUtils]: 21: Hoare triple {1287#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#true} is VALID [2018-11-23 12:02:45,189 INFO L273 TraceCheckUtils]: 22: Hoare triple {1287#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#true} is VALID [2018-11-23 12:02:45,190 INFO L273 TraceCheckUtils]: 23: Hoare triple {1287#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#true} is VALID [2018-11-23 12:02:45,190 INFO L273 TraceCheckUtils]: 24: Hoare triple {1287#true} assume !(~i~0 < 100000); {1287#true} is VALID [2018-11-23 12:02:45,190 INFO L273 TraceCheckUtils]: 25: Hoare triple {1287#true} ~i~0 := 0; {1287#true} is VALID [2018-11-23 12:02:45,190 INFO L273 TraceCheckUtils]: 26: Hoare triple {1287#true} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#true} is VALID [2018-11-23 12:02:45,191 INFO L273 TraceCheckUtils]: 27: Hoare triple {1287#true} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#true} is VALID [2018-11-23 12:02:45,191 INFO L273 TraceCheckUtils]: 28: Hoare triple {1287#true} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#true} is VALID [2018-11-23 12:02:45,191 INFO L273 TraceCheckUtils]: 29: Hoare triple {1287#true} assume !(~i~0 < 100000); {1287#true} is VALID [2018-11-23 12:02:45,208 INFO L273 TraceCheckUtils]: 30: Hoare triple {1287#true} ~i~0 := 0; {1386#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:45,222 INFO L273 TraceCheckUtils]: 31: Hoare triple {1386#(<= 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; {1290#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:45,229 INFO L273 TraceCheckUtils]: 32: Hoare triple {1290#(<= 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; {1291#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:45,231 INFO L273 TraceCheckUtils]: 33: Hoare triple {1291#(<= 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; {1292#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:45,235 INFO L273 TraceCheckUtils]: 34: Hoare triple {1292#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1288#false} is VALID [2018-11-23 12:02:45,235 INFO L273 TraceCheckUtils]: 35: Hoare triple {1288#false} ~i~0 := 0; {1288#false} is VALID [2018-11-23 12:02:45,235 INFO L273 TraceCheckUtils]: 36: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 12:02:45,235 INFO L273 TraceCheckUtils]: 37: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 12:02:45,236 INFO L273 TraceCheckUtils]: 38: Hoare triple {1288#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1288#false} is VALID [2018-11-23 12:02:45,236 INFO L273 TraceCheckUtils]: 39: Hoare triple {1288#false} assume !(~i~0 < 100000); {1288#false} is VALID [2018-11-23 12:02:45,236 INFO L273 TraceCheckUtils]: 40: Hoare triple {1288#false} havoc ~x~0;~x~0 := 0; {1288#false} is VALID [2018-11-23 12:02:45,236 INFO L273 TraceCheckUtils]: 41: Hoare triple {1288#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1288#false} is VALID [2018-11-23 12:02:45,236 INFO L256 TraceCheckUtils]: 42: Hoare triple {1288#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {1288#false} is VALID [2018-11-23 12:02:45,237 INFO L273 TraceCheckUtils]: 43: Hoare triple {1288#false} ~cond := #in~cond; {1288#false} is VALID [2018-11-23 12:02:45,237 INFO L273 TraceCheckUtils]: 44: Hoare triple {1288#false} assume 0 == ~cond; {1288#false} is VALID [2018-11-23 12:02:45,237 INFO L273 TraceCheckUtils]: 45: Hoare triple {1288#false} assume !false; {1288#false} is VALID [2018-11-23 12:02:45,240 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:02:45,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:45,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 12:02:45,269 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-11-23 12:02:45,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:45,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:02:45,348 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:02:45,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:02:45,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:02:45,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:02:45,349 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 7 states. [2018-11-23 12:02:45,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:45,722 INFO L93 Difference]: Finished difference Result 99 states and 119 transitions. [2018-11-23 12:02:45,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:02:45,722 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-11-23 12:02:45,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:45,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:02:45,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2018-11-23 12:02:45,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:02:45,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2018-11-23 12:02:45,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 101 transitions. [2018-11-23 12:02:45,984 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:45,988 INFO L225 Difference]: With dead ends: 99 [2018-11-23 12:02:45,988 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 12:02:45,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 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,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 12:02:46,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-23 12:02:46,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:46,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-23 12:02:46,098 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 12:02:46,099 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 12:02:46,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:46,101 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-11-23 12:02:46,102 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2018-11-23 12:02:46,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:46,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:46,103 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 12:02:46,103 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 12:02:46,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:46,106 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-11-23 12:02:46,106 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2018-11-23 12:02:46,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:46,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:46,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:46,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:46,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 12:02:46,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2018-11-23 12:02:46,110 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 46 [2018-11-23 12:02:46,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:46,110 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2018-11-23 12:02:46,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:02:46,111 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2018-11-23 12:02:46,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 12:02:46,112 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:46,112 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:46,113 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:46,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:46,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1002468982, now seen corresponding path program 4 times [2018-11-23 12:02:46,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:46,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:46,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:46,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:46,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:46,300 INFO L256 TraceCheckUtils]: 0: Hoare triple {1815#true} call ULTIMATE.init(); {1815#true} is VALID [2018-11-23 12:02:46,300 INFO L273 TraceCheckUtils]: 1: Hoare triple {1815#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1815#true} is VALID [2018-11-23 12:02:46,300 INFO L273 TraceCheckUtils]: 2: Hoare triple {1815#true} assume true; {1815#true} is VALID [2018-11-23 12:02:46,300 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1815#true} {1815#true} #126#return; {1815#true} is VALID [2018-11-23 12:02:46,301 INFO L256 TraceCheckUtils]: 4: Hoare triple {1815#true} call #t~ret2 := main(); {1815#true} is VALID [2018-11-23 12:02:46,301 INFO L273 TraceCheckUtils]: 5: Hoare triple {1815#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1817#(= main_~i~0 0)} is VALID [2018-11-23 12:02:46,302 INFO L273 TraceCheckUtils]: 6: Hoare triple {1817#(= 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; {1818#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:46,304 INFO L273 TraceCheckUtils]: 7: Hoare triple {1818#(<= 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; {1819#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:46,305 INFO L273 TraceCheckUtils]: 8: Hoare triple {1819#(<= 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; {1820#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:46,306 INFO L273 TraceCheckUtils]: 9: Hoare triple {1820#(<= 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; {1821#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:46,307 INFO L273 TraceCheckUtils]: 10: Hoare triple {1821#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 12:02:46,307 INFO L273 TraceCheckUtils]: 11: Hoare triple {1816#false} ~i~0 := 0; {1816#false} is VALID [2018-11-23 12:02:46,307 INFO L273 TraceCheckUtils]: 12: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,307 INFO L273 TraceCheckUtils]: 13: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,308 INFO L273 TraceCheckUtils]: 14: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,308 INFO L273 TraceCheckUtils]: 15: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,309 INFO L273 TraceCheckUtils]: 16: Hoare triple {1816#false} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 12:02:46,309 INFO L273 TraceCheckUtils]: 17: Hoare triple {1816#false} ~i~0 := 0; {1816#false} is VALID [2018-11-23 12:02:46,309 INFO L273 TraceCheckUtils]: 18: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,310 INFO L273 TraceCheckUtils]: 19: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,310 INFO L273 TraceCheckUtils]: 20: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,310 INFO L273 TraceCheckUtils]: 21: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,310 INFO L273 TraceCheckUtils]: 22: Hoare triple {1816#false} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 12:02:46,311 INFO L273 TraceCheckUtils]: 23: Hoare triple {1816#false} ~i~0 := 0; {1816#false} is VALID [2018-11-23 12:02:46,311 INFO L273 TraceCheckUtils]: 24: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,311 INFO L273 TraceCheckUtils]: 25: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,311 INFO L273 TraceCheckUtils]: 26: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,311 INFO L273 TraceCheckUtils]: 27: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,312 INFO L273 TraceCheckUtils]: 28: Hoare triple {1816#false} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 12:02:46,312 INFO L273 TraceCheckUtils]: 29: Hoare triple {1816#false} ~i~0 := 0; {1816#false} is VALID [2018-11-23 12:02:46,312 INFO L273 TraceCheckUtils]: 30: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,312 INFO L273 TraceCheckUtils]: 31: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,313 INFO L273 TraceCheckUtils]: 32: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,313 INFO L273 TraceCheckUtils]: 33: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,313 INFO L273 TraceCheckUtils]: 34: Hoare triple {1816#false} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 12:02:46,313 INFO L273 TraceCheckUtils]: 35: Hoare triple {1816#false} ~i~0 := 0; {1816#false} is VALID [2018-11-23 12:02:46,313 INFO L273 TraceCheckUtils]: 36: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,313 INFO L273 TraceCheckUtils]: 37: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,314 INFO L273 TraceCheckUtils]: 38: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,314 INFO L273 TraceCheckUtils]: 39: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,314 INFO L273 TraceCheckUtils]: 40: Hoare triple {1816#false} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 12:02:46,314 INFO L273 TraceCheckUtils]: 41: Hoare triple {1816#false} ~i~0 := 0; {1816#false} is VALID [2018-11-23 12:02:46,314 INFO L273 TraceCheckUtils]: 42: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,314 INFO L273 TraceCheckUtils]: 43: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,315 INFO L273 TraceCheckUtils]: 44: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,315 INFO L273 TraceCheckUtils]: 45: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,315 INFO L273 TraceCheckUtils]: 46: Hoare triple {1816#false} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 12:02:46,315 INFO L273 TraceCheckUtils]: 47: Hoare triple {1816#false} havoc ~x~0;~x~0 := 0; {1816#false} is VALID [2018-11-23 12:02:46,315 INFO L273 TraceCheckUtils]: 48: Hoare triple {1816#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1816#false} is VALID [2018-11-23 12:02:46,316 INFO L256 TraceCheckUtils]: 49: Hoare triple {1816#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {1816#false} is VALID [2018-11-23 12:02:46,316 INFO L273 TraceCheckUtils]: 50: Hoare triple {1816#false} ~cond := #in~cond; {1816#false} is VALID [2018-11-23 12:02:46,316 INFO L273 TraceCheckUtils]: 51: Hoare triple {1816#false} assume 0 == ~cond; {1816#false} is VALID [2018-11-23 12:02:46,316 INFO L273 TraceCheckUtils]: 52: Hoare triple {1816#false} assume !false; {1816#false} is VALID [2018-11-23 12:02:46,318 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 12:02:46,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:46,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 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:46,328 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:02:46,387 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:02:46,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:46,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:46,824 INFO L256 TraceCheckUtils]: 0: Hoare triple {1815#true} call ULTIMATE.init(); {1815#true} is VALID [2018-11-23 12:02:46,824 INFO L273 TraceCheckUtils]: 1: Hoare triple {1815#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1815#true} is VALID [2018-11-23 12:02:46,824 INFO L273 TraceCheckUtils]: 2: Hoare triple {1815#true} assume true; {1815#true} is VALID [2018-11-23 12:02:46,825 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1815#true} {1815#true} #126#return; {1815#true} is VALID [2018-11-23 12:02:46,825 INFO L256 TraceCheckUtils]: 4: Hoare triple {1815#true} call #t~ret2 := main(); {1815#true} is VALID [2018-11-23 12:02:46,826 INFO L273 TraceCheckUtils]: 5: Hoare triple {1815#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1840#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:46,827 INFO L273 TraceCheckUtils]: 6: Hoare triple {1840#(<= 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; {1818#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:46,828 INFO L273 TraceCheckUtils]: 7: Hoare triple {1818#(<= 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; {1819#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:46,828 INFO L273 TraceCheckUtils]: 8: Hoare triple {1819#(<= 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; {1820#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:46,829 INFO L273 TraceCheckUtils]: 9: Hoare triple {1820#(<= 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; {1821#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:46,830 INFO L273 TraceCheckUtils]: 10: Hoare triple {1821#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 12:02:46,831 INFO L273 TraceCheckUtils]: 11: Hoare triple {1816#false} ~i~0 := 0; {1816#false} is VALID [2018-11-23 12:02:46,831 INFO L273 TraceCheckUtils]: 12: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,831 INFO L273 TraceCheckUtils]: 13: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,832 INFO L273 TraceCheckUtils]: 14: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,832 INFO L273 TraceCheckUtils]: 15: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,832 INFO L273 TraceCheckUtils]: 16: Hoare triple {1816#false} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 12:02:46,833 INFO L273 TraceCheckUtils]: 17: Hoare triple {1816#false} ~i~0 := 0; {1816#false} is VALID [2018-11-23 12:02:46,833 INFO L273 TraceCheckUtils]: 18: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,833 INFO L273 TraceCheckUtils]: 19: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,834 INFO L273 TraceCheckUtils]: 20: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,834 INFO L273 TraceCheckUtils]: 21: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,834 INFO L273 TraceCheckUtils]: 22: Hoare triple {1816#false} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 12:02:46,835 INFO L273 TraceCheckUtils]: 23: Hoare triple {1816#false} ~i~0 := 0; {1816#false} is VALID [2018-11-23 12:02:46,835 INFO L273 TraceCheckUtils]: 24: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,835 INFO L273 TraceCheckUtils]: 25: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,835 INFO L273 TraceCheckUtils]: 26: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,836 INFO L273 TraceCheckUtils]: 27: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,836 INFO L273 TraceCheckUtils]: 28: Hoare triple {1816#false} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 12:02:46,836 INFO L273 TraceCheckUtils]: 29: Hoare triple {1816#false} ~i~0 := 0; {1816#false} is VALID [2018-11-23 12:02:46,836 INFO L273 TraceCheckUtils]: 30: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,837 INFO L273 TraceCheckUtils]: 31: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,837 INFO L273 TraceCheckUtils]: 32: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,837 INFO L273 TraceCheckUtils]: 33: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,837 INFO L273 TraceCheckUtils]: 34: Hoare triple {1816#false} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 12:02:46,838 INFO L273 TraceCheckUtils]: 35: Hoare triple {1816#false} ~i~0 := 0; {1816#false} is VALID [2018-11-23 12:02:46,838 INFO L273 TraceCheckUtils]: 36: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,838 INFO L273 TraceCheckUtils]: 37: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,838 INFO L273 TraceCheckUtils]: 38: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,839 INFO L273 TraceCheckUtils]: 39: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,839 INFO L273 TraceCheckUtils]: 40: Hoare triple {1816#false} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 12:02:46,839 INFO L273 TraceCheckUtils]: 41: Hoare triple {1816#false} ~i~0 := 0; {1816#false} is VALID [2018-11-23 12:02:46,839 INFO L273 TraceCheckUtils]: 42: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,840 INFO L273 TraceCheckUtils]: 43: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,840 INFO L273 TraceCheckUtils]: 44: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,840 INFO L273 TraceCheckUtils]: 45: Hoare triple {1816#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1816#false} is VALID [2018-11-23 12:02:46,841 INFO L273 TraceCheckUtils]: 46: Hoare triple {1816#false} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 12:02:46,841 INFO L273 TraceCheckUtils]: 47: Hoare triple {1816#false} havoc ~x~0;~x~0 := 0; {1816#false} is VALID [2018-11-23 12:02:46,841 INFO L273 TraceCheckUtils]: 48: Hoare triple {1816#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1816#false} is VALID [2018-11-23 12:02:46,841 INFO L256 TraceCheckUtils]: 49: Hoare triple {1816#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {1816#false} is VALID [2018-11-23 12:02:46,842 INFO L273 TraceCheckUtils]: 50: Hoare triple {1816#false} ~cond := #in~cond; {1816#false} is VALID [2018-11-23 12:02:46,842 INFO L273 TraceCheckUtils]: 51: Hoare triple {1816#false} assume 0 == ~cond; {1816#false} is VALID [2018-11-23 12:02:46,842 INFO L273 TraceCheckUtils]: 52: Hoare triple {1816#false} assume !false; {1816#false} is VALID [2018-11-23 12:02:46,845 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 12:02:46,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:46,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:02:46,866 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-23 12:02:46,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:46,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:02:46,944 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:46,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:02:46,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:02:46,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:02:46,945 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand 8 states. [2018-11-23 12:02:47,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:47,793 INFO L93 Difference]: Finished difference Result 112 states and 132 transitions. [2018-11-23 12:02:47,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:02:47,793 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-23 12:02:47,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:47,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:02:47,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2018-11-23 12:02:47,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:02:47,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2018-11-23 12:02:47,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 108 transitions. [2018-11-23 12:02:48,096 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:48,100 INFO L225 Difference]: With dead ends: 112 [2018-11-23 12:02:48,100 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 12:02:48,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:02:48,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 12:02:48,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-23 12:02:48,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:48,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 65 states. [2018-11-23 12:02:48,257 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2018-11-23 12:02:48,257 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2018-11-23 12:02:48,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:48,260 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2018-11-23 12:02:48,260 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-11-23 12:02:48,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:48,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:48,261 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2018-11-23 12:02:48,261 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2018-11-23 12:02:48,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:48,264 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2018-11-23 12:02:48,264 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-11-23 12:02:48,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:48,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:48,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:48,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:48,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 12:02:48,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2018-11-23 12:02:48,267 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 53 [2018-11-23 12:02:48,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:48,267 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-11-23 12:02:48,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:02:48,268 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-11-23 12:02:48,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 12:02:48,269 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:48,269 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:48,269 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:48,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:48,270 INFO L82 PathProgramCache]: Analyzing trace with hash 451754087, now seen corresponding path program 5 times [2018-11-23 12:02:48,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:48,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:48,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:48,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:48,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:48,549 INFO L256 TraceCheckUtils]: 0: Hoare triple {2419#true} call ULTIMATE.init(); {2419#true} is VALID [2018-11-23 12:02:48,549 INFO L273 TraceCheckUtils]: 1: Hoare triple {2419#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2419#true} is VALID [2018-11-23 12:02:48,550 INFO L273 TraceCheckUtils]: 2: Hoare triple {2419#true} assume true; {2419#true} is VALID [2018-11-23 12:02:48,550 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2419#true} {2419#true} #126#return; {2419#true} is VALID [2018-11-23 12:02:48,550 INFO L256 TraceCheckUtils]: 4: Hoare triple {2419#true} call #t~ret2 := main(); {2419#true} is VALID [2018-11-23 12:02:48,552 INFO L273 TraceCheckUtils]: 5: Hoare triple {2419#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2421#(= main_~i~0 0)} is VALID [2018-11-23 12:02:48,558 INFO L273 TraceCheckUtils]: 6: Hoare triple {2421#(= 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; {2422#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:48,559 INFO L273 TraceCheckUtils]: 7: Hoare triple {2422#(<= 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; {2423#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:48,560 INFO L273 TraceCheckUtils]: 8: Hoare triple {2423#(<= 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; {2424#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:48,561 INFO L273 TraceCheckUtils]: 9: Hoare triple {2424#(<= 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; {2425#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:48,561 INFO L273 TraceCheckUtils]: 10: Hoare triple {2425#(<= 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; {2426#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:48,562 INFO L273 TraceCheckUtils]: 11: Hoare triple {2426#(<= main_~i~0 5)} assume !(~i~0 < 100000); {2420#false} is VALID [2018-11-23 12:02:48,562 INFO L273 TraceCheckUtils]: 12: Hoare triple {2420#false} ~i~0 := 0; {2420#false} is VALID [2018-11-23 12:02:48,562 INFO L273 TraceCheckUtils]: 13: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:02:48,562 INFO L273 TraceCheckUtils]: 14: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:02:48,562 INFO L273 TraceCheckUtils]: 15: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:02:48,562 INFO L273 TraceCheckUtils]: 16: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:02:48,562 INFO L273 TraceCheckUtils]: 17: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:02:48,563 INFO L273 TraceCheckUtils]: 18: Hoare triple {2420#false} assume !(~i~0 < 100000); {2420#false} is VALID [2018-11-23 12:02:48,563 INFO L273 TraceCheckUtils]: 19: Hoare triple {2420#false} ~i~0 := 0; {2420#false} is VALID [2018-11-23 12:02:48,563 INFO L273 TraceCheckUtils]: 20: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:02:48,563 INFO L273 TraceCheckUtils]: 21: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:02:48,563 INFO L273 TraceCheckUtils]: 22: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:02:48,564 INFO L273 TraceCheckUtils]: 23: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:02:48,564 INFO L273 TraceCheckUtils]: 24: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:02:48,564 INFO L273 TraceCheckUtils]: 25: Hoare triple {2420#false} assume !(~i~0 < 100000); {2420#false} is VALID [2018-11-23 12:02:48,564 INFO L273 TraceCheckUtils]: 26: Hoare triple {2420#false} ~i~0 := 0; {2420#false} is VALID [2018-11-23 12:02:48,565 INFO L273 TraceCheckUtils]: 27: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:02:48,565 INFO L273 TraceCheckUtils]: 28: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:02:48,565 INFO L273 TraceCheckUtils]: 29: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:02:48,565 INFO L273 TraceCheckUtils]: 30: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:02:48,566 INFO L273 TraceCheckUtils]: 31: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:02:48,566 INFO L273 TraceCheckUtils]: 32: Hoare triple {2420#false} assume !(~i~0 < 100000); {2420#false} is VALID [2018-11-23 12:02:48,566 INFO L273 TraceCheckUtils]: 33: Hoare triple {2420#false} ~i~0 := 0; {2420#false} is VALID [2018-11-23 12:02:48,566 INFO L273 TraceCheckUtils]: 34: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:02:48,566 INFO L273 TraceCheckUtils]: 35: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:02:48,566 INFO L273 TraceCheckUtils]: 36: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:02:48,567 INFO L273 TraceCheckUtils]: 37: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:02:48,567 INFO L273 TraceCheckUtils]: 38: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:02:48,567 INFO L273 TraceCheckUtils]: 39: Hoare triple {2420#false} assume !(~i~0 < 100000); {2420#false} is VALID [2018-11-23 12:02:48,567 INFO L273 TraceCheckUtils]: 40: Hoare triple {2420#false} ~i~0 := 0; {2420#false} is VALID [2018-11-23 12:02:48,567 INFO L273 TraceCheckUtils]: 41: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:02:48,567 INFO L273 TraceCheckUtils]: 42: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:02:48,567 INFO L273 TraceCheckUtils]: 43: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:02:48,568 INFO L273 TraceCheckUtils]: 44: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:02:48,568 INFO L273 TraceCheckUtils]: 45: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:02:48,568 INFO L273 TraceCheckUtils]: 46: Hoare triple {2420#false} assume !(~i~0 < 100000); {2420#false} is VALID [2018-11-23 12:02:48,568 INFO L273 TraceCheckUtils]: 47: Hoare triple {2420#false} ~i~0 := 0; {2420#false} is VALID [2018-11-23 12:02:48,568 INFO L273 TraceCheckUtils]: 48: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:02:48,568 INFO L273 TraceCheckUtils]: 49: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:02:48,568 INFO L273 TraceCheckUtils]: 50: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:02:48,569 INFO L273 TraceCheckUtils]: 51: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:02:48,569 INFO L273 TraceCheckUtils]: 52: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:02:48,569 INFO L273 TraceCheckUtils]: 53: Hoare triple {2420#false} assume !(~i~0 < 100000); {2420#false} is VALID [2018-11-23 12:02:48,569 INFO L273 TraceCheckUtils]: 54: Hoare triple {2420#false} havoc ~x~0;~x~0 := 0; {2420#false} is VALID [2018-11-23 12:02:48,569 INFO L273 TraceCheckUtils]: 55: Hoare triple {2420#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2420#false} is VALID [2018-11-23 12:02:48,569 INFO L256 TraceCheckUtils]: 56: Hoare triple {2420#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {2420#false} is VALID [2018-11-23 12:02:48,570 INFO L273 TraceCheckUtils]: 57: Hoare triple {2420#false} ~cond := #in~cond; {2420#false} is VALID [2018-11-23 12:02:48,570 INFO L273 TraceCheckUtils]: 58: Hoare triple {2420#false} assume 0 == ~cond; {2420#false} is VALID [2018-11-23 12:02:48,570 INFO L273 TraceCheckUtils]: 59: Hoare triple {2420#false} assume !false; {2420#false} is VALID [2018-11-23 12:02:48,572 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-23 12:02:48,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:48,572 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:48,581 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:03:02,088 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 12:03:02,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:02,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:02,239 INFO L256 TraceCheckUtils]: 0: Hoare triple {2419#true} call ULTIMATE.init(); {2419#true} is VALID [2018-11-23 12:03:02,239 INFO L273 TraceCheckUtils]: 1: Hoare triple {2419#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2419#true} is VALID [2018-11-23 12:03:02,239 INFO L273 TraceCheckUtils]: 2: Hoare triple {2419#true} assume true; {2419#true} is VALID [2018-11-23 12:03:02,239 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2419#true} {2419#true} #126#return; {2419#true} is VALID [2018-11-23 12:03:02,239 INFO L256 TraceCheckUtils]: 4: Hoare triple {2419#true} call #t~ret2 := main(); {2419#true} is VALID [2018-11-23 12:03:02,240 INFO L273 TraceCheckUtils]: 5: Hoare triple {2419#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2419#true} is VALID [2018-11-23 12:03:02,240 INFO L273 TraceCheckUtils]: 6: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 12:03:02,240 INFO L273 TraceCheckUtils]: 7: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 12:03:02,240 INFO L273 TraceCheckUtils]: 8: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 12:03:02,240 INFO L273 TraceCheckUtils]: 9: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 12:03:02,240 INFO L273 TraceCheckUtils]: 10: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 12:03:02,240 INFO L273 TraceCheckUtils]: 11: Hoare triple {2419#true} assume !(~i~0 < 100000); {2419#true} is VALID [2018-11-23 12:03:02,241 INFO L273 TraceCheckUtils]: 12: Hoare triple {2419#true} ~i~0 := 0; {2419#true} is VALID [2018-11-23 12:03:02,241 INFO L273 TraceCheckUtils]: 13: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 12:03:02,241 INFO L273 TraceCheckUtils]: 14: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 12:03:02,241 INFO L273 TraceCheckUtils]: 15: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 12:03:02,241 INFO L273 TraceCheckUtils]: 16: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 12:03:02,241 INFO L273 TraceCheckUtils]: 17: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 12:03:02,241 INFO L273 TraceCheckUtils]: 18: Hoare triple {2419#true} assume !(~i~0 < 100000); {2419#true} is VALID [2018-11-23 12:03:02,242 INFO L273 TraceCheckUtils]: 19: Hoare triple {2419#true} ~i~0 := 0; {2419#true} is VALID [2018-11-23 12:03:02,242 INFO L273 TraceCheckUtils]: 20: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 12:03:02,242 INFO L273 TraceCheckUtils]: 21: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 12:03:02,242 INFO L273 TraceCheckUtils]: 22: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 12:03:02,242 INFO L273 TraceCheckUtils]: 23: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 12:03:02,242 INFO L273 TraceCheckUtils]: 24: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 12:03:02,242 INFO L273 TraceCheckUtils]: 25: Hoare triple {2419#true} assume !(~i~0 < 100000); {2419#true} is VALID [2018-11-23 12:03:02,242 INFO L273 TraceCheckUtils]: 26: Hoare triple {2419#true} ~i~0 := 0; {2419#true} is VALID [2018-11-23 12:03:02,243 INFO L273 TraceCheckUtils]: 27: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 12:03:02,243 INFO L273 TraceCheckUtils]: 28: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 12:03:02,243 INFO L273 TraceCheckUtils]: 29: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 12:03:02,243 INFO L273 TraceCheckUtils]: 30: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 12:03:02,243 INFO L273 TraceCheckUtils]: 31: Hoare triple {2419#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2419#true} is VALID [2018-11-23 12:03:02,243 INFO L273 TraceCheckUtils]: 32: Hoare triple {2419#true} assume !(~i~0 < 100000); {2419#true} is VALID [2018-11-23 12:03:02,244 INFO L273 TraceCheckUtils]: 33: Hoare triple {2419#true} ~i~0 := 0; {2529#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:02,245 INFO L273 TraceCheckUtils]: 34: Hoare triple {2529#(<= 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; {2422#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:02,245 INFO L273 TraceCheckUtils]: 35: Hoare triple {2422#(<= 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; {2423#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:02,246 INFO L273 TraceCheckUtils]: 36: Hoare triple {2423#(<= 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; {2424#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:02,246 INFO L273 TraceCheckUtils]: 37: Hoare triple {2424#(<= 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; {2425#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:02,249 INFO L273 TraceCheckUtils]: 38: Hoare triple {2425#(<= 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; {2426#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:02,250 INFO L273 TraceCheckUtils]: 39: Hoare triple {2426#(<= main_~i~0 5)} assume !(~i~0 < 100000); {2420#false} is VALID [2018-11-23 12:03:02,250 INFO L273 TraceCheckUtils]: 40: Hoare triple {2420#false} ~i~0 := 0; {2420#false} is VALID [2018-11-23 12:03:02,250 INFO L273 TraceCheckUtils]: 41: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:03:02,250 INFO L273 TraceCheckUtils]: 42: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:03:02,251 INFO L273 TraceCheckUtils]: 43: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:03:02,251 INFO L273 TraceCheckUtils]: 44: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:03:02,251 INFO L273 TraceCheckUtils]: 45: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:03:02,251 INFO L273 TraceCheckUtils]: 46: Hoare triple {2420#false} assume !(~i~0 < 100000); {2420#false} is VALID [2018-11-23 12:03:02,251 INFO L273 TraceCheckUtils]: 47: Hoare triple {2420#false} ~i~0 := 0; {2420#false} is VALID [2018-11-23 12:03:02,251 INFO L273 TraceCheckUtils]: 48: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:03:02,251 INFO L273 TraceCheckUtils]: 49: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:03:02,252 INFO L273 TraceCheckUtils]: 50: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:03:02,252 INFO L273 TraceCheckUtils]: 51: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:03:02,252 INFO L273 TraceCheckUtils]: 52: Hoare triple {2420#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2420#false} is VALID [2018-11-23 12:03:02,252 INFO L273 TraceCheckUtils]: 53: Hoare triple {2420#false} assume !(~i~0 < 100000); {2420#false} is VALID [2018-11-23 12:03:02,252 INFO L273 TraceCheckUtils]: 54: Hoare triple {2420#false} havoc ~x~0;~x~0 := 0; {2420#false} is VALID [2018-11-23 12:03:02,252 INFO L273 TraceCheckUtils]: 55: Hoare triple {2420#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2420#false} is VALID [2018-11-23 12:03:02,252 INFO L256 TraceCheckUtils]: 56: Hoare triple {2420#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {2420#false} is VALID [2018-11-23 12:03:02,253 INFO L273 TraceCheckUtils]: 57: Hoare triple {2420#false} ~cond := #in~cond; {2420#false} is VALID [2018-11-23 12:03:02,253 INFO L273 TraceCheckUtils]: 58: Hoare triple {2420#false} assume 0 == ~cond; {2420#false} is VALID [2018-11-23 12:03:02,253 INFO L273 TraceCheckUtils]: 59: Hoare triple {2420#false} assume !false; {2420#false} is VALID [2018-11-23 12:03:02,255 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-23 12:03:02,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:02,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:03:02,279 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-11-23 12:03:02,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:02,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:03:02,328 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:02,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:03:02,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:03:02,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:03:02,329 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 9 states. [2018-11-23 12:03:03,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:03,012 INFO L93 Difference]: Finished difference Result 125 states and 145 transitions. [2018-11-23 12:03:03,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:03:03,012 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-11-23 12:03:03,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:03,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:03:03,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 115 transitions. [2018-11-23 12:03:03,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:03:03,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 115 transitions. [2018-11-23 12:03:03,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 115 transitions. [2018-11-23 12:03:03,201 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:03,203 INFO L225 Difference]: With dead ends: 125 [2018-11-23 12:03:03,203 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 12:03:03,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 60 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:03:03,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 12:03:03,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-23 12:03:03,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:03,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 72 states. [2018-11-23 12:03:03,299 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-23 12:03:03,299 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-23 12:03:03,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:03,302 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2018-11-23 12:03:03,302 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-11-23 12:03:03,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:03,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:03,303 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-23 12:03:03,303 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-23 12:03:03,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:03,305 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2018-11-23 12:03:03,306 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-11-23 12:03:03,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:03,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:03,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:03,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:03,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 12:03:03,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-11-23 12:03:03,309 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 60 [2018-11-23 12:03:03,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:03,309 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-11-23 12:03:03,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:03:03,309 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-11-23 12:03:03,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 12:03:03,310 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:03,310 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:03,311 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:03,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:03,311 INFO L82 PathProgramCache]: Analyzing trace with hash 757831402, now seen corresponding path program 6 times [2018-11-23 12:03:03,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:03,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:03,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:03,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:03,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:03,661 INFO L256 TraceCheckUtils]: 0: Hoare triple {3099#true} call ULTIMATE.init(); {3099#true} is VALID [2018-11-23 12:03:03,661 INFO L273 TraceCheckUtils]: 1: Hoare triple {3099#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3099#true} is VALID [2018-11-23 12:03:03,662 INFO L273 TraceCheckUtils]: 2: Hoare triple {3099#true} assume true; {3099#true} is VALID [2018-11-23 12:03:03,662 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3099#true} {3099#true} #126#return; {3099#true} is VALID [2018-11-23 12:03:03,662 INFO L256 TraceCheckUtils]: 4: Hoare triple {3099#true} call #t~ret2 := main(); {3099#true} is VALID [2018-11-23 12:03:03,668 INFO L273 TraceCheckUtils]: 5: Hoare triple {3099#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3101#(= main_~i~0 0)} is VALID [2018-11-23 12:03:03,668 INFO L273 TraceCheckUtils]: 6: Hoare triple {3101#(= 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; {3102#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:03,670 INFO L273 TraceCheckUtils]: 7: Hoare triple {3102#(<= 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; {3103#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:03,670 INFO L273 TraceCheckUtils]: 8: Hoare triple {3103#(<= 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; {3104#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:03,672 INFO L273 TraceCheckUtils]: 9: Hoare triple {3104#(<= 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; {3105#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:03,672 INFO L273 TraceCheckUtils]: 10: Hoare triple {3105#(<= 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; {3106#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:03,674 INFO L273 TraceCheckUtils]: 11: Hoare triple {3106#(<= 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; {3107#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:03,674 INFO L273 TraceCheckUtils]: 12: Hoare triple {3107#(<= main_~i~0 6)} assume !(~i~0 < 100000); {3100#false} is VALID [2018-11-23 12:03:03,675 INFO L273 TraceCheckUtils]: 13: Hoare triple {3100#false} ~i~0 := 0; {3100#false} is VALID [2018-11-23 12:03:03,675 INFO L273 TraceCheckUtils]: 14: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,675 INFO L273 TraceCheckUtils]: 15: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,675 INFO L273 TraceCheckUtils]: 16: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,676 INFO L273 TraceCheckUtils]: 17: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,676 INFO L273 TraceCheckUtils]: 18: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,676 INFO L273 TraceCheckUtils]: 19: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,676 INFO L273 TraceCheckUtils]: 20: Hoare triple {3100#false} assume !(~i~0 < 100000); {3100#false} is VALID [2018-11-23 12:03:03,676 INFO L273 TraceCheckUtils]: 21: Hoare triple {3100#false} ~i~0 := 0; {3100#false} is VALID [2018-11-23 12:03:03,677 INFO L273 TraceCheckUtils]: 22: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,677 INFO L273 TraceCheckUtils]: 23: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,677 INFO L273 TraceCheckUtils]: 24: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,677 INFO L273 TraceCheckUtils]: 25: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,677 INFO L273 TraceCheckUtils]: 26: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,678 INFO L273 TraceCheckUtils]: 27: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,678 INFO L273 TraceCheckUtils]: 28: Hoare triple {3100#false} assume !(~i~0 < 100000); {3100#false} is VALID [2018-11-23 12:03:03,678 INFO L273 TraceCheckUtils]: 29: Hoare triple {3100#false} ~i~0 := 0; {3100#false} is VALID [2018-11-23 12:03:03,678 INFO L273 TraceCheckUtils]: 30: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,678 INFO L273 TraceCheckUtils]: 31: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,678 INFO L273 TraceCheckUtils]: 32: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,678 INFO L273 TraceCheckUtils]: 33: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,679 INFO L273 TraceCheckUtils]: 34: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,679 INFO L273 TraceCheckUtils]: 35: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,679 INFO L273 TraceCheckUtils]: 36: Hoare triple {3100#false} assume !(~i~0 < 100000); {3100#false} is VALID [2018-11-23 12:03:03,679 INFO L273 TraceCheckUtils]: 37: Hoare triple {3100#false} ~i~0 := 0; {3100#false} is VALID [2018-11-23 12:03:03,679 INFO L273 TraceCheckUtils]: 38: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,679 INFO L273 TraceCheckUtils]: 39: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,679 INFO L273 TraceCheckUtils]: 40: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,679 INFO L273 TraceCheckUtils]: 41: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,680 INFO L273 TraceCheckUtils]: 42: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,680 INFO L273 TraceCheckUtils]: 43: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,680 INFO L273 TraceCheckUtils]: 44: Hoare triple {3100#false} assume !(~i~0 < 100000); {3100#false} is VALID [2018-11-23 12:03:03,680 INFO L273 TraceCheckUtils]: 45: Hoare triple {3100#false} ~i~0 := 0; {3100#false} is VALID [2018-11-23 12:03:03,680 INFO L273 TraceCheckUtils]: 46: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,680 INFO L273 TraceCheckUtils]: 47: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,680 INFO L273 TraceCheckUtils]: 48: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,681 INFO L273 TraceCheckUtils]: 49: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,681 INFO L273 TraceCheckUtils]: 50: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,681 INFO L273 TraceCheckUtils]: 51: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,681 INFO L273 TraceCheckUtils]: 52: Hoare triple {3100#false} assume !(~i~0 < 100000); {3100#false} is VALID [2018-11-23 12:03:03,681 INFO L273 TraceCheckUtils]: 53: Hoare triple {3100#false} ~i~0 := 0; {3100#false} is VALID [2018-11-23 12:03:03,681 INFO L273 TraceCheckUtils]: 54: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,681 INFO L273 TraceCheckUtils]: 55: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,681 INFO L273 TraceCheckUtils]: 56: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,682 INFO L273 TraceCheckUtils]: 57: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,682 INFO L273 TraceCheckUtils]: 58: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,682 INFO L273 TraceCheckUtils]: 59: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:03,682 INFO L273 TraceCheckUtils]: 60: Hoare triple {3100#false} assume !(~i~0 < 100000); {3100#false} is VALID [2018-11-23 12:03:03,682 INFO L273 TraceCheckUtils]: 61: Hoare triple {3100#false} havoc ~x~0;~x~0 := 0; {3100#false} is VALID [2018-11-23 12:03:03,682 INFO L273 TraceCheckUtils]: 62: Hoare triple {3100#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3100#false} is VALID [2018-11-23 12:03:03,682 INFO L256 TraceCheckUtils]: 63: Hoare triple {3100#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {3100#false} is VALID [2018-11-23 12:03:03,683 INFO L273 TraceCheckUtils]: 64: Hoare triple {3100#false} ~cond := #in~cond; {3100#false} is VALID [2018-11-23 12:03:03,683 INFO L273 TraceCheckUtils]: 65: Hoare triple {3100#false} assume 0 == ~cond; {3100#false} is VALID [2018-11-23 12:03:03,683 INFO L273 TraceCheckUtils]: 66: Hoare triple {3100#false} assume !false; {3100#false} is VALID [2018-11-23 12:03:03,685 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-23 12:03:03,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:03,685 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:03:03,694 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:03:05,220 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-23 12:03:05,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:05,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:05,366 INFO L256 TraceCheckUtils]: 0: Hoare triple {3099#true} call ULTIMATE.init(); {3099#true} is VALID [2018-11-23 12:03:05,366 INFO L273 TraceCheckUtils]: 1: Hoare triple {3099#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3099#true} is VALID [2018-11-23 12:03:05,366 INFO L273 TraceCheckUtils]: 2: Hoare triple {3099#true} assume true; {3099#true} is VALID [2018-11-23 12:03:05,367 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3099#true} {3099#true} #126#return; {3099#true} is VALID [2018-11-23 12:03:05,367 INFO L256 TraceCheckUtils]: 4: Hoare triple {3099#true} call #t~ret2 := main(); {3099#true} is VALID [2018-11-23 12:03:05,367 INFO L273 TraceCheckUtils]: 5: Hoare triple {3099#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3126#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:05,368 INFO L273 TraceCheckUtils]: 6: Hoare triple {3126#(<= 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; {3102#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:05,369 INFO L273 TraceCheckUtils]: 7: Hoare triple {3102#(<= 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; {3103#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:05,369 INFO L273 TraceCheckUtils]: 8: Hoare triple {3103#(<= 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; {3104#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:05,370 INFO L273 TraceCheckUtils]: 9: Hoare triple {3104#(<= 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; {3105#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:05,370 INFO L273 TraceCheckUtils]: 10: Hoare triple {3105#(<= 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; {3106#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:05,371 INFO L273 TraceCheckUtils]: 11: Hoare triple {3106#(<= 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; {3107#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:05,372 INFO L273 TraceCheckUtils]: 12: Hoare triple {3107#(<= main_~i~0 6)} assume !(~i~0 < 100000); {3100#false} is VALID [2018-11-23 12:03:05,372 INFO L273 TraceCheckUtils]: 13: Hoare triple {3100#false} ~i~0 := 0; {3100#false} is VALID [2018-11-23 12:03:05,373 INFO L273 TraceCheckUtils]: 14: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,373 INFO L273 TraceCheckUtils]: 15: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,373 INFO L273 TraceCheckUtils]: 16: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,374 INFO L273 TraceCheckUtils]: 17: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,374 INFO L273 TraceCheckUtils]: 18: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,374 INFO L273 TraceCheckUtils]: 19: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,374 INFO L273 TraceCheckUtils]: 20: Hoare triple {3100#false} assume !(~i~0 < 100000); {3100#false} is VALID [2018-11-23 12:03:05,375 INFO L273 TraceCheckUtils]: 21: Hoare triple {3100#false} ~i~0 := 0; {3100#false} is VALID [2018-11-23 12:03:05,375 INFO L273 TraceCheckUtils]: 22: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,375 INFO L273 TraceCheckUtils]: 23: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,376 INFO L273 TraceCheckUtils]: 24: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,376 INFO L273 TraceCheckUtils]: 25: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,376 INFO L273 TraceCheckUtils]: 26: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,376 INFO L273 TraceCheckUtils]: 27: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,377 INFO L273 TraceCheckUtils]: 28: Hoare triple {3100#false} assume !(~i~0 < 100000); {3100#false} is VALID [2018-11-23 12:03:05,377 INFO L273 TraceCheckUtils]: 29: Hoare triple {3100#false} ~i~0 := 0; {3100#false} is VALID [2018-11-23 12:03:05,377 INFO L273 TraceCheckUtils]: 30: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,377 INFO L273 TraceCheckUtils]: 31: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,377 INFO L273 TraceCheckUtils]: 32: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,377 INFO L273 TraceCheckUtils]: 33: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,378 INFO L273 TraceCheckUtils]: 34: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,378 INFO L273 TraceCheckUtils]: 35: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,378 INFO L273 TraceCheckUtils]: 36: Hoare triple {3100#false} assume !(~i~0 < 100000); {3100#false} is VALID [2018-11-23 12:03:05,378 INFO L273 TraceCheckUtils]: 37: Hoare triple {3100#false} ~i~0 := 0; {3100#false} is VALID [2018-11-23 12:03:05,378 INFO L273 TraceCheckUtils]: 38: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,378 INFO L273 TraceCheckUtils]: 39: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,379 INFO L273 TraceCheckUtils]: 40: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,379 INFO L273 TraceCheckUtils]: 41: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,379 INFO L273 TraceCheckUtils]: 42: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,379 INFO L273 TraceCheckUtils]: 43: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,379 INFO L273 TraceCheckUtils]: 44: Hoare triple {3100#false} assume !(~i~0 < 100000); {3100#false} is VALID [2018-11-23 12:03:05,379 INFO L273 TraceCheckUtils]: 45: Hoare triple {3100#false} ~i~0 := 0; {3100#false} is VALID [2018-11-23 12:03:05,380 INFO L273 TraceCheckUtils]: 46: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,380 INFO L273 TraceCheckUtils]: 47: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,380 INFO L273 TraceCheckUtils]: 48: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,380 INFO L273 TraceCheckUtils]: 49: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,380 INFO L273 TraceCheckUtils]: 50: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,380 INFO L273 TraceCheckUtils]: 51: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,381 INFO L273 TraceCheckUtils]: 52: Hoare triple {3100#false} assume !(~i~0 < 100000); {3100#false} is VALID [2018-11-23 12:03:05,381 INFO L273 TraceCheckUtils]: 53: Hoare triple {3100#false} ~i~0 := 0; {3100#false} is VALID [2018-11-23 12:03:05,381 INFO L273 TraceCheckUtils]: 54: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,381 INFO L273 TraceCheckUtils]: 55: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,381 INFO L273 TraceCheckUtils]: 56: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,381 INFO L273 TraceCheckUtils]: 57: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,382 INFO L273 TraceCheckUtils]: 58: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,382 INFO L273 TraceCheckUtils]: 59: Hoare triple {3100#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3100#false} is VALID [2018-11-23 12:03:05,382 INFO L273 TraceCheckUtils]: 60: Hoare triple {3100#false} assume !(~i~0 < 100000); {3100#false} is VALID [2018-11-23 12:03:05,382 INFO L273 TraceCheckUtils]: 61: Hoare triple {3100#false} havoc ~x~0;~x~0 := 0; {3100#false} is VALID [2018-11-23 12:03:05,382 INFO L273 TraceCheckUtils]: 62: Hoare triple {3100#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3100#false} is VALID [2018-11-23 12:03:05,383 INFO L256 TraceCheckUtils]: 63: Hoare triple {3100#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {3100#false} is VALID [2018-11-23 12:03:05,383 INFO L273 TraceCheckUtils]: 64: Hoare triple {3100#false} ~cond := #in~cond; {3100#false} is VALID [2018-11-23 12:03:05,383 INFO L273 TraceCheckUtils]: 65: Hoare triple {3100#false} assume 0 == ~cond; {3100#false} is VALID [2018-11-23 12:03:05,383 INFO L273 TraceCheckUtils]: 66: Hoare triple {3100#false} assume !false; {3100#false} is VALID [2018-11-23 12:03:05,389 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-23 12:03:05,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:05,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 12:03:05,414 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2018-11-23 12:03:05,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:05,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:03:05,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:05,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:03:05,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:03:05,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:03:05,450 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 10 states. [2018-11-23 12:03:06,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:06,086 INFO L93 Difference]: Finished difference Result 138 states and 158 transitions. [2018-11-23 12:03:06,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:03:06,087 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2018-11-23 12:03:06,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:06,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:03:06,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2018-11-23 12:03:06,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:03:06,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2018-11-23 12:03:06,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 122 transitions. [2018-11-23 12:03:06,255 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:06,257 INFO L225 Difference]: With dead ends: 138 [2018-11-23 12:03:06,257 INFO L226 Difference]: Without dead ends: 79 [2018-11-23 12:03:06,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:03:06,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-23 12:03:06,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-11-23 12:03:06,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:06,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 79 states. [2018-11-23 12:03:06,314 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2018-11-23 12:03:06,314 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2018-11-23 12:03:06,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:06,318 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2018-11-23 12:03:06,318 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2018-11-23 12:03:06,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:06,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:06,319 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2018-11-23 12:03:06,319 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2018-11-23 12:03:06,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:06,321 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2018-11-23 12:03:06,321 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2018-11-23 12:03:06,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:06,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:06,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:06,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:06,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 12:03:06,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2018-11-23 12:03:06,324 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 67 [2018-11-23 12:03:06,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:06,325 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2018-11-23 12:03:06,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:03:06,325 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2018-11-23 12:03:06,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-23 12:03:06,326 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:06,326 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:06,326 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:06,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:06,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1686307833, now seen corresponding path program 7 times [2018-11-23 12:03:06,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:06,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:06,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:06,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:06,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:06,645 INFO L256 TraceCheckUtils]: 0: Hoare triple {3855#true} call ULTIMATE.init(); {3855#true} is VALID [2018-11-23 12:03:06,646 INFO L273 TraceCheckUtils]: 1: Hoare triple {3855#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3855#true} is VALID [2018-11-23 12:03:06,646 INFO L273 TraceCheckUtils]: 2: Hoare triple {3855#true} assume true; {3855#true} is VALID [2018-11-23 12:03:06,646 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3855#true} {3855#true} #126#return; {3855#true} is VALID [2018-11-23 12:03:06,646 INFO L256 TraceCheckUtils]: 4: Hoare triple {3855#true} call #t~ret2 := main(); {3855#true} is VALID [2018-11-23 12:03:06,647 INFO L273 TraceCheckUtils]: 5: Hoare triple {3855#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3857#(= main_~i~0 0)} is VALID [2018-11-23 12:03:06,648 INFO L273 TraceCheckUtils]: 6: Hoare triple {3857#(= 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; {3858#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:06,649 INFO L273 TraceCheckUtils]: 7: Hoare triple {3858#(<= 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; {3859#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:06,649 INFO L273 TraceCheckUtils]: 8: Hoare triple {3859#(<= 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; {3860#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:06,650 INFO L273 TraceCheckUtils]: 9: Hoare triple {3860#(<= 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; {3861#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:06,651 INFO L273 TraceCheckUtils]: 10: Hoare triple {3861#(<= 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; {3862#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:06,651 INFO L273 TraceCheckUtils]: 11: Hoare triple {3862#(<= 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; {3863#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:06,652 INFO L273 TraceCheckUtils]: 12: Hoare triple {3863#(<= 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; {3864#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:06,653 INFO L273 TraceCheckUtils]: 13: Hoare triple {3864#(<= main_~i~0 7)} assume !(~i~0 < 100000); {3856#false} is VALID [2018-11-23 12:03:06,653 INFO L273 TraceCheckUtils]: 14: Hoare triple {3856#false} ~i~0 := 0; {3856#false} is VALID [2018-11-23 12:03:06,653 INFO L273 TraceCheckUtils]: 15: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,653 INFO L273 TraceCheckUtils]: 16: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,654 INFO L273 TraceCheckUtils]: 17: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,654 INFO L273 TraceCheckUtils]: 18: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,654 INFO L273 TraceCheckUtils]: 19: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,655 INFO L273 TraceCheckUtils]: 20: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,655 INFO L273 TraceCheckUtils]: 21: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,655 INFO L273 TraceCheckUtils]: 22: Hoare triple {3856#false} assume !(~i~0 < 100000); {3856#false} is VALID [2018-11-23 12:03:06,656 INFO L273 TraceCheckUtils]: 23: Hoare triple {3856#false} ~i~0 := 0; {3856#false} is VALID [2018-11-23 12:03:06,656 INFO L273 TraceCheckUtils]: 24: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,656 INFO L273 TraceCheckUtils]: 25: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,656 INFO L273 TraceCheckUtils]: 26: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,657 INFO L273 TraceCheckUtils]: 27: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,657 INFO L273 TraceCheckUtils]: 28: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,657 INFO L273 TraceCheckUtils]: 29: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,658 INFO L273 TraceCheckUtils]: 30: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,658 INFO L273 TraceCheckUtils]: 31: Hoare triple {3856#false} assume !(~i~0 < 100000); {3856#false} is VALID [2018-11-23 12:03:06,658 INFO L273 TraceCheckUtils]: 32: Hoare triple {3856#false} ~i~0 := 0; {3856#false} is VALID [2018-11-23 12:03:06,658 INFO L273 TraceCheckUtils]: 33: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,658 INFO L273 TraceCheckUtils]: 34: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,658 INFO L273 TraceCheckUtils]: 35: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,659 INFO L273 TraceCheckUtils]: 36: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,659 INFO L273 TraceCheckUtils]: 37: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,659 INFO L273 TraceCheckUtils]: 38: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,659 INFO L273 TraceCheckUtils]: 39: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,659 INFO L273 TraceCheckUtils]: 40: Hoare triple {3856#false} assume !(~i~0 < 100000); {3856#false} is VALID [2018-11-23 12:03:06,659 INFO L273 TraceCheckUtils]: 41: Hoare triple {3856#false} ~i~0 := 0; {3856#false} is VALID [2018-11-23 12:03:06,660 INFO L273 TraceCheckUtils]: 42: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,660 INFO L273 TraceCheckUtils]: 43: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,660 INFO L273 TraceCheckUtils]: 44: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,660 INFO L273 TraceCheckUtils]: 45: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,660 INFO L273 TraceCheckUtils]: 46: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,661 INFO L273 TraceCheckUtils]: 47: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,661 INFO L273 TraceCheckUtils]: 48: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,661 INFO L273 TraceCheckUtils]: 49: Hoare triple {3856#false} assume !(~i~0 < 100000); {3856#false} is VALID [2018-11-23 12:03:06,661 INFO L273 TraceCheckUtils]: 50: Hoare triple {3856#false} ~i~0 := 0; {3856#false} is VALID [2018-11-23 12:03:06,661 INFO L273 TraceCheckUtils]: 51: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,661 INFO L273 TraceCheckUtils]: 52: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,662 INFO L273 TraceCheckUtils]: 53: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,662 INFO L273 TraceCheckUtils]: 54: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,662 INFO L273 TraceCheckUtils]: 55: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,662 INFO L273 TraceCheckUtils]: 56: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,662 INFO L273 TraceCheckUtils]: 57: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,662 INFO L273 TraceCheckUtils]: 58: Hoare triple {3856#false} assume !(~i~0 < 100000); {3856#false} is VALID [2018-11-23 12:03:06,663 INFO L273 TraceCheckUtils]: 59: Hoare triple {3856#false} ~i~0 := 0; {3856#false} is VALID [2018-11-23 12:03:06,663 INFO L273 TraceCheckUtils]: 60: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,663 INFO L273 TraceCheckUtils]: 61: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,663 INFO L273 TraceCheckUtils]: 62: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,663 INFO L273 TraceCheckUtils]: 63: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,663 INFO L273 TraceCheckUtils]: 64: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,664 INFO L273 TraceCheckUtils]: 65: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,664 INFO L273 TraceCheckUtils]: 66: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,664 INFO L273 TraceCheckUtils]: 67: Hoare triple {3856#false} assume !(~i~0 < 100000); {3856#false} is VALID [2018-11-23 12:03:06,664 INFO L273 TraceCheckUtils]: 68: Hoare triple {3856#false} havoc ~x~0;~x~0 := 0; {3856#false} is VALID [2018-11-23 12:03:06,664 INFO L273 TraceCheckUtils]: 69: Hoare triple {3856#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3856#false} is VALID [2018-11-23 12:03:06,665 INFO L256 TraceCheckUtils]: 70: Hoare triple {3856#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {3856#false} is VALID [2018-11-23 12:03:06,665 INFO L273 TraceCheckUtils]: 71: Hoare triple {3856#false} ~cond := #in~cond; {3856#false} is VALID [2018-11-23 12:03:06,665 INFO L273 TraceCheckUtils]: 72: Hoare triple {3856#false} assume 0 == ~cond; {3856#false} is VALID [2018-11-23 12:03:06,665 INFO L273 TraceCheckUtils]: 73: Hoare triple {3856#false} assume !false; {3856#false} is VALID [2018-11-23 12:03:06,668 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-11-23 12:03:06,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:06,669 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:03:06,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:03:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:06,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:06,891 INFO L256 TraceCheckUtils]: 0: Hoare triple {3855#true} call ULTIMATE.init(); {3855#true} is VALID [2018-11-23 12:03:06,892 INFO L273 TraceCheckUtils]: 1: Hoare triple {3855#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3855#true} is VALID [2018-11-23 12:03:06,892 INFO L273 TraceCheckUtils]: 2: Hoare triple {3855#true} assume true; {3855#true} is VALID [2018-11-23 12:03:06,892 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3855#true} {3855#true} #126#return; {3855#true} is VALID [2018-11-23 12:03:06,893 INFO L256 TraceCheckUtils]: 4: Hoare triple {3855#true} call #t~ret2 := main(); {3855#true} is VALID [2018-11-23 12:03:06,894 INFO L273 TraceCheckUtils]: 5: Hoare triple {3855#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3883#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:06,894 INFO L273 TraceCheckUtils]: 6: Hoare triple {3883#(<= 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; {3858#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:06,895 INFO L273 TraceCheckUtils]: 7: Hoare triple {3858#(<= 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; {3859#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:06,895 INFO L273 TraceCheckUtils]: 8: Hoare triple {3859#(<= 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; {3860#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:06,896 INFO L273 TraceCheckUtils]: 9: Hoare triple {3860#(<= 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; {3861#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:06,897 INFO L273 TraceCheckUtils]: 10: Hoare triple {3861#(<= 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; {3862#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:06,898 INFO L273 TraceCheckUtils]: 11: Hoare triple {3862#(<= 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; {3863#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:06,899 INFO L273 TraceCheckUtils]: 12: Hoare triple {3863#(<= 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; {3864#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:06,900 INFO L273 TraceCheckUtils]: 13: Hoare triple {3864#(<= main_~i~0 7)} assume !(~i~0 < 100000); {3856#false} is VALID [2018-11-23 12:03:06,900 INFO L273 TraceCheckUtils]: 14: Hoare triple {3856#false} ~i~0 := 0; {3856#false} is VALID [2018-11-23 12:03:06,900 INFO L273 TraceCheckUtils]: 15: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,900 INFO L273 TraceCheckUtils]: 16: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,901 INFO L273 TraceCheckUtils]: 17: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,901 INFO L273 TraceCheckUtils]: 18: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,901 INFO L273 TraceCheckUtils]: 19: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,901 INFO L273 TraceCheckUtils]: 20: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,902 INFO L273 TraceCheckUtils]: 21: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,902 INFO L273 TraceCheckUtils]: 22: Hoare triple {3856#false} assume !(~i~0 < 100000); {3856#false} is VALID [2018-11-23 12:03:06,902 INFO L273 TraceCheckUtils]: 23: Hoare triple {3856#false} ~i~0 := 0; {3856#false} is VALID [2018-11-23 12:03:06,902 INFO L273 TraceCheckUtils]: 24: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,902 INFO L273 TraceCheckUtils]: 25: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,903 INFO L273 TraceCheckUtils]: 26: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,903 INFO L273 TraceCheckUtils]: 27: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,903 INFO L273 TraceCheckUtils]: 28: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,903 INFO L273 TraceCheckUtils]: 29: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,903 INFO L273 TraceCheckUtils]: 30: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,904 INFO L273 TraceCheckUtils]: 31: Hoare triple {3856#false} assume !(~i~0 < 100000); {3856#false} is VALID [2018-11-23 12:03:06,904 INFO L273 TraceCheckUtils]: 32: Hoare triple {3856#false} ~i~0 := 0; {3856#false} is VALID [2018-11-23 12:03:06,904 INFO L273 TraceCheckUtils]: 33: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,904 INFO L273 TraceCheckUtils]: 34: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,905 INFO L273 TraceCheckUtils]: 35: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,905 INFO L273 TraceCheckUtils]: 36: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,905 INFO L273 TraceCheckUtils]: 37: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,905 INFO L273 TraceCheckUtils]: 38: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,905 INFO L273 TraceCheckUtils]: 39: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,905 INFO L273 TraceCheckUtils]: 40: Hoare triple {3856#false} assume !(~i~0 < 100000); {3856#false} is VALID [2018-11-23 12:03:06,905 INFO L273 TraceCheckUtils]: 41: Hoare triple {3856#false} ~i~0 := 0; {3856#false} is VALID [2018-11-23 12:03:06,905 INFO L273 TraceCheckUtils]: 42: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,906 INFO L273 TraceCheckUtils]: 43: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,906 INFO L273 TraceCheckUtils]: 44: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,906 INFO L273 TraceCheckUtils]: 45: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,906 INFO L273 TraceCheckUtils]: 46: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,906 INFO L273 TraceCheckUtils]: 47: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,906 INFO L273 TraceCheckUtils]: 48: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,906 INFO L273 TraceCheckUtils]: 49: Hoare triple {3856#false} assume !(~i~0 < 100000); {3856#false} is VALID [2018-11-23 12:03:06,906 INFO L273 TraceCheckUtils]: 50: Hoare triple {3856#false} ~i~0 := 0; {3856#false} is VALID [2018-11-23 12:03:06,907 INFO L273 TraceCheckUtils]: 51: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,907 INFO L273 TraceCheckUtils]: 52: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,907 INFO L273 TraceCheckUtils]: 53: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,907 INFO L273 TraceCheckUtils]: 54: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,907 INFO L273 TraceCheckUtils]: 55: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,907 INFO L273 TraceCheckUtils]: 56: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,907 INFO L273 TraceCheckUtils]: 57: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,907 INFO L273 TraceCheckUtils]: 58: Hoare triple {3856#false} assume !(~i~0 < 100000); {3856#false} is VALID [2018-11-23 12:03:06,908 INFO L273 TraceCheckUtils]: 59: Hoare triple {3856#false} ~i~0 := 0; {3856#false} is VALID [2018-11-23 12:03:06,908 INFO L273 TraceCheckUtils]: 60: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,908 INFO L273 TraceCheckUtils]: 61: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,908 INFO L273 TraceCheckUtils]: 62: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,908 INFO L273 TraceCheckUtils]: 63: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,908 INFO L273 TraceCheckUtils]: 64: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,909 INFO L273 TraceCheckUtils]: 65: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,909 INFO L273 TraceCheckUtils]: 66: Hoare triple {3856#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3856#false} is VALID [2018-11-23 12:03:06,909 INFO L273 TraceCheckUtils]: 67: Hoare triple {3856#false} assume !(~i~0 < 100000); {3856#false} is VALID [2018-11-23 12:03:06,909 INFO L273 TraceCheckUtils]: 68: Hoare triple {3856#false} havoc ~x~0;~x~0 := 0; {3856#false} is VALID [2018-11-23 12:03:06,909 INFO L273 TraceCheckUtils]: 69: Hoare triple {3856#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3856#false} is VALID [2018-11-23 12:03:06,910 INFO L256 TraceCheckUtils]: 70: Hoare triple {3856#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {3856#false} is VALID [2018-11-23 12:03:06,910 INFO L273 TraceCheckUtils]: 71: Hoare triple {3856#false} ~cond := #in~cond; {3856#false} is VALID [2018-11-23 12:03:06,910 INFO L273 TraceCheckUtils]: 72: Hoare triple {3856#false} assume 0 == ~cond; {3856#false} is VALID [2018-11-23 12:03:06,910 INFO L273 TraceCheckUtils]: 73: Hoare triple {3856#false} assume !false; {3856#false} is VALID [2018-11-23 12:03:06,914 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-11-23 12:03:06,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:06,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:03:06,942 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2018-11-23 12:03:06,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:06,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:03:07,042 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:07,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:03:07,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:03:07,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:03:07,044 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 11 states. [2018-11-23 12:03:07,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:07,654 INFO L93 Difference]: Finished difference Result 151 states and 171 transitions. [2018-11-23 12:03:07,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:03:07,654 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2018-11-23 12:03:07,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:07,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:03:07,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2018-11-23 12:03:07,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:03:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2018-11-23 12:03:07,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 129 transitions. [2018-11-23 12:03:07,842 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:07,844 INFO L225 Difference]: With dead ends: 151 [2018-11-23 12:03:07,844 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 12:03:07,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 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:03:07,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 12:03:07,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-23 12:03:07,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:07,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 86 states. [2018-11-23 12:03:07,938 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 86 states. [2018-11-23 12:03:07,938 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 86 states. [2018-11-23 12:03:07,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:07,940 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2018-11-23 12:03:07,940 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-11-23 12:03:07,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:07,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:07,941 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 86 states. [2018-11-23 12:03:07,941 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 86 states. [2018-11-23 12:03:07,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:07,944 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2018-11-23 12:03:07,944 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-11-23 12:03:07,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:07,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:07,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:07,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:07,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 12:03:07,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2018-11-23 12:03:07,950 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 74 [2018-11-23 12:03:07,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:07,950 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2018-11-23 12:03:07,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:03:07,950 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-11-23 12:03:07,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 12:03:07,951 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:07,951 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:07,951 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:07,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:07,951 INFO L82 PathProgramCache]: Analyzing trace with hash 494861386, now seen corresponding path program 8 times [2018-11-23 12:03:07,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:07,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:07,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:07,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:03:07,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:08,166 INFO L256 TraceCheckUtils]: 0: Hoare triple {4687#true} call ULTIMATE.init(); {4687#true} is VALID [2018-11-23 12:03:08,167 INFO L273 TraceCheckUtils]: 1: Hoare triple {4687#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4687#true} is VALID [2018-11-23 12:03:08,167 INFO L273 TraceCheckUtils]: 2: Hoare triple {4687#true} assume true; {4687#true} is VALID [2018-11-23 12:03:08,167 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4687#true} {4687#true} #126#return; {4687#true} is VALID [2018-11-23 12:03:08,168 INFO L256 TraceCheckUtils]: 4: Hoare triple {4687#true} call #t~ret2 := main(); {4687#true} is VALID [2018-11-23 12:03:08,168 INFO L273 TraceCheckUtils]: 5: Hoare triple {4687#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4689#(= main_~i~0 0)} is VALID [2018-11-23 12:03:08,169 INFO L273 TraceCheckUtils]: 6: Hoare triple {4689#(= 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; {4690#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:08,170 INFO L273 TraceCheckUtils]: 7: Hoare triple {4690#(<= 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; {4691#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:08,170 INFO L273 TraceCheckUtils]: 8: Hoare triple {4691#(<= 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; {4692#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:08,171 INFO L273 TraceCheckUtils]: 9: Hoare triple {4692#(<= 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; {4693#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:08,172 INFO L273 TraceCheckUtils]: 10: Hoare triple {4693#(<= 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; {4694#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:08,173 INFO L273 TraceCheckUtils]: 11: Hoare triple {4694#(<= 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; {4695#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:08,174 INFO L273 TraceCheckUtils]: 12: Hoare triple {4695#(<= 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; {4696#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:08,175 INFO L273 TraceCheckUtils]: 13: Hoare triple {4696#(<= 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; {4697#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:08,175 INFO L273 TraceCheckUtils]: 14: Hoare triple {4697#(<= main_~i~0 8)} assume !(~i~0 < 100000); {4688#false} is VALID [2018-11-23 12:03:08,176 INFO L273 TraceCheckUtils]: 15: Hoare triple {4688#false} ~i~0 := 0; {4688#false} is VALID [2018-11-23 12:03:08,176 INFO L273 TraceCheckUtils]: 16: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,176 INFO L273 TraceCheckUtils]: 17: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,176 INFO L273 TraceCheckUtils]: 18: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,176 INFO L273 TraceCheckUtils]: 19: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,177 INFO L273 TraceCheckUtils]: 20: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,177 INFO L273 TraceCheckUtils]: 21: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,177 INFO L273 TraceCheckUtils]: 22: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,177 INFO L273 TraceCheckUtils]: 23: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,178 INFO L273 TraceCheckUtils]: 24: Hoare triple {4688#false} assume !(~i~0 < 100000); {4688#false} is VALID [2018-11-23 12:03:08,178 INFO L273 TraceCheckUtils]: 25: Hoare triple {4688#false} ~i~0 := 0; {4688#false} is VALID [2018-11-23 12:03:08,178 INFO L273 TraceCheckUtils]: 26: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,179 INFO L273 TraceCheckUtils]: 27: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,179 INFO L273 TraceCheckUtils]: 28: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,179 INFO L273 TraceCheckUtils]: 29: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,179 INFO L273 TraceCheckUtils]: 30: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,179 INFO L273 TraceCheckUtils]: 31: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,180 INFO L273 TraceCheckUtils]: 32: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,180 INFO L273 TraceCheckUtils]: 33: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,180 INFO L273 TraceCheckUtils]: 34: Hoare triple {4688#false} assume !(~i~0 < 100000); {4688#false} is VALID [2018-11-23 12:03:08,180 INFO L273 TraceCheckUtils]: 35: Hoare triple {4688#false} ~i~0 := 0; {4688#false} is VALID [2018-11-23 12:03:08,180 INFO L273 TraceCheckUtils]: 36: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,180 INFO L273 TraceCheckUtils]: 37: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,181 INFO L273 TraceCheckUtils]: 38: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,181 INFO L273 TraceCheckUtils]: 39: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,181 INFO L273 TraceCheckUtils]: 40: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,181 INFO L273 TraceCheckUtils]: 41: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,181 INFO L273 TraceCheckUtils]: 42: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,181 INFO L273 TraceCheckUtils]: 43: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,181 INFO L273 TraceCheckUtils]: 44: Hoare triple {4688#false} assume !(~i~0 < 100000); {4688#false} is VALID [2018-11-23 12:03:08,182 INFO L273 TraceCheckUtils]: 45: Hoare triple {4688#false} ~i~0 := 0; {4688#false} is VALID [2018-11-23 12:03:08,182 INFO L273 TraceCheckUtils]: 46: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,182 INFO L273 TraceCheckUtils]: 47: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,182 INFO L273 TraceCheckUtils]: 48: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,182 INFO L273 TraceCheckUtils]: 49: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,183 INFO L273 TraceCheckUtils]: 50: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,183 INFO L273 TraceCheckUtils]: 51: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,183 INFO L273 TraceCheckUtils]: 52: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,183 INFO L273 TraceCheckUtils]: 53: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,183 INFO L273 TraceCheckUtils]: 54: Hoare triple {4688#false} assume !(~i~0 < 100000); {4688#false} is VALID [2018-11-23 12:03:08,183 INFO L273 TraceCheckUtils]: 55: Hoare triple {4688#false} ~i~0 := 0; {4688#false} is VALID [2018-11-23 12:03:08,183 INFO L273 TraceCheckUtils]: 56: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,183 INFO L273 TraceCheckUtils]: 57: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,184 INFO L273 TraceCheckUtils]: 58: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,184 INFO L273 TraceCheckUtils]: 59: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,184 INFO L273 TraceCheckUtils]: 60: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,184 INFO L273 TraceCheckUtils]: 61: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,184 INFO L273 TraceCheckUtils]: 62: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,184 INFO L273 TraceCheckUtils]: 63: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,184 INFO L273 TraceCheckUtils]: 64: Hoare triple {4688#false} assume !(~i~0 < 100000); {4688#false} is VALID [2018-11-23 12:03:08,184 INFO L273 TraceCheckUtils]: 65: Hoare triple {4688#false} ~i~0 := 0; {4688#false} is VALID [2018-11-23 12:03:08,184 INFO L273 TraceCheckUtils]: 66: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,185 INFO L273 TraceCheckUtils]: 67: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,185 INFO L273 TraceCheckUtils]: 68: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,185 INFO L273 TraceCheckUtils]: 69: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,185 INFO L273 TraceCheckUtils]: 70: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,185 INFO L273 TraceCheckUtils]: 71: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,185 INFO L273 TraceCheckUtils]: 72: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,185 INFO L273 TraceCheckUtils]: 73: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,185 INFO L273 TraceCheckUtils]: 74: Hoare triple {4688#false} assume !(~i~0 < 100000); {4688#false} is VALID [2018-11-23 12:03:08,186 INFO L273 TraceCheckUtils]: 75: Hoare triple {4688#false} havoc ~x~0;~x~0 := 0; {4688#false} is VALID [2018-11-23 12:03:08,186 INFO L273 TraceCheckUtils]: 76: Hoare triple {4688#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4688#false} is VALID [2018-11-23 12:03:08,186 INFO L256 TraceCheckUtils]: 77: Hoare triple {4688#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {4688#false} is VALID [2018-11-23 12:03:08,186 INFO L273 TraceCheckUtils]: 78: Hoare triple {4688#false} ~cond := #in~cond; {4688#false} is VALID [2018-11-23 12:03:08,186 INFO L273 TraceCheckUtils]: 79: Hoare triple {4688#false} assume 0 == ~cond; {4688#false} is VALID [2018-11-23 12:03:08,186 INFO L273 TraceCheckUtils]: 80: Hoare triple {4688#false} assume !false; {4688#false} is VALID [2018-11-23 12:03:08,190 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-11-23 12:03:08,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:08,190 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:03:08,205 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:03:08,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:03:08,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:08,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:08,454 INFO L256 TraceCheckUtils]: 0: Hoare triple {4687#true} call ULTIMATE.init(); {4687#true} is VALID [2018-11-23 12:03:08,454 INFO L273 TraceCheckUtils]: 1: Hoare triple {4687#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4687#true} is VALID [2018-11-23 12:03:08,454 INFO L273 TraceCheckUtils]: 2: Hoare triple {4687#true} assume true; {4687#true} is VALID [2018-11-23 12:03:08,455 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4687#true} {4687#true} #126#return; {4687#true} is VALID [2018-11-23 12:03:08,455 INFO L256 TraceCheckUtils]: 4: Hoare triple {4687#true} call #t~ret2 := main(); {4687#true} is VALID [2018-11-23 12:03:08,456 INFO L273 TraceCheckUtils]: 5: Hoare triple {4687#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4716#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:08,457 INFO L273 TraceCheckUtils]: 6: Hoare triple {4716#(<= 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; {4690#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:08,457 INFO L273 TraceCheckUtils]: 7: Hoare triple {4690#(<= 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; {4691#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:08,458 INFO L273 TraceCheckUtils]: 8: Hoare triple {4691#(<= 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; {4692#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:08,459 INFO L273 TraceCheckUtils]: 9: Hoare triple {4692#(<= 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; {4693#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:08,460 INFO L273 TraceCheckUtils]: 10: Hoare triple {4693#(<= 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; {4694#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:08,461 INFO L273 TraceCheckUtils]: 11: Hoare triple {4694#(<= 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; {4695#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:08,462 INFO L273 TraceCheckUtils]: 12: Hoare triple {4695#(<= 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; {4696#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:08,463 INFO L273 TraceCheckUtils]: 13: Hoare triple {4696#(<= 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; {4697#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:08,464 INFO L273 TraceCheckUtils]: 14: Hoare triple {4697#(<= main_~i~0 8)} assume !(~i~0 < 100000); {4688#false} is VALID [2018-11-23 12:03:08,464 INFO L273 TraceCheckUtils]: 15: Hoare triple {4688#false} ~i~0 := 0; {4688#false} is VALID [2018-11-23 12:03:08,464 INFO L273 TraceCheckUtils]: 16: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,465 INFO L273 TraceCheckUtils]: 17: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,465 INFO L273 TraceCheckUtils]: 18: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,465 INFO L273 TraceCheckUtils]: 19: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,465 INFO L273 TraceCheckUtils]: 20: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,466 INFO L273 TraceCheckUtils]: 21: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,466 INFO L273 TraceCheckUtils]: 22: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,466 INFO L273 TraceCheckUtils]: 23: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,466 INFO L273 TraceCheckUtils]: 24: Hoare triple {4688#false} assume !(~i~0 < 100000); {4688#false} is VALID [2018-11-23 12:03:08,467 INFO L273 TraceCheckUtils]: 25: Hoare triple {4688#false} ~i~0 := 0; {4688#false} is VALID [2018-11-23 12:03:08,467 INFO L273 TraceCheckUtils]: 26: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,467 INFO L273 TraceCheckUtils]: 27: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,467 INFO L273 TraceCheckUtils]: 28: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,468 INFO L273 TraceCheckUtils]: 29: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,468 INFO L273 TraceCheckUtils]: 30: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,468 INFO L273 TraceCheckUtils]: 31: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,468 INFO L273 TraceCheckUtils]: 32: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,468 INFO L273 TraceCheckUtils]: 33: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,468 INFO L273 TraceCheckUtils]: 34: Hoare triple {4688#false} assume !(~i~0 < 100000); {4688#false} is VALID [2018-11-23 12:03:08,468 INFO L273 TraceCheckUtils]: 35: Hoare triple {4688#false} ~i~0 := 0; {4688#false} is VALID [2018-11-23 12:03:08,469 INFO L273 TraceCheckUtils]: 36: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,469 INFO L273 TraceCheckUtils]: 37: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,469 INFO L273 TraceCheckUtils]: 38: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,469 INFO L273 TraceCheckUtils]: 39: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,469 INFO L273 TraceCheckUtils]: 40: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,469 INFO L273 TraceCheckUtils]: 41: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,470 INFO L273 TraceCheckUtils]: 42: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,470 INFO L273 TraceCheckUtils]: 43: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,470 INFO L273 TraceCheckUtils]: 44: Hoare triple {4688#false} assume !(~i~0 < 100000); {4688#false} is VALID [2018-11-23 12:03:08,470 INFO L273 TraceCheckUtils]: 45: Hoare triple {4688#false} ~i~0 := 0; {4688#false} is VALID [2018-11-23 12:03:08,470 INFO L273 TraceCheckUtils]: 46: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,470 INFO L273 TraceCheckUtils]: 47: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,470 INFO L273 TraceCheckUtils]: 48: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,471 INFO L273 TraceCheckUtils]: 49: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,471 INFO L273 TraceCheckUtils]: 50: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,471 INFO L273 TraceCheckUtils]: 51: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,471 INFO L273 TraceCheckUtils]: 52: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,471 INFO L273 TraceCheckUtils]: 53: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,471 INFO L273 TraceCheckUtils]: 54: Hoare triple {4688#false} assume !(~i~0 < 100000); {4688#false} is VALID [2018-11-23 12:03:08,471 INFO L273 TraceCheckUtils]: 55: Hoare triple {4688#false} ~i~0 := 0; {4688#false} is VALID [2018-11-23 12:03:08,472 INFO L273 TraceCheckUtils]: 56: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,472 INFO L273 TraceCheckUtils]: 57: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,472 INFO L273 TraceCheckUtils]: 58: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,472 INFO L273 TraceCheckUtils]: 59: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,472 INFO L273 TraceCheckUtils]: 60: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,472 INFO L273 TraceCheckUtils]: 61: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,473 INFO L273 TraceCheckUtils]: 62: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,473 INFO L273 TraceCheckUtils]: 63: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,473 INFO L273 TraceCheckUtils]: 64: Hoare triple {4688#false} assume !(~i~0 < 100000); {4688#false} is VALID [2018-11-23 12:03:08,473 INFO L273 TraceCheckUtils]: 65: Hoare triple {4688#false} ~i~0 := 0; {4688#false} is VALID [2018-11-23 12:03:08,474 INFO L273 TraceCheckUtils]: 66: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,474 INFO L273 TraceCheckUtils]: 67: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,474 INFO L273 TraceCheckUtils]: 68: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,474 INFO L273 TraceCheckUtils]: 69: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,474 INFO L273 TraceCheckUtils]: 70: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,475 INFO L273 TraceCheckUtils]: 71: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,475 INFO L273 TraceCheckUtils]: 72: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,475 INFO L273 TraceCheckUtils]: 73: Hoare triple {4688#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4688#false} is VALID [2018-11-23 12:03:08,475 INFO L273 TraceCheckUtils]: 74: Hoare triple {4688#false} assume !(~i~0 < 100000); {4688#false} is VALID [2018-11-23 12:03:08,475 INFO L273 TraceCheckUtils]: 75: Hoare triple {4688#false} havoc ~x~0;~x~0 := 0; {4688#false} is VALID [2018-11-23 12:03:08,476 INFO L273 TraceCheckUtils]: 76: Hoare triple {4688#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4688#false} is VALID [2018-11-23 12:03:08,476 INFO L256 TraceCheckUtils]: 77: Hoare triple {4688#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {4688#false} is VALID [2018-11-23 12:03:08,476 INFO L273 TraceCheckUtils]: 78: Hoare triple {4688#false} ~cond := #in~cond; {4688#false} is VALID [2018-11-23 12:03:08,476 INFO L273 TraceCheckUtils]: 79: Hoare triple {4688#false} assume 0 == ~cond; {4688#false} is VALID [2018-11-23 12:03:08,476 INFO L273 TraceCheckUtils]: 80: Hoare triple {4688#false} assume !false; {4688#false} is VALID [2018-11-23 12:03:08,484 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-11-23 12:03:08,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:08,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:03:08,506 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2018-11-23 12:03:08,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:08,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:03:08,570 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:08,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:03:08,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:03:08,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:03:08,571 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand 12 states. [2018-11-23 12:03:09,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:09,396 INFO L93 Difference]: Finished difference Result 164 states and 184 transitions. [2018-11-23 12:03:09,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:03:09,396 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2018-11-23 12:03:09,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:09,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:03:09,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2018-11-23 12:03:09,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:03:09,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2018-11-23 12:03:09,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 136 transitions. [2018-11-23 12:03:09,597 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:09,600 INFO L225 Difference]: With dead ends: 164 [2018-11-23 12:03:09,600 INFO L226 Difference]: Without dead ends: 93 [2018-11-23 12:03:09,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:03:09,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-23 12:03:10,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-11-23 12:03:10,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:10,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 93 states. [2018-11-23 12:03:10,209 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 93 states. [2018-11-23 12:03:10,209 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 93 states. [2018-11-23 12:03:10,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:10,212 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2018-11-23 12:03:10,212 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2018-11-23 12:03:10,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:10,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:10,212 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 93 states. [2018-11-23 12:03:10,213 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 93 states. [2018-11-23 12:03:10,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:10,214 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2018-11-23 12:03:10,214 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2018-11-23 12:03:10,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:10,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:10,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:10,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:10,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 12:03:10,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2018-11-23 12:03:10,216 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 81 [2018-11-23 12:03:10,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:10,217 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2018-11-23 12:03:10,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:03:10,217 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2018-11-23 12:03:10,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-23 12:03:10,218 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:10,218 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:10,218 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:10,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:10,218 INFO L82 PathProgramCache]: Analyzing trace with hash -938874969, now seen corresponding path program 9 times [2018-11-23 12:03:10,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:10,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:10,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:10,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:10,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:10,823 INFO L256 TraceCheckUtils]: 0: Hoare triple {5595#true} call ULTIMATE.init(); {5595#true} is VALID [2018-11-23 12:03:10,823 INFO L273 TraceCheckUtils]: 1: Hoare triple {5595#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5595#true} is VALID [2018-11-23 12:03:10,823 INFO L273 TraceCheckUtils]: 2: Hoare triple {5595#true} assume true; {5595#true} is VALID [2018-11-23 12:03:10,823 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5595#true} {5595#true} #126#return; {5595#true} is VALID [2018-11-23 12:03:10,824 INFO L256 TraceCheckUtils]: 4: Hoare triple {5595#true} call #t~ret2 := main(); {5595#true} is VALID [2018-11-23 12:03:10,824 INFO L273 TraceCheckUtils]: 5: Hoare triple {5595#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5597#(= main_~i~0 0)} is VALID [2018-11-23 12:03:10,825 INFO L273 TraceCheckUtils]: 6: Hoare triple {5597#(= 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; {5598#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:10,826 INFO L273 TraceCheckUtils]: 7: Hoare triple {5598#(<= 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; {5599#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:10,826 INFO L273 TraceCheckUtils]: 8: Hoare triple {5599#(<= 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; {5600#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:10,827 INFO L273 TraceCheckUtils]: 9: Hoare triple {5600#(<= 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; {5601#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:10,827 INFO L273 TraceCheckUtils]: 10: Hoare triple {5601#(<= 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; {5602#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:10,828 INFO L273 TraceCheckUtils]: 11: Hoare triple {5602#(<= 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; {5603#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:10,829 INFO L273 TraceCheckUtils]: 12: Hoare triple {5603#(<= 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; {5604#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:10,830 INFO L273 TraceCheckUtils]: 13: Hoare triple {5604#(<= 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; {5605#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:10,831 INFO L273 TraceCheckUtils]: 14: Hoare triple {5605#(<= 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; {5606#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:10,832 INFO L273 TraceCheckUtils]: 15: Hoare triple {5606#(<= main_~i~0 9)} assume !(~i~0 < 100000); {5596#false} is VALID [2018-11-23 12:03:10,832 INFO L273 TraceCheckUtils]: 16: Hoare triple {5596#false} ~i~0 := 0; {5596#false} is VALID [2018-11-23 12:03:10,832 INFO L273 TraceCheckUtils]: 17: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,832 INFO L273 TraceCheckUtils]: 18: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,832 INFO L273 TraceCheckUtils]: 19: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,833 INFO L273 TraceCheckUtils]: 20: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,833 INFO L273 TraceCheckUtils]: 21: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,833 INFO L273 TraceCheckUtils]: 22: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,833 INFO L273 TraceCheckUtils]: 23: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,833 INFO L273 TraceCheckUtils]: 24: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,834 INFO L273 TraceCheckUtils]: 25: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,834 INFO L273 TraceCheckUtils]: 26: Hoare triple {5596#false} assume !(~i~0 < 100000); {5596#false} is VALID [2018-11-23 12:03:10,834 INFO L273 TraceCheckUtils]: 27: Hoare triple {5596#false} ~i~0 := 0; {5596#false} is VALID [2018-11-23 12:03:10,834 INFO L273 TraceCheckUtils]: 28: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,834 INFO L273 TraceCheckUtils]: 29: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,834 INFO L273 TraceCheckUtils]: 30: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,835 INFO L273 TraceCheckUtils]: 31: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,835 INFO L273 TraceCheckUtils]: 32: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,835 INFO L273 TraceCheckUtils]: 33: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,835 INFO L273 TraceCheckUtils]: 34: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,835 INFO L273 TraceCheckUtils]: 35: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,835 INFO L273 TraceCheckUtils]: 36: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,836 INFO L273 TraceCheckUtils]: 37: Hoare triple {5596#false} assume !(~i~0 < 100000); {5596#false} is VALID [2018-11-23 12:03:10,836 INFO L273 TraceCheckUtils]: 38: Hoare triple {5596#false} ~i~0 := 0; {5596#false} is VALID [2018-11-23 12:03:10,836 INFO L273 TraceCheckUtils]: 39: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,836 INFO L273 TraceCheckUtils]: 40: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,836 INFO L273 TraceCheckUtils]: 41: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,836 INFO L273 TraceCheckUtils]: 42: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,836 INFO L273 TraceCheckUtils]: 43: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,836 INFO L273 TraceCheckUtils]: 44: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,836 INFO L273 TraceCheckUtils]: 45: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,837 INFO L273 TraceCheckUtils]: 46: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,837 INFO L273 TraceCheckUtils]: 47: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,837 INFO L273 TraceCheckUtils]: 48: Hoare triple {5596#false} assume !(~i~0 < 100000); {5596#false} is VALID [2018-11-23 12:03:10,837 INFO L273 TraceCheckUtils]: 49: Hoare triple {5596#false} ~i~0 := 0; {5596#false} is VALID [2018-11-23 12:03:10,837 INFO L273 TraceCheckUtils]: 50: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,837 INFO L273 TraceCheckUtils]: 51: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,837 INFO L273 TraceCheckUtils]: 52: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,837 INFO L273 TraceCheckUtils]: 53: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,838 INFO L273 TraceCheckUtils]: 54: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,838 INFO L273 TraceCheckUtils]: 55: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,838 INFO L273 TraceCheckUtils]: 56: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,838 INFO L273 TraceCheckUtils]: 57: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,838 INFO L273 TraceCheckUtils]: 58: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,838 INFO L273 TraceCheckUtils]: 59: Hoare triple {5596#false} assume !(~i~0 < 100000); {5596#false} is VALID [2018-11-23 12:03:10,838 INFO L273 TraceCheckUtils]: 60: Hoare triple {5596#false} ~i~0 := 0; {5596#false} is VALID [2018-11-23 12:03:10,838 INFO L273 TraceCheckUtils]: 61: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,838 INFO L273 TraceCheckUtils]: 62: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,839 INFO L273 TraceCheckUtils]: 63: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,839 INFO L273 TraceCheckUtils]: 64: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,839 INFO L273 TraceCheckUtils]: 65: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,839 INFO L273 TraceCheckUtils]: 66: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,839 INFO L273 TraceCheckUtils]: 67: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,839 INFO L273 TraceCheckUtils]: 68: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,839 INFO L273 TraceCheckUtils]: 69: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,839 INFO L273 TraceCheckUtils]: 70: Hoare triple {5596#false} assume !(~i~0 < 100000); {5596#false} is VALID [2018-11-23 12:03:10,840 INFO L273 TraceCheckUtils]: 71: Hoare triple {5596#false} ~i~0 := 0; {5596#false} is VALID [2018-11-23 12:03:10,840 INFO L273 TraceCheckUtils]: 72: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,840 INFO L273 TraceCheckUtils]: 73: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,840 INFO L273 TraceCheckUtils]: 74: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,840 INFO L273 TraceCheckUtils]: 75: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,840 INFO L273 TraceCheckUtils]: 76: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,840 INFO L273 TraceCheckUtils]: 77: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,840 INFO L273 TraceCheckUtils]: 78: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,841 INFO L273 TraceCheckUtils]: 79: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,841 INFO L273 TraceCheckUtils]: 80: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:10,841 INFO L273 TraceCheckUtils]: 81: Hoare triple {5596#false} assume !(~i~0 < 100000); {5596#false} is VALID [2018-11-23 12:03:10,841 INFO L273 TraceCheckUtils]: 82: Hoare triple {5596#false} havoc ~x~0;~x~0 := 0; {5596#false} is VALID [2018-11-23 12:03:10,841 INFO L273 TraceCheckUtils]: 83: Hoare triple {5596#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5596#false} is VALID [2018-11-23 12:03:10,841 INFO L256 TraceCheckUtils]: 84: Hoare triple {5596#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {5596#false} is VALID [2018-11-23 12:03:10,841 INFO L273 TraceCheckUtils]: 85: Hoare triple {5596#false} ~cond := #in~cond; {5596#false} is VALID [2018-11-23 12:03:10,841 INFO L273 TraceCheckUtils]: 86: Hoare triple {5596#false} assume 0 == ~cond; {5596#false} is VALID [2018-11-23 12:03:10,841 INFO L273 TraceCheckUtils]: 87: Hoare triple {5596#false} assume !false; {5596#false} is VALID [2018-11-23 12:03:10,845 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-11-23 12:03:10,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:10,845 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:03:10,854 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:03:29,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:03:29,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:29,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:29,494 INFO L256 TraceCheckUtils]: 0: Hoare triple {5595#true} call ULTIMATE.init(); {5595#true} is VALID [2018-11-23 12:03:29,494 INFO L273 TraceCheckUtils]: 1: Hoare triple {5595#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5595#true} is VALID [2018-11-23 12:03:29,494 INFO L273 TraceCheckUtils]: 2: Hoare triple {5595#true} assume true; {5595#true} is VALID [2018-11-23 12:03:29,494 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5595#true} {5595#true} #126#return; {5595#true} is VALID [2018-11-23 12:03:29,495 INFO L256 TraceCheckUtils]: 4: Hoare triple {5595#true} call #t~ret2 := main(); {5595#true} is VALID [2018-11-23 12:03:29,495 INFO L273 TraceCheckUtils]: 5: Hoare triple {5595#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5595#true} is VALID [2018-11-23 12:03:29,495 INFO L273 TraceCheckUtils]: 6: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 12:03:29,495 INFO L273 TraceCheckUtils]: 7: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 12:03:29,495 INFO L273 TraceCheckUtils]: 8: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 12:03:29,496 INFO L273 TraceCheckUtils]: 9: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 12:03:29,496 INFO L273 TraceCheckUtils]: 10: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 12:03:29,496 INFO L273 TraceCheckUtils]: 11: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 12:03:29,496 INFO L273 TraceCheckUtils]: 12: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 12:03:29,496 INFO L273 TraceCheckUtils]: 13: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 12:03:29,496 INFO L273 TraceCheckUtils]: 14: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 12:03:29,496 INFO L273 TraceCheckUtils]: 15: Hoare triple {5595#true} assume !(~i~0 < 100000); {5595#true} is VALID [2018-11-23 12:03:29,496 INFO L273 TraceCheckUtils]: 16: Hoare triple {5595#true} ~i~0 := 0; {5595#true} is VALID [2018-11-23 12:03:29,496 INFO L273 TraceCheckUtils]: 17: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 12:03:29,497 INFO L273 TraceCheckUtils]: 18: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 12:03:29,497 INFO L273 TraceCheckUtils]: 19: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 12:03:29,497 INFO L273 TraceCheckUtils]: 20: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 12:03:29,497 INFO L273 TraceCheckUtils]: 21: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 12:03:29,497 INFO L273 TraceCheckUtils]: 22: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 12:03:29,497 INFO L273 TraceCheckUtils]: 23: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 12:03:29,497 INFO L273 TraceCheckUtils]: 24: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 12:03:29,497 INFO L273 TraceCheckUtils]: 25: Hoare triple {5595#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5595#true} is VALID [2018-11-23 12:03:29,498 INFO L273 TraceCheckUtils]: 26: Hoare triple {5595#true} assume !(~i~0 < 100000); {5595#true} is VALID [2018-11-23 12:03:29,498 INFO L273 TraceCheckUtils]: 27: Hoare triple {5595#true} ~i~0 := 0; {5691#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:29,499 INFO L273 TraceCheckUtils]: 28: Hoare triple {5691#(<= 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; {5598#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:29,499 INFO L273 TraceCheckUtils]: 29: Hoare triple {5598#(<= 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; {5599#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:29,500 INFO L273 TraceCheckUtils]: 30: Hoare triple {5599#(<= 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; {5600#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:29,500 INFO L273 TraceCheckUtils]: 31: Hoare triple {5600#(<= 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; {5601#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:29,501 INFO L273 TraceCheckUtils]: 32: Hoare triple {5601#(<= 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; {5602#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:29,502 INFO L273 TraceCheckUtils]: 33: Hoare triple {5602#(<= 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; {5603#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:29,503 INFO L273 TraceCheckUtils]: 34: Hoare triple {5603#(<= 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; {5604#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:29,504 INFO L273 TraceCheckUtils]: 35: Hoare triple {5604#(<= 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; {5605#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:29,504 INFO L273 TraceCheckUtils]: 36: Hoare triple {5605#(<= 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; {5606#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:29,505 INFO L273 TraceCheckUtils]: 37: Hoare triple {5606#(<= main_~i~0 9)} assume !(~i~0 < 100000); {5596#false} is VALID [2018-11-23 12:03:29,505 INFO L273 TraceCheckUtils]: 38: Hoare triple {5596#false} ~i~0 := 0; {5596#false} is VALID [2018-11-23 12:03:29,506 INFO L273 TraceCheckUtils]: 39: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,506 INFO L273 TraceCheckUtils]: 40: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,506 INFO L273 TraceCheckUtils]: 41: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,506 INFO L273 TraceCheckUtils]: 42: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,506 INFO L273 TraceCheckUtils]: 43: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,507 INFO L273 TraceCheckUtils]: 44: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,507 INFO L273 TraceCheckUtils]: 45: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,507 INFO L273 TraceCheckUtils]: 46: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,507 INFO L273 TraceCheckUtils]: 47: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,507 INFO L273 TraceCheckUtils]: 48: Hoare triple {5596#false} assume !(~i~0 < 100000); {5596#false} is VALID [2018-11-23 12:03:29,508 INFO L273 TraceCheckUtils]: 49: Hoare triple {5596#false} ~i~0 := 0; {5596#false} is VALID [2018-11-23 12:03:29,508 INFO L273 TraceCheckUtils]: 50: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,508 INFO L273 TraceCheckUtils]: 51: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,508 INFO L273 TraceCheckUtils]: 52: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,508 INFO L273 TraceCheckUtils]: 53: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,508 INFO L273 TraceCheckUtils]: 54: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,508 INFO L273 TraceCheckUtils]: 55: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,508 INFO L273 TraceCheckUtils]: 56: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,508 INFO L273 TraceCheckUtils]: 57: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,509 INFO L273 TraceCheckUtils]: 58: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,509 INFO L273 TraceCheckUtils]: 59: Hoare triple {5596#false} assume !(~i~0 < 100000); {5596#false} is VALID [2018-11-23 12:03:29,509 INFO L273 TraceCheckUtils]: 60: Hoare triple {5596#false} ~i~0 := 0; {5596#false} is VALID [2018-11-23 12:03:29,509 INFO L273 TraceCheckUtils]: 61: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,509 INFO L273 TraceCheckUtils]: 62: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,509 INFO L273 TraceCheckUtils]: 63: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,509 INFO L273 TraceCheckUtils]: 64: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,509 INFO L273 TraceCheckUtils]: 65: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,510 INFO L273 TraceCheckUtils]: 66: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,510 INFO L273 TraceCheckUtils]: 67: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,510 INFO L273 TraceCheckUtils]: 68: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,510 INFO L273 TraceCheckUtils]: 69: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,510 INFO L273 TraceCheckUtils]: 70: Hoare triple {5596#false} assume !(~i~0 < 100000); {5596#false} is VALID [2018-11-23 12:03:29,510 INFO L273 TraceCheckUtils]: 71: Hoare triple {5596#false} ~i~0 := 0; {5596#false} is VALID [2018-11-23 12:03:29,510 INFO L273 TraceCheckUtils]: 72: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,510 INFO L273 TraceCheckUtils]: 73: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,510 INFO L273 TraceCheckUtils]: 74: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,511 INFO L273 TraceCheckUtils]: 75: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,511 INFO L273 TraceCheckUtils]: 76: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,511 INFO L273 TraceCheckUtils]: 77: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,511 INFO L273 TraceCheckUtils]: 78: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,511 INFO L273 TraceCheckUtils]: 79: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,511 INFO L273 TraceCheckUtils]: 80: Hoare triple {5596#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5596#false} is VALID [2018-11-23 12:03:29,511 INFO L273 TraceCheckUtils]: 81: Hoare triple {5596#false} assume !(~i~0 < 100000); {5596#false} is VALID [2018-11-23 12:03:29,511 INFO L273 TraceCheckUtils]: 82: Hoare triple {5596#false} havoc ~x~0;~x~0 := 0; {5596#false} is VALID [2018-11-23 12:03:29,512 INFO L273 TraceCheckUtils]: 83: Hoare triple {5596#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5596#false} is VALID [2018-11-23 12:03:29,512 INFO L256 TraceCheckUtils]: 84: Hoare triple {5596#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {5596#false} is VALID [2018-11-23 12:03:29,512 INFO L273 TraceCheckUtils]: 85: Hoare triple {5596#false} ~cond := #in~cond; {5596#false} is VALID [2018-11-23 12:03:29,512 INFO L273 TraceCheckUtils]: 86: Hoare triple {5596#false} assume 0 == ~cond; {5596#false} is VALID [2018-11-23 12:03:29,512 INFO L273 TraceCheckUtils]: 87: Hoare triple {5596#false} assume !false; {5596#false} is VALID [2018-11-23 12:03:29,515 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-11-23 12:03:29,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:29,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 12:03:29,543 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 88 [2018-11-23 12:03:29,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:29,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:03:29,597 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:29,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:03:29,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:03:29,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:03:29,599 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 13 states. [2018-11-23 12:03:30,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:30,561 INFO L93 Difference]: Finished difference Result 177 states and 197 transitions. [2018-11-23 12:03:30,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:03:30,561 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 88 [2018-11-23 12:03:30,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:30,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:03:30,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2018-11-23 12:03:30,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:03:30,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2018-11-23 12:03:30,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 143 transitions. [2018-11-23 12:03:30,714 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:30,717 INFO L225 Difference]: With dead ends: 177 [2018-11-23 12:03:30,717 INFO L226 Difference]: Without dead ends: 100 [2018-11-23 12:03:30,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:03:30,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-23 12:03:31,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-11-23 12:03:31,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:31,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand 100 states. [2018-11-23 12:03:31,349 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 100 states. [2018-11-23 12:03:31,349 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 100 states. [2018-11-23 12:03:31,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:31,352 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2018-11-23 12:03:31,352 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2018-11-23 12:03:31,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:31,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:31,353 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 100 states. [2018-11-23 12:03:31,353 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 100 states. [2018-11-23 12:03:31,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:31,355 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2018-11-23 12:03:31,356 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2018-11-23 12:03:31,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:31,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:31,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:31,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:31,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-23 12:03:31,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2018-11-23 12:03:31,359 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 88 [2018-11-23 12:03:31,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:31,359 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2018-11-23 12:03:31,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:03:31,359 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2018-11-23 12:03:31,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 12:03:31,360 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:31,360 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:31,361 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:31,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:31,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1207453270, now seen corresponding path program 10 times [2018-11-23 12:03:31,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:31,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:31,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:31,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:31,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:31,629 INFO L256 TraceCheckUtils]: 0: Hoare triple {6579#true} call ULTIMATE.init(); {6579#true} is VALID [2018-11-23 12:03:31,630 INFO L273 TraceCheckUtils]: 1: Hoare triple {6579#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6579#true} is VALID [2018-11-23 12:03:31,630 INFO L273 TraceCheckUtils]: 2: Hoare triple {6579#true} assume true; {6579#true} is VALID [2018-11-23 12:03:31,630 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6579#true} {6579#true} #126#return; {6579#true} is VALID [2018-11-23 12:03:31,630 INFO L256 TraceCheckUtils]: 4: Hoare triple {6579#true} call #t~ret2 := main(); {6579#true} is VALID [2018-11-23 12:03:31,631 INFO L273 TraceCheckUtils]: 5: Hoare triple {6579#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6581#(= main_~i~0 0)} is VALID [2018-11-23 12:03:31,632 INFO L273 TraceCheckUtils]: 6: Hoare triple {6581#(= 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; {6582#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:31,632 INFO L273 TraceCheckUtils]: 7: Hoare triple {6582#(<= 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; {6583#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:31,633 INFO L273 TraceCheckUtils]: 8: Hoare triple {6583#(<= 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; {6584#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:31,634 INFO L273 TraceCheckUtils]: 9: Hoare triple {6584#(<= 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; {6585#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:31,635 INFO L273 TraceCheckUtils]: 10: Hoare triple {6585#(<= 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; {6586#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:31,636 INFO L273 TraceCheckUtils]: 11: Hoare triple {6586#(<= 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; {6587#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:31,637 INFO L273 TraceCheckUtils]: 12: Hoare triple {6587#(<= 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; {6588#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:31,638 INFO L273 TraceCheckUtils]: 13: Hoare triple {6588#(<= 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; {6589#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:31,639 INFO L273 TraceCheckUtils]: 14: Hoare triple {6589#(<= 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; {6590#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:31,640 INFO L273 TraceCheckUtils]: 15: Hoare triple {6590#(<= 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; {6591#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:31,641 INFO L273 TraceCheckUtils]: 16: Hoare triple {6591#(<= main_~i~0 10)} assume !(~i~0 < 100000); {6580#false} is VALID [2018-11-23 12:03:31,641 INFO L273 TraceCheckUtils]: 17: Hoare triple {6580#false} ~i~0 := 0; {6580#false} is VALID [2018-11-23 12:03:31,641 INFO L273 TraceCheckUtils]: 18: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,642 INFO L273 TraceCheckUtils]: 19: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,642 INFO L273 TraceCheckUtils]: 20: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,642 INFO L273 TraceCheckUtils]: 21: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,642 INFO L273 TraceCheckUtils]: 22: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,642 INFO L273 TraceCheckUtils]: 23: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,643 INFO L273 TraceCheckUtils]: 24: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,643 INFO L273 TraceCheckUtils]: 25: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,643 INFO L273 TraceCheckUtils]: 26: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,643 INFO L273 TraceCheckUtils]: 27: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,643 INFO L273 TraceCheckUtils]: 28: Hoare triple {6580#false} assume !(~i~0 < 100000); {6580#false} is VALID [2018-11-23 12:03:31,644 INFO L273 TraceCheckUtils]: 29: Hoare triple {6580#false} ~i~0 := 0; {6580#false} is VALID [2018-11-23 12:03:31,644 INFO L273 TraceCheckUtils]: 30: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,644 INFO L273 TraceCheckUtils]: 31: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,644 INFO L273 TraceCheckUtils]: 32: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,644 INFO L273 TraceCheckUtils]: 33: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,645 INFO L273 TraceCheckUtils]: 34: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,645 INFO L273 TraceCheckUtils]: 35: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,645 INFO L273 TraceCheckUtils]: 36: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,645 INFO L273 TraceCheckUtils]: 37: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,645 INFO L273 TraceCheckUtils]: 38: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,646 INFO L273 TraceCheckUtils]: 39: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,646 INFO L273 TraceCheckUtils]: 40: Hoare triple {6580#false} assume !(~i~0 < 100000); {6580#false} is VALID [2018-11-23 12:03:31,646 INFO L273 TraceCheckUtils]: 41: Hoare triple {6580#false} ~i~0 := 0; {6580#false} is VALID [2018-11-23 12:03:31,646 INFO L273 TraceCheckUtils]: 42: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,646 INFO L273 TraceCheckUtils]: 43: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,647 INFO L273 TraceCheckUtils]: 44: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,647 INFO L273 TraceCheckUtils]: 45: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,647 INFO L273 TraceCheckUtils]: 46: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,647 INFO L273 TraceCheckUtils]: 47: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,647 INFO L273 TraceCheckUtils]: 48: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,647 INFO L273 TraceCheckUtils]: 49: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,647 INFO L273 TraceCheckUtils]: 50: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,647 INFO L273 TraceCheckUtils]: 51: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,647 INFO L273 TraceCheckUtils]: 52: Hoare triple {6580#false} assume !(~i~0 < 100000); {6580#false} is VALID [2018-11-23 12:03:31,648 INFO L273 TraceCheckUtils]: 53: Hoare triple {6580#false} ~i~0 := 0; {6580#false} is VALID [2018-11-23 12:03:31,648 INFO L273 TraceCheckUtils]: 54: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,648 INFO L273 TraceCheckUtils]: 55: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,648 INFO L273 TraceCheckUtils]: 56: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,648 INFO L273 TraceCheckUtils]: 57: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,648 INFO L273 TraceCheckUtils]: 58: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,648 INFO L273 TraceCheckUtils]: 59: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,648 INFO L273 TraceCheckUtils]: 60: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,649 INFO L273 TraceCheckUtils]: 61: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,649 INFO L273 TraceCheckUtils]: 62: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,649 INFO L273 TraceCheckUtils]: 63: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,649 INFO L273 TraceCheckUtils]: 64: Hoare triple {6580#false} assume !(~i~0 < 100000); {6580#false} is VALID [2018-11-23 12:03:31,649 INFO L273 TraceCheckUtils]: 65: Hoare triple {6580#false} ~i~0 := 0; {6580#false} is VALID [2018-11-23 12:03:31,649 INFO L273 TraceCheckUtils]: 66: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,649 INFO L273 TraceCheckUtils]: 67: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,649 INFO L273 TraceCheckUtils]: 68: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,650 INFO L273 TraceCheckUtils]: 69: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,650 INFO L273 TraceCheckUtils]: 70: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,650 INFO L273 TraceCheckUtils]: 71: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,650 INFO L273 TraceCheckUtils]: 72: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,650 INFO L273 TraceCheckUtils]: 73: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,650 INFO L273 TraceCheckUtils]: 74: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,650 INFO L273 TraceCheckUtils]: 75: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,650 INFO L273 TraceCheckUtils]: 76: Hoare triple {6580#false} assume !(~i~0 < 100000); {6580#false} is VALID [2018-11-23 12:03:31,651 INFO L273 TraceCheckUtils]: 77: Hoare triple {6580#false} ~i~0 := 0; {6580#false} is VALID [2018-11-23 12:03:31,651 INFO L273 TraceCheckUtils]: 78: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,651 INFO L273 TraceCheckUtils]: 79: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,651 INFO L273 TraceCheckUtils]: 80: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,651 INFO L273 TraceCheckUtils]: 81: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,651 INFO L273 TraceCheckUtils]: 82: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,652 INFO L273 TraceCheckUtils]: 83: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,652 INFO L273 TraceCheckUtils]: 84: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,652 INFO L273 TraceCheckUtils]: 85: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,652 INFO L273 TraceCheckUtils]: 86: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,652 INFO L273 TraceCheckUtils]: 87: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:31,652 INFO L273 TraceCheckUtils]: 88: Hoare triple {6580#false} assume !(~i~0 < 100000); {6580#false} is VALID [2018-11-23 12:03:31,653 INFO L273 TraceCheckUtils]: 89: Hoare triple {6580#false} havoc ~x~0;~x~0 := 0; {6580#false} is VALID [2018-11-23 12:03:31,653 INFO L273 TraceCheckUtils]: 90: Hoare triple {6580#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6580#false} is VALID [2018-11-23 12:03:31,653 INFO L256 TraceCheckUtils]: 91: Hoare triple {6580#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {6580#false} is VALID [2018-11-23 12:03:31,653 INFO L273 TraceCheckUtils]: 92: Hoare triple {6580#false} ~cond := #in~cond; {6580#false} is VALID [2018-11-23 12:03:31,653 INFO L273 TraceCheckUtils]: 93: Hoare triple {6580#false} assume 0 == ~cond; {6580#false} is VALID [2018-11-23 12:03:31,653 INFO L273 TraceCheckUtils]: 94: Hoare triple {6580#false} assume !false; {6580#false} is VALID [2018-11-23 12:03:31,658 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-11-23 12:03:31,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:31,658 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:31,668 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:03:31,723 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:03:31,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:31,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:32,068 INFO L256 TraceCheckUtils]: 0: Hoare triple {6579#true} call ULTIMATE.init(); {6579#true} is VALID [2018-11-23 12:03:32,068 INFO L273 TraceCheckUtils]: 1: Hoare triple {6579#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6579#true} is VALID [2018-11-23 12:03:32,068 INFO L273 TraceCheckUtils]: 2: Hoare triple {6579#true} assume true; {6579#true} is VALID [2018-11-23 12:03:32,069 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6579#true} {6579#true} #126#return; {6579#true} is VALID [2018-11-23 12:03:32,069 INFO L256 TraceCheckUtils]: 4: Hoare triple {6579#true} call #t~ret2 := main(); {6579#true} is VALID [2018-11-23 12:03:32,069 INFO L273 TraceCheckUtils]: 5: Hoare triple {6579#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6610#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:32,070 INFO L273 TraceCheckUtils]: 6: Hoare triple {6610#(<= 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; {6582#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:32,071 INFO L273 TraceCheckUtils]: 7: Hoare triple {6582#(<= 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; {6583#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:32,071 INFO L273 TraceCheckUtils]: 8: Hoare triple {6583#(<= 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; {6584#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:32,072 INFO L273 TraceCheckUtils]: 9: Hoare triple {6584#(<= 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; {6585#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:32,073 INFO L273 TraceCheckUtils]: 10: Hoare triple {6585#(<= 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; {6586#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:32,074 INFO L273 TraceCheckUtils]: 11: Hoare triple {6586#(<= 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; {6587#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:32,075 INFO L273 TraceCheckUtils]: 12: Hoare triple {6587#(<= 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; {6588#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:32,076 INFO L273 TraceCheckUtils]: 13: Hoare triple {6588#(<= 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; {6589#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:32,077 INFO L273 TraceCheckUtils]: 14: Hoare triple {6589#(<= 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; {6590#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:32,078 INFO L273 TraceCheckUtils]: 15: Hoare triple {6590#(<= 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; {6591#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:32,079 INFO L273 TraceCheckUtils]: 16: Hoare triple {6591#(<= main_~i~0 10)} assume !(~i~0 < 100000); {6580#false} is VALID [2018-11-23 12:03:32,079 INFO L273 TraceCheckUtils]: 17: Hoare triple {6580#false} ~i~0 := 0; {6580#false} is VALID [2018-11-23 12:03:32,079 INFO L273 TraceCheckUtils]: 18: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,079 INFO L273 TraceCheckUtils]: 19: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,080 INFO L273 TraceCheckUtils]: 20: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,080 INFO L273 TraceCheckUtils]: 21: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,080 INFO L273 TraceCheckUtils]: 22: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,080 INFO L273 TraceCheckUtils]: 23: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,080 INFO L273 TraceCheckUtils]: 24: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,081 INFO L273 TraceCheckUtils]: 25: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,081 INFO L273 TraceCheckUtils]: 26: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,081 INFO L273 TraceCheckUtils]: 27: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,081 INFO L273 TraceCheckUtils]: 28: Hoare triple {6580#false} assume !(~i~0 < 100000); {6580#false} is VALID [2018-11-23 12:03:32,081 INFO L273 TraceCheckUtils]: 29: Hoare triple {6580#false} ~i~0 := 0; {6580#false} is VALID [2018-11-23 12:03:32,081 INFO L273 TraceCheckUtils]: 30: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,082 INFO L273 TraceCheckUtils]: 31: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,082 INFO L273 TraceCheckUtils]: 32: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,082 INFO L273 TraceCheckUtils]: 33: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,082 INFO L273 TraceCheckUtils]: 34: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,082 INFO L273 TraceCheckUtils]: 35: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,082 INFO L273 TraceCheckUtils]: 36: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,082 INFO L273 TraceCheckUtils]: 37: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,082 INFO L273 TraceCheckUtils]: 38: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,082 INFO L273 TraceCheckUtils]: 39: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,083 INFO L273 TraceCheckUtils]: 40: Hoare triple {6580#false} assume !(~i~0 < 100000); {6580#false} is VALID [2018-11-23 12:03:32,083 INFO L273 TraceCheckUtils]: 41: Hoare triple {6580#false} ~i~0 := 0; {6580#false} is VALID [2018-11-23 12:03:32,083 INFO L273 TraceCheckUtils]: 42: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,083 INFO L273 TraceCheckUtils]: 43: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,083 INFO L273 TraceCheckUtils]: 44: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,083 INFO L273 TraceCheckUtils]: 45: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,083 INFO L273 TraceCheckUtils]: 46: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,083 INFO L273 TraceCheckUtils]: 47: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,084 INFO L273 TraceCheckUtils]: 48: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,084 INFO L273 TraceCheckUtils]: 49: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,084 INFO L273 TraceCheckUtils]: 50: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,084 INFO L273 TraceCheckUtils]: 51: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,084 INFO L273 TraceCheckUtils]: 52: Hoare triple {6580#false} assume !(~i~0 < 100000); {6580#false} is VALID [2018-11-23 12:03:32,084 INFO L273 TraceCheckUtils]: 53: Hoare triple {6580#false} ~i~0 := 0; {6580#false} is VALID [2018-11-23 12:03:32,084 INFO L273 TraceCheckUtils]: 54: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,084 INFO L273 TraceCheckUtils]: 55: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,085 INFO L273 TraceCheckUtils]: 56: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,085 INFO L273 TraceCheckUtils]: 57: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,085 INFO L273 TraceCheckUtils]: 58: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,085 INFO L273 TraceCheckUtils]: 59: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,085 INFO L273 TraceCheckUtils]: 60: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,085 INFO L273 TraceCheckUtils]: 61: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,085 INFO L273 TraceCheckUtils]: 62: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,085 INFO L273 TraceCheckUtils]: 63: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,086 INFO L273 TraceCheckUtils]: 64: Hoare triple {6580#false} assume !(~i~0 < 100000); {6580#false} is VALID [2018-11-23 12:03:32,086 INFO L273 TraceCheckUtils]: 65: Hoare triple {6580#false} ~i~0 := 0; {6580#false} is VALID [2018-11-23 12:03:32,086 INFO L273 TraceCheckUtils]: 66: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,086 INFO L273 TraceCheckUtils]: 67: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,086 INFO L273 TraceCheckUtils]: 68: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,086 INFO L273 TraceCheckUtils]: 69: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,086 INFO L273 TraceCheckUtils]: 70: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,086 INFO L273 TraceCheckUtils]: 71: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,086 INFO L273 TraceCheckUtils]: 72: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,087 INFO L273 TraceCheckUtils]: 73: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,087 INFO L273 TraceCheckUtils]: 74: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,087 INFO L273 TraceCheckUtils]: 75: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,087 INFO L273 TraceCheckUtils]: 76: Hoare triple {6580#false} assume !(~i~0 < 100000); {6580#false} is VALID [2018-11-23 12:03:32,087 INFO L273 TraceCheckUtils]: 77: Hoare triple {6580#false} ~i~0 := 0; {6580#false} is VALID [2018-11-23 12:03:32,087 INFO L273 TraceCheckUtils]: 78: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,087 INFO L273 TraceCheckUtils]: 79: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,087 INFO L273 TraceCheckUtils]: 80: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,088 INFO L273 TraceCheckUtils]: 81: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,088 INFO L273 TraceCheckUtils]: 82: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,088 INFO L273 TraceCheckUtils]: 83: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,088 INFO L273 TraceCheckUtils]: 84: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,088 INFO L273 TraceCheckUtils]: 85: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,088 INFO L273 TraceCheckUtils]: 86: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,088 INFO L273 TraceCheckUtils]: 87: Hoare triple {6580#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6580#false} is VALID [2018-11-23 12:03:32,088 INFO L273 TraceCheckUtils]: 88: Hoare triple {6580#false} assume !(~i~0 < 100000); {6580#false} is VALID [2018-11-23 12:03:32,088 INFO L273 TraceCheckUtils]: 89: Hoare triple {6580#false} havoc ~x~0;~x~0 := 0; {6580#false} is VALID [2018-11-23 12:03:32,089 INFO L273 TraceCheckUtils]: 90: Hoare triple {6580#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6580#false} is VALID [2018-11-23 12:03:32,089 INFO L256 TraceCheckUtils]: 91: Hoare triple {6580#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {6580#false} is VALID [2018-11-23 12:03:32,089 INFO L273 TraceCheckUtils]: 92: Hoare triple {6580#false} ~cond := #in~cond; {6580#false} is VALID [2018-11-23 12:03:32,089 INFO L273 TraceCheckUtils]: 93: Hoare triple {6580#false} assume 0 == ~cond; {6580#false} is VALID [2018-11-23 12:03:32,089 INFO L273 TraceCheckUtils]: 94: Hoare triple {6580#false} assume !false; {6580#false} is VALID [2018-11-23 12:03:32,093 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-11-23 12:03:32,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:32,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 12:03:32,113 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 95 [2018-11-23 12:03:32,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:32,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:03:32,148 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:03:32,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:03:32,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:03:32,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:03:32,150 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand 14 states. [2018-11-23 12:03:32,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:32,850 INFO L93 Difference]: Finished difference Result 190 states and 210 transitions. [2018-11-23 12:03:32,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:03:32,851 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 95 [2018-11-23 12:03:32,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:32,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:03:32,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 150 transitions. [2018-11-23 12:03:32,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:03:32,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 150 transitions. [2018-11-23 12:03:32,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 150 transitions. [2018-11-23 12:03:33,493 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:03:33,496 INFO L225 Difference]: With dead ends: 190 [2018-11-23 12:03:33,496 INFO L226 Difference]: Without dead ends: 107 [2018-11-23 12:03:33,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:03:33,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-23 12:03:33,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-11-23 12:03:33,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:33,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 107 states. [2018-11-23 12:03:33,595 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 107 states. [2018-11-23 12:03:33,596 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 107 states. [2018-11-23 12:03:33,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:33,598 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2018-11-23 12:03:33,598 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2018-11-23 12:03:33,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:33,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:33,598 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 107 states. [2018-11-23 12:03:33,598 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 107 states. [2018-11-23 12:03:33,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:33,601 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2018-11-23 12:03:33,601 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2018-11-23 12:03:33,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:33,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:33,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:33,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:33,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-23 12:03:33,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2018-11-23 12:03:33,604 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 95 [2018-11-23 12:03:33,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:33,604 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2018-11-23 12:03:33,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:03:33,605 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2018-11-23 12:03:33,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-23 12:03:33,606 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:33,606 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:33,606 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:33,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:33,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1082522439, now seen corresponding path program 11 times [2018-11-23 12:03:33,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:33,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:33,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:33,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:33,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:34,835 INFO L256 TraceCheckUtils]: 0: Hoare triple {7639#true} call ULTIMATE.init(); {7639#true} is VALID [2018-11-23 12:03:34,836 INFO L273 TraceCheckUtils]: 1: Hoare triple {7639#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7639#true} is VALID [2018-11-23 12:03:34,836 INFO L273 TraceCheckUtils]: 2: Hoare triple {7639#true} assume true; {7639#true} is VALID [2018-11-23 12:03:34,836 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7639#true} {7639#true} #126#return; {7639#true} is VALID [2018-11-23 12:03:34,836 INFO L256 TraceCheckUtils]: 4: Hoare triple {7639#true} call #t~ret2 := main(); {7639#true} is VALID [2018-11-23 12:03:34,837 INFO L273 TraceCheckUtils]: 5: Hoare triple {7639#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7641#(= main_~i~0 0)} is VALID [2018-11-23 12:03:34,838 INFO L273 TraceCheckUtils]: 6: Hoare triple {7641#(= 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; {7642#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:34,838 INFO L273 TraceCheckUtils]: 7: Hoare triple {7642#(<= 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; {7643#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:34,839 INFO L273 TraceCheckUtils]: 8: Hoare triple {7643#(<= 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; {7644#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:34,839 INFO L273 TraceCheckUtils]: 9: Hoare triple {7644#(<= 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; {7645#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:34,840 INFO L273 TraceCheckUtils]: 10: Hoare triple {7645#(<= 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; {7646#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:34,841 INFO L273 TraceCheckUtils]: 11: Hoare triple {7646#(<= 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; {7647#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:34,842 INFO L273 TraceCheckUtils]: 12: Hoare triple {7647#(<= 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; {7648#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:34,843 INFO L273 TraceCheckUtils]: 13: Hoare triple {7648#(<= 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; {7649#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:34,844 INFO L273 TraceCheckUtils]: 14: Hoare triple {7649#(<= 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; {7650#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:34,845 INFO L273 TraceCheckUtils]: 15: Hoare triple {7650#(<= 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; {7651#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:34,846 INFO L273 TraceCheckUtils]: 16: Hoare triple {7651#(<= 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; {7652#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:34,847 INFO L273 TraceCheckUtils]: 17: Hoare triple {7652#(<= main_~i~0 11)} assume !(~i~0 < 100000); {7640#false} is VALID [2018-11-23 12:03:34,847 INFO L273 TraceCheckUtils]: 18: Hoare triple {7640#false} ~i~0 := 0; {7640#false} is VALID [2018-11-23 12:03:34,847 INFO L273 TraceCheckUtils]: 19: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,848 INFO L273 TraceCheckUtils]: 20: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,848 INFO L273 TraceCheckUtils]: 21: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,848 INFO L273 TraceCheckUtils]: 22: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,848 INFO L273 TraceCheckUtils]: 23: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,849 INFO L273 TraceCheckUtils]: 24: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,849 INFO L273 TraceCheckUtils]: 25: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,849 INFO L273 TraceCheckUtils]: 26: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,850 INFO L273 TraceCheckUtils]: 27: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,850 INFO L273 TraceCheckUtils]: 28: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,850 INFO L273 TraceCheckUtils]: 29: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,850 INFO L273 TraceCheckUtils]: 30: Hoare triple {7640#false} assume !(~i~0 < 100000); {7640#false} is VALID [2018-11-23 12:03:34,851 INFO L273 TraceCheckUtils]: 31: Hoare triple {7640#false} ~i~0 := 0; {7640#false} is VALID [2018-11-23 12:03:34,851 INFO L273 TraceCheckUtils]: 32: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,851 INFO L273 TraceCheckUtils]: 33: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,851 INFO L273 TraceCheckUtils]: 34: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,851 INFO L273 TraceCheckUtils]: 35: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,852 INFO L273 TraceCheckUtils]: 36: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,852 INFO L273 TraceCheckUtils]: 37: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,852 INFO L273 TraceCheckUtils]: 38: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,852 INFO L273 TraceCheckUtils]: 39: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,852 INFO L273 TraceCheckUtils]: 40: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,852 INFO L273 TraceCheckUtils]: 41: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,853 INFO L273 TraceCheckUtils]: 42: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,853 INFO L273 TraceCheckUtils]: 43: Hoare triple {7640#false} assume !(~i~0 < 100000); {7640#false} is VALID [2018-11-23 12:03:34,853 INFO L273 TraceCheckUtils]: 44: Hoare triple {7640#false} ~i~0 := 0; {7640#false} is VALID [2018-11-23 12:03:34,853 INFO L273 TraceCheckUtils]: 45: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,853 INFO L273 TraceCheckUtils]: 46: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,853 INFO L273 TraceCheckUtils]: 47: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,854 INFO L273 TraceCheckUtils]: 48: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,854 INFO L273 TraceCheckUtils]: 49: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,854 INFO L273 TraceCheckUtils]: 50: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,854 INFO L273 TraceCheckUtils]: 51: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,854 INFO L273 TraceCheckUtils]: 52: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,854 INFO L273 TraceCheckUtils]: 53: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,855 INFO L273 TraceCheckUtils]: 54: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,855 INFO L273 TraceCheckUtils]: 55: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,855 INFO L273 TraceCheckUtils]: 56: Hoare triple {7640#false} assume !(~i~0 < 100000); {7640#false} is VALID [2018-11-23 12:03:34,855 INFO L273 TraceCheckUtils]: 57: Hoare triple {7640#false} ~i~0 := 0; {7640#false} is VALID [2018-11-23 12:03:34,855 INFO L273 TraceCheckUtils]: 58: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,855 INFO L273 TraceCheckUtils]: 59: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,856 INFO L273 TraceCheckUtils]: 60: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,856 INFO L273 TraceCheckUtils]: 61: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,856 INFO L273 TraceCheckUtils]: 62: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,856 INFO L273 TraceCheckUtils]: 63: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,856 INFO L273 TraceCheckUtils]: 64: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,856 INFO L273 TraceCheckUtils]: 65: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,857 INFO L273 TraceCheckUtils]: 66: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,857 INFO L273 TraceCheckUtils]: 67: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,857 INFO L273 TraceCheckUtils]: 68: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,857 INFO L273 TraceCheckUtils]: 69: Hoare triple {7640#false} assume !(~i~0 < 100000); {7640#false} is VALID [2018-11-23 12:03:34,857 INFO L273 TraceCheckUtils]: 70: Hoare triple {7640#false} ~i~0 := 0; {7640#false} is VALID [2018-11-23 12:03:34,857 INFO L273 TraceCheckUtils]: 71: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,858 INFO L273 TraceCheckUtils]: 72: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,858 INFO L273 TraceCheckUtils]: 73: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,858 INFO L273 TraceCheckUtils]: 74: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,858 INFO L273 TraceCheckUtils]: 75: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,858 INFO L273 TraceCheckUtils]: 76: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,858 INFO L273 TraceCheckUtils]: 77: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,859 INFO L273 TraceCheckUtils]: 78: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,859 INFO L273 TraceCheckUtils]: 79: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,859 INFO L273 TraceCheckUtils]: 80: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,859 INFO L273 TraceCheckUtils]: 81: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,859 INFO L273 TraceCheckUtils]: 82: Hoare triple {7640#false} assume !(~i~0 < 100000); {7640#false} is VALID [2018-11-23 12:03:34,859 INFO L273 TraceCheckUtils]: 83: Hoare triple {7640#false} ~i~0 := 0; {7640#false} is VALID [2018-11-23 12:03:34,860 INFO L273 TraceCheckUtils]: 84: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,860 INFO L273 TraceCheckUtils]: 85: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,860 INFO L273 TraceCheckUtils]: 86: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,860 INFO L273 TraceCheckUtils]: 87: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,860 INFO L273 TraceCheckUtils]: 88: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,860 INFO L273 TraceCheckUtils]: 89: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,861 INFO L273 TraceCheckUtils]: 90: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,861 INFO L273 TraceCheckUtils]: 91: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,861 INFO L273 TraceCheckUtils]: 92: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,861 INFO L273 TraceCheckUtils]: 93: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,861 INFO L273 TraceCheckUtils]: 94: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:03:34,861 INFO L273 TraceCheckUtils]: 95: Hoare triple {7640#false} assume !(~i~0 < 100000); {7640#false} is VALID [2018-11-23 12:03:34,862 INFO L273 TraceCheckUtils]: 96: Hoare triple {7640#false} havoc ~x~0;~x~0 := 0; {7640#false} is VALID [2018-11-23 12:03:34,862 INFO L273 TraceCheckUtils]: 97: Hoare triple {7640#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7640#false} is VALID [2018-11-23 12:03:34,862 INFO L256 TraceCheckUtils]: 98: Hoare triple {7640#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {7640#false} is VALID [2018-11-23 12:03:34,862 INFO L273 TraceCheckUtils]: 99: Hoare triple {7640#false} ~cond := #in~cond; {7640#false} is VALID [2018-11-23 12:03:34,862 INFO L273 TraceCheckUtils]: 100: Hoare triple {7640#false} assume 0 == ~cond; {7640#false} is VALID [2018-11-23 12:03:34,863 INFO L273 TraceCheckUtils]: 101: Hoare triple {7640#false} assume !false; {7640#false} is VALID [2018-11-23 12:03:34,868 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2018-11-23 12:03:34,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:34,868 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:34,881 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:04:26,142 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 12:04:26,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:04:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:26,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:26,369 INFO L256 TraceCheckUtils]: 0: Hoare triple {7639#true} call ULTIMATE.init(); {7639#true} is VALID [2018-11-23 12:04:26,369 INFO L273 TraceCheckUtils]: 1: Hoare triple {7639#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7639#true} is VALID [2018-11-23 12:04:26,369 INFO L273 TraceCheckUtils]: 2: Hoare triple {7639#true} assume true; {7639#true} is VALID [2018-11-23 12:04:26,370 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7639#true} {7639#true} #126#return; {7639#true} is VALID [2018-11-23 12:04:26,370 INFO L256 TraceCheckUtils]: 4: Hoare triple {7639#true} call #t~ret2 := main(); {7639#true} is VALID [2018-11-23 12:04:26,370 INFO L273 TraceCheckUtils]: 5: Hoare triple {7639#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7639#true} is VALID [2018-11-23 12:04:26,370 INFO L273 TraceCheckUtils]: 6: Hoare triple {7639#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7639#true} is VALID [2018-11-23 12:04:26,371 INFO L273 TraceCheckUtils]: 7: Hoare triple {7639#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7639#true} is VALID [2018-11-23 12:04:26,371 INFO L273 TraceCheckUtils]: 8: Hoare triple {7639#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7639#true} is VALID [2018-11-23 12:04:26,371 INFO L273 TraceCheckUtils]: 9: Hoare triple {7639#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7639#true} is VALID [2018-11-23 12:04:26,371 INFO L273 TraceCheckUtils]: 10: Hoare triple {7639#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7639#true} is VALID [2018-11-23 12:04:26,371 INFO L273 TraceCheckUtils]: 11: Hoare triple {7639#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7639#true} is VALID [2018-11-23 12:04:26,372 INFO L273 TraceCheckUtils]: 12: Hoare triple {7639#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7639#true} is VALID [2018-11-23 12:04:26,372 INFO L273 TraceCheckUtils]: 13: Hoare triple {7639#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7639#true} is VALID [2018-11-23 12:04:26,372 INFO L273 TraceCheckUtils]: 14: Hoare triple {7639#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7639#true} is VALID [2018-11-23 12:04:26,372 INFO L273 TraceCheckUtils]: 15: Hoare triple {7639#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7639#true} is VALID [2018-11-23 12:04:26,372 INFO L273 TraceCheckUtils]: 16: Hoare triple {7639#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7639#true} is VALID [2018-11-23 12:04:26,372 INFO L273 TraceCheckUtils]: 17: Hoare triple {7639#true} assume !(~i~0 < 100000); {7639#true} is VALID [2018-11-23 12:04:26,372 INFO L273 TraceCheckUtils]: 18: Hoare triple {7639#true} ~i~0 := 0; {7639#true} is VALID [2018-11-23 12:04:26,373 INFO L273 TraceCheckUtils]: 19: Hoare triple {7639#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7639#true} is VALID [2018-11-23 12:04:26,373 INFO L273 TraceCheckUtils]: 20: Hoare triple {7639#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7639#true} is VALID [2018-11-23 12:04:26,373 INFO L273 TraceCheckUtils]: 21: Hoare triple {7639#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7639#true} is VALID [2018-11-23 12:04:26,373 INFO L273 TraceCheckUtils]: 22: Hoare triple {7639#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7639#true} is VALID [2018-11-23 12:04:26,373 INFO L273 TraceCheckUtils]: 23: Hoare triple {7639#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7639#true} is VALID [2018-11-23 12:04:26,373 INFO L273 TraceCheckUtils]: 24: Hoare triple {7639#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7639#true} is VALID [2018-11-23 12:04:26,373 INFO L273 TraceCheckUtils]: 25: Hoare triple {7639#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7639#true} is VALID [2018-11-23 12:04:26,373 INFO L273 TraceCheckUtils]: 26: Hoare triple {7639#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7639#true} is VALID [2018-11-23 12:04:26,373 INFO L273 TraceCheckUtils]: 27: Hoare triple {7639#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7639#true} is VALID [2018-11-23 12:04:26,374 INFO L273 TraceCheckUtils]: 28: Hoare triple {7639#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7639#true} is VALID [2018-11-23 12:04:26,374 INFO L273 TraceCheckUtils]: 29: Hoare triple {7639#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7639#true} is VALID [2018-11-23 12:04:26,374 INFO L273 TraceCheckUtils]: 30: Hoare triple {7639#true} assume !(~i~0 < 100000); {7639#true} is VALID [2018-11-23 12:04:26,374 INFO L273 TraceCheckUtils]: 31: Hoare triple {7639#true} ~i~0 := 0; {7749#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:26,375 INFO L273 TraceCheckUtils]: 32: Hoare triple {7749#(<= 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; {7642#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:26,376 INFO L273 TraceCheckUtils]: 33: Hoare triple {7642#(<= 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; {7643#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:26,376 INFO L273 TraceCheckUtils]: 34: Hoare triple {7643#(<= 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; {7644#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:26,377 INFO L273 TraceCheckUtils]: 35: Hoare triple {7644#(<= 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; {7645#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:26,378 INFO L273 TraceCheckUtils]: 36: Hoare triple {7645#(<= 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; {7646#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:26,379 INFO L273 TraceCheckUtils]: 37: Hoare triple {7646#(<= 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; {7647#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:26,380 INFO L273 TraceCheckUtils]: 38: Hoare triple {7647#(<= 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; {7648#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:26,380 INFO L273 TraceCheckUtils]: 39: Hoare triple {7648#(<= 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; {7649#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:26,381 INFO L273 TraceCheckUtils]: 40: Hoare triple {7649#(<= 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; {7650#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:26,382 INFO L273 TraceCheckUtils]: 41: Hoare triple {7650#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7651#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:26,383 INFO L273 TraceCheckUtils]: 42: Hoare triple {7651#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7652#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:26,384 INFO L273 TraceCheckUtils]: 43: Hoare triple {7652#(<= main_~i~0 11)} assume !(~i~0 < 100000); {7640#false} is VALID [2018-11-23 12:04:26,384 INFO L273 TraceCheckUtils]: 44: Hoare triple {7640#false} ~i~0 := 0; {7640#false} is VALID [2018-11-23 12:04:26,384 INFO L273 TraceCheckUtils]: 45: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,385 INFO L273 TraceCheckUtils]: 46: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,385 INFO L273 TraceCheckUtils]: 47: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,385 INFO L273 TraceCheckUtils]: 48: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,385 INFO L273 TraceCheckUtils]: 49: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,386 INFO L273 TraceCheckUtils]: 50: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,386 INFO L273 TraceCheckUtils]: 51: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,386 INFO L273 TraceCheckUtils]: 52: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,386 INFO L273 TraceCheckUtils]: 53: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,386 INFO L273 TraceCheckUtils]: 54: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,387 INFO L273 TraceCheckUtils]: 55: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,387 INFO L273 TraceCheckUtils]: 56: Hoare triple {7640#false} assume !(~i~0 < 100000); {7640#false} is VALID [2018-11-23 12:04:26,387 INFO L273 TraceCheckUtils]: 57: Hoare triple {7640#false} ~i~0 := 0; {7640#false} is VALID [2018-11-23 12:04:26,387 INFO L273 TraceCheckUtils]: 58: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,387 INFO L273 TraceCheckUtils]: 59: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,388 INFO L273 TraceCheckUtils]: 60: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,388 INFO L273 TraceCheckUtils]: 61: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,388 INFO L273 TraceCheckUtils]: 62: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,388 INFO L273 TraceCheckUtils]: 63: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,388 INFO L273 TraceCheckUtils]: 64: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,389 INFO L273 TraceCheckUtils]: 65: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,389 INFO L273 TraceCheckUtils]: 66: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,389 INFO L273 TraceCheckUtils]: 67: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,389 INFO L273 TraceCheckUtils]: 68: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,389 INFO L273 TraceCheckUtils]: 69: Hoare triple {7640#false} assume !(~i~0 < 100000); {7640#false} is VALID [2018-11-23 12:04:26,390 INFO L273 TraceCheckUtils]: 70: Hoare triple {7640#false} ~i~0 := 0; {7640#false} is VALID [2018-11-23 12:04:26,390 INFO L273 TraceCheckUtils]: 71: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,390 INFO L273 TraceCheckUtils]: 72: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,390 INFO L273 TraceCheckUtils]: 73: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,390 INFO L273 TraceCheckUtils]: 74: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,390 INFO L273 TraceCheckUtils]: 75: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,390 INFO L273 TraceCheckUtils]: 76: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,391 INFO L273 TraceCheckUtils]: 77: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,391 INFO L273 TraceCheckUtils]: 78: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,391 INFO L273 TraceCheckUtils]: 79: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,391 INFO L273 TraceCheckUtils]: 80: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,391 INFO L273 TraceCheckUtils]: 81: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,391 INFO L273 TraceCheckUtils]: 82: Hoare triple {7640#false} assume !(~i~0 < 100000); {7640#false} is VALID [2018-11-23 12:04:26,391 INFO L273 TraceCheckUtils]: 83: Hoare triple {7640#false} ~i~0 := 0; {7640#false} is VALID [2018-11-23 12:04:26,391 INFO L273 TraceCheckUtils]: 84: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,391 INFO L273 TraceCheckUtils]: 85: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,392 INFO L273 TraceCheckUtils]: 86: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,392 INFO L273 TraceCheckUtils]: 87: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,392 INFO L273 TraceCheckUtils]: 88: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,392 INFO L273 TraceCheckUtils]: 89: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,392 INFO L273 TraceCheckUtils]: 90: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,392 INFO L273 TraceCheckUtils]: 91: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,392 INFO L273 TraceCheckUtils]: 92: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,392 INFO L273 TraceCheckUtils]: 93: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,393 INFO L273 TraceCheckUtils]: 94: Hoare triple {7640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7640#false} is VALID [2018-11-23 12:04:26,393 INFO L273 TraceCheckUtils]: 95: Hoare triple {7640#false} assume !(~i~0 < 100000); {7640#false} is VALID [2018-11-23 12:04:26,393 INFO L273 TraceCheckUtils]: 96: Hoare triple {7640#false} havoc ~x~0;~x~0 := 0; {7640#false} is VALID [2018-11-23 12:04:26,393 INFO L273 TraceCheckUtils]: 97: Hoare triple {7640#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7640#false} is VALID [2018-11-23 12:04:26,393 INFO L256 TraceCheckUtils]: 98: Hoare triple {7640#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {7640#false} is VALID [2018-11-23 12:04:26,393 INFO L273 TraceCheckUtils]: 99: Hoare triple {7640#false} ~cond := #in~cond; {7640#false} is VALID [2018-11-23 12:04:26,393 INFO L273 TraceCheckUtils]: 100: Hoare triple {7640#false} assume 0 == ~cond; {7640#false} is VALID [2018-11-23 12:04:26,393 INFO L273 TraceCheckUtils]: 101: Hoare triple {7640#false} assume !false; {7640#false} is VALID [2018-11-23 12:04:26,398 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2018-11-23 12:04:26,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:26,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 12:04:26,429 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 102 [2018-11-23 12:04:26,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:26,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:04:26,490 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:26,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:04:26,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:04:26,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:04:26,492 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 15 states. [2018-11-23 12:04:27,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:27,218 INFO L93 Difference]: Finished difference Result 203 states and 223 transitions. [2018-11-23 12:04:27,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:04:27,218 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 102 [2018-11-23 12:04:27,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:27,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:04:27,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2018-11-23 12:04:27,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:04:27,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2018-11-23 12:04:27,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 157 transitions. [2018-11-23 12:04:27,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:27,807 INFO L225 Difference]: With dead ends: 203 [2018-11-23 12:04:27,807 INFO L226 Difference]: Without dead ends: 114 [2018-11-23 12:04:27,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:04:27,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-23 12:04:27,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-11-23 12:04:27,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:27,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 114 states. [2018-11-23 12:04:27,890 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 114 states. [2018-11-23 12:04:27,890 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 114 states. [2018-11-23 12:04:27,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:27,893 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2018-11-23 12:04:27,893 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2018-11-23 12:04:27,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:27,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:27,894 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 114 states. [2018-11-23 12:04:27,894 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 114 states. [2018-11-23 12:04:27,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:27,897 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2018-11-23 12:04:27,898 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2018-11-23 12:04:27,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:27,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:27,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:27,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:27,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-23 12:04:27,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2018-11-23 12:04:27,901 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 102 [2018-11-23 12:04:27,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:27,902 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2018-11-23 12:04:27,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:04:27,902 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2018-11-23 12:04:27,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-23 12:04:27,903 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:27,904 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:04:27,904 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:27,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:27,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1458319606, now seen corresponding path program 12 times [2018-11-23 12:04:27,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:27,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:27,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:27,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:04:27,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:29,316 INFO L256 TraceCheckUtils]: 0: Hoare triple {8775#true} call ULTIMATE.init(); {8775#true} is VALID [2018-11-23 12:04:29,317 INFO L273 TraceCheckUtils]: 1: Hoare triple {8775#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8775#true} is VALID [2018-11-23 12:04:29,317 INFO L273 TraceCheckUtils]: 2: Hoare triple {8775#true} assume true; {8775#true} is VALID [2018-11-23 12:04:29,317 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8775#true} {8775#true} #126#return; {8775#true} is VALID [2018-11-23 12:04:29,317 INFO L256 TraceCheckUtils]: 4: Hoare triple {8775#true} call #t~ret2 := main(); {8775#true} is VALID [2018-11-23 12:04:29,318 INFO L273 TraceCheckUtils]: 5: Hoare triple {8775#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8777#(= main_~i~0 0)} is VALID [2018-11-23 12:04:29,319 INFO L273 TraceCheckUtils]: 6: Hoare triple {8777#(= 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; {8778#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:29,319 INFO L273 TraceCheckUtils]: 7: Hoare triple {8778#(<= 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; {8779#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:29,320 INFO L273 TraceCheckUtils]: 8: Hoare triple {8779#(<= 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; {8780#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:29,320 INFO L273 TraceCheckUtils]: 9: Hoare triple {8780#(<= 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; {8781#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:29,321 INFO L273 TraceCheckUtils]: 10: Hoare triple {8781#(<= 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; {8782#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:29,322 INFO L273 TraceCheckUtils]: 11: Hoare triple {8782#(<= 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; {8783#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:29,323 INFO L273 TraceCheckUtils]: 12: Hoare triple {8783#(<= 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; {8784#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:29,324 INFO L273 TraceCheckUtils]: 13: Hoare triple {8784#(<= 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; {8785#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:29,326 INFO L273 TraceCheckUtils]: 14: Hoare triple {8785#(<= 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; {8786#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:29,327 INFO L273 TraceCheckUtils]: 15: Hoare triple {8786#(<= 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; {8787#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:29,327 INFO L273 TraceCheckUtils]: 16: Hoare triple {8787#(<= 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; {8788#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:29,328 INFO L273 TraceCheckUtils]: 17: Hoare triple {8788#(<= 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; {8789#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:29,329 INFO L273 TraceCheckUtils]: 18: Hoare triple {8789#(<= main_~i~0 12)} assume !(~i~0 < 100000); {8776#false} is VALID [2018-11-23 12:04:29,329 INFO L273 TraceCheckUtils]: 19: Hoare triple {8776#false} ~i~0 := 0; {8776#false} is VALID [2018-11-23 12:04:29,330 INFO L273 TraceCheckUtils]: 20: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,330 INFO L273 TraceCheckUtils]: 21: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,330 INFO L273 TraceCheckUtils]: 22: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,330 INFO L273 TraceCheckUtils]: 23: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,330 INFO L273 TraceCheckUtils]: 24: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,331 INFO L273 TraceCheckUtils]: 25: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,331 INFO L273 TraceCheckUtils]: 26: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,331 INFO L273 TraceCheckUtils]: 27: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,331 INFO L273 TraceCheckUtils]: 28: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,331 INFO L273 TraceCheckUtils]: 29: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,332 INFO L273 TraceCheckUtils]: 30: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,332 INFO L273 TraceCheckUtils]: 31: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,332 INFO L273 TraceCheckUtils]: 32: Hoare triple {8776#false} assume !(~i~0 < 100000); {8776#false} is VALID [2018-11-23 12:04:29,332 INFO L273 TraceCheckUtils]: 33: Hoare triple {8776#false} ~i~0 := 0; {8776#false} is VALID [2018-11-23 12:04:29,332 INFO L273 TraceCheckUtils]: 34: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,332 INFO L273 TraceCheckUtils]: 35: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,332 INFO L273 TraceCheckUtils]: 36: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,332 INFO L273 TraceCheckUtils]: 37: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,332 INFO L273 TraceCheckUtils]: 38: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,333 INFO L273 TraceCheckUtils]: 39: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,333 INFO L273 TraceCheckUtils]: 40: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,333 INFO L273 TraceCheckUtils]: 41: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,333 INFO L273 TraceCheckUtils]: 42: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,333 INFO L273 TraceCheckUtils]: 43: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,333 INFO L273 TraceCheckUtils]: 44: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,333 INFO L273 TraceCheckUtils]: 45: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,333 INFO L273 TraceCheckUtils]: 46: Hoare triple {8776#false} assume !(~i~0 < 100000); {8776#false} is VALID [2018-11-23 12:04:29,334 INFO L273 TraceCheckUtils]: 47: Hoare triple {8776#false} ~i~0 := 0; {8776#false} is VALID [2018-11-23 12:04:29,334 INFO L273 TraceCheckUtils]: 48: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,334 INFO L273 TraceCheckUtils]: 49: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,334 INFO L273 TraceCheckUtils]: 50: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,334 INFO L273 TraceCheckUtils]: 51: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,334 INFO L273 TraceCheckUtils]: 52: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,334 INFO L273 TraceCheckUtils]: 53: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,334 INFO L273 TraceCheckUtils]: 54: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,335 INFO L273 TraceCheckUtils]: 55: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,335 INFO L273 TraceCheckUtils]: 56: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,335 INFO L273 TraceCheckUtils]: 57: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,335 INFO L273 TraceCheckUtils]: 58: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,335 INFO L273 TraceCheckUtils]: 59: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,335 INFO L273 TraceCheckUtils]: 60: Hoare triple {8776#false} assume !(~i~0 < 100000); {8776#false} is VALID [2018-11-23 12:04:29,335 INFO L273 TraceCheckUtils]: 61: Hoare triple {8776#false} ~i~0 := 0; {8776#false} is VALID [2018-11-23 12:04:29,335 INFO L273 TraceCheckUtils]: 62: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,335 INFO L273 TraceCheckUtils]: 63: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,336 INFO L273 TraceCheckUtils]: 64: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,336 INFO L273 TraceCheckUtils]: 65: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,336 INFO L273 TraceCheckUtils]: 66: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,336 INFO L273 TraceCheckUtils]: 67: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,336 INFO L273 TraceCheckUtils]: 68: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,336 INFO L273 TraceCheckUtils]: 69: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,336 INFO L273 TraceCheckUtils]: 70: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,336 INFO L273 TraceCheckUtils]: 71: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,337 INFO L273 TraceCheckUtils]: 72: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,337 INFO L273 TraceCheckUtils]: 73: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,337 INFO L273 TraceCheckUtils]: 74: Hoare triple {8776#false} assume !(~i~0 < 100000); {8776#false} is VALID [2018-11-23 12:04:29,337 INFO L273 TraceCheckUtils]: 75: Hoare triple {8776#false} ~i~0 := 0; {8776#false} is VALID [2018-11-23 12:04:29,337 INFO L273 TraceCheckUtils]: 76: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,337 INFO L273 TraceCheckUtils]: 77: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,337 INFO L273 TraceCheckUtils]: 78: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,337 INFO L273 TraceCheckUtils]: 79: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,337 INFO L273 TraceCheckUtils]: 80: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,338 INFO L273 TraceCheckUtils]: 81: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,338 INFO L273 TraceCheckUtils]: 82: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,338 INFO L273 TraceCheckUtils]: 83: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,338 INFO L273 TraceCheckUtils]: 84: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,338 INFO L273 TraceCheckUtils]: 85: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,338 INFO L273 TraceCheckUtils]: 86: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,338 INFO L273 TraceCheckUtils]: 87: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,338 INFO L273 TraceCheckUtils]: 88: Hoare triple {8776#false} assume !(~i~0 < 100000); {8776#false} is VALID [2018-11-23 12:04:29,339 INFO L273 TraceCheckUtils]: 89: Hoare triple {8776#false} ~i~0 := 0; {8776#false} is VALID [2018-11-23 12:04:29,339 INFO L273 TraceCheckUtils]: 90: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,339 INFO L273 TraceCheckUtils]: 91: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,339 INFO L273 TraceCheckUtils]: 92: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,339 INFO L273 TraceCheckUtils]: 93: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,339 INFO L273 TraceCheckUtils]: 94: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,339 INFO L273 TraceCheckUtils]: 95: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,339 INFO L273 TraceCheckUtils]: 96: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,340 INFO L273 TraceCheckUtils]: 97: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,340 INFO L273 TraceCheckUtils]: 98: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,340 INFO L273 TraceCheckUtils]: 99: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,340 INFO L273 TraceCheckUtils]: 100: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,340 INFO L273 TraceCheckUtils]: 101: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:04:29,340 INFO L273 TraceCheckUtils]: 102: Hoare triple {8776#false} assume !(~i~0 < 100000); {8776#false} is VALID [2018-11-23 12:04:29,340 INFO L273 TraceCheckUtils]: 103: Hoare triple {8776#false} havoc ~x~0;~x~0 := 0; {8776#false} is VALID [2018-11-23 12:04:29,340 INFO L273 TraceCheckUtils]: 104: Hoare triple {8776#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8776#false} is VALID [2018-11-23 12:04:29,340 INFO L256 TraceCheckUtils]: 105: Hoare triple {8776#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {8776#false} is VALID [2018-11-23 12:04:29,341 INFO L273 TraceCheckUtils]: 106: Hoare triple {8776#false} ~cond := #in~cond; {8776#false} is VALID [2018-11-23 12:04:29,341 INFO L273 TraceCheckUtils]: 107: Hoare triple {8776#false} assume 0 == ~cond; {8776#false} is VALID [2018-11-23 12:04:29,341 INFO L273 TraceCheckUtils]: 108: Hoare triple {8776#false} assume !false; {8776#false} is VALID [2018-11-23 12:04:29,346 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2018-11-23 12:04:29,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:29,347 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:04:29,356 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:05:07,251 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:05:07,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:07,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:07,667 INFO L256 TraceCheckUtils]: 0: Hoare triple {8775#true} call ULTIMATE.init(); {8775#true} is VALID [2018-11-23 12:05:07,667 INFO L273 TraceCheckUtils]: 1: Hoare triple {8775#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8775#true} is VALID [2018-11-23 12:05:07,668 INFO L273 TraceCheckUtils]: 2: Hoare triple {8775#true} assume true; {8775#true} is VALID [2018-11-23 12:05:07,668 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8775#true} {8775#true} #126#return; {8775#true} is VALID [2018-11-23 12:05:07,668 INFO L256 TraceCheckUtils]: 4: Hoare triple {8775#true} call #t~ret2 := main(); {8775#true} is VALID [2018-11-23 12:05:07,668 INFO L273 TraceCheckUtils]: 5: Hoare triple {8775#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8775#true} is VALID [2018-11-23 12:05:07,668 INFO L273 TraceCheckUtils]: 6: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,669 INFO L273 TraceCheckUtils]: 7: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,669 INFO L273 TraceCheckUtils]: 8: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,669 INFO L273 TraceCheckUtils]: 9: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,669 INFO L273 TraceCheckUtils]: 10: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,670 INFO L273 TraceCheckUtils]: 11: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,670 INFO L273 TraceCheckUtils]: 12: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,670 INFO L273 TraceCheckUtils]: 13: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,671 INFO L273 TraceCheckUtils]: 14: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,671 INFO L273 TraceCheckUtils]: 15: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,671 INFO L273 TraceCheckUtils]: 16: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,671 INFO L273 TraceCheckUtils]: 17: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,672 INFO L273 TraceCheckUtils]: 18: Hoare triple {8775#true} assume !(~i~0 < 100000); {8775#true} is VALID [2018-11-23 12:05:07,672 INFO L273 TraceCheckUtils]: 19: Hoare triple {8775#true} ~i~0 := 0; {8775#true} is VALID [2018-11-23 12:05:07,672 INFO L273 TraceCheckUtils]: 20: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,672 INFO L273 TraceCheckUtils]: 21: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,672 INFO L273 TraceCheckUtils]: 22: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,672 INFO L273 TraceCheckUtils]: 23: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,673 INFO L273 TraceCheckUtils]: 24: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,673 INFO L273 TraceCheckUtils]: 25: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,673 INFO L273 TraceCheckUtils]: 26: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,673 INFO L273 TraceCheckUtils]: 27: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,673 INFO L273 TraceCheckUtils]: 28: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,674 INFO L273 TraceCheckUtils]: 29: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,674 INFO L273 TraceCheckUtils]: 30: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,674 INFO L273 TraceCheckUtils]: 31: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,674 INFO L273 TraceCheckUtils]: 32: Hoare triple {8775#true} assume !(~i~0 < 100000); {8775#true} is VALID [2018-11-23 12:05:07,674 INFO L273 TraceCheckUtils]: 33: Hoare triple {8775#true} ~i~0 := 0; {8775#true} is VALID [2018-11-23 12:05:07,674 INFO L273 TraceCheckUtils]: 34: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,675 INFO L273 TraceCheckUtils]: 35: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,675 INFO L273 TraceCheckUtils]: 36: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,675 INFO L273 TraceCheckUtils]: 37: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,675 INFO L273 TraceCheckUtils]: 38: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,675 INFO L273 TraceCheckUtils]: 39: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,676 INFO L273 TraceCheckUtils]: 40: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,676 INFO L273 TraceCheckUtils]: 41: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,676 INFO L273 TraceCheckUtils]: 42: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,676 INFO L273 TraceCheckUtils]: 43: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,676 INFO L273 TraceCheckUtils]: 44: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,676 INFO L273 TraceCheckUtils]: 45: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,677 INFO L273 TraceCheckUtils]: 46: Hoare triple {8775#true} assume !(~i~0 < 100000); {8775#true} is VALID [2018-11-23 12:05:07,677 INFO L273 TraceCheckUtils]: 47: Hoare triple {8775#true} ~i~0 := 0; {8775#true} is VALID [2018-11-23 12:05:07,677 INFO L273 TraceCheckUtils]: 48: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,677 INFO L273 TraceCheckUtils]: 49: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,677 INFO L273 TraceCheckUtils]: 50: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,677 INFO L273 TraceCheckUtils]: 51: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,678 INFO L273 TraceCheckUtils]: 52: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,678 INFO L273 TraceCheckUtils]: 53: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,678 INFO L273 TraceCheckUtils]: 54: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,678 INFO L273 TraceCheckUtils]: 55: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,678 INFO L273 TraceCheckUtils]: 56: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,679 INFO L273 TraceCheckUtils]: 57: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,679 INFO L273 TraceCheckUtils]: 58: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,679 INFO L273 TraceCheckUtils]: 59: Hoare triple {8775#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8775#true} is VALID [2018-11-23 12:05:07,679 INFO L273 TraceCheckUtils]: 60: Hoare triple {8775#true} assume !(~i~0 < 100000); {8775#true} is VALID [2018-11-23 12:05:07,693 INFO L273 TraceCheckUtils]: 61: Hoare triple {8775#true} ~i~0 := 0; {8976#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:07,708 INFO L273 TraceCheckUtils]: 62: Hoare triple {8976#(<= 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; {8778#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:07,723 INFO L273 TraceCheckUtils]: 63: Hoare triple {8778#(<= 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; {8779#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:07,724 INFO L273 TraceCheckUtils]: 64: Hoare triple {8779#(<= 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; {8780#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:07,728 INFO L273 TraceCheckUtils]: 65: Hoare triple {8780#(<= 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; {8781#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:07,728 INFO L273 TraceCheckUtils]: 66: Hoare triple {8781#(<= 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; {8782#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:07,730 INFO L273 TraceCheckUtils]: 67: Hoare triple {8782#(<= 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; {8783#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:07,730 INFO L273 TraceCheckUtils]: 68: Hoare triple {8783#(<= 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; {8784#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:07,741 INFO L273 TraceCheckUtils]: 69: Hoare triple {8784#(<= 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; {8785#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:07,742 INFO L273 TraceCheckUtils]: 70: Hoare triple {8785#(<= 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; {8786#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:07,742 INFO L273 TraceCheckUtils]: 71: Hoare triple {8786#(<= 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; {8787#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:07,743 INFO L273 TraceCheckUtils]: 72: Hoare triple {8787#(<= 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; {8788#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:07,743 INFO L273 TraceCheckUtils]: 73: Hoare triple {8788#(<= 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; {8789#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:07,744 INFO L273 TraceCheckUtils]: 74: Hoare triple {8789#(<= main_~i~0 12)} assume !(~i~0 < 100000); {8776#false} is VALID [2018-11-23 12:05:07,744 INFO L273 TraceCheckUtils]: 75: Hoare triple {8776#false} ~i~0 := 0; {8776#false} is VALID [2018-11-23 12:05:07,744 INFO L273 TraceCheckUtils]: 76: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:05:07,744 INFO L273 TraceCheckUtils]: 77: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:05:07,744 INFO L273 TraceCheckUtils]: 78: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:05:07,745 INFO L273 TraceCheckUtils]: 79: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:05:07,745 INFO L273 TraceCheckUtils]: 80: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:05:07,745 INFO L273 TraceCheckUtils]: 81: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:05:07,745 INFO L273 TraceCheckUtils]: 82: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:05:07,745 INFO L273 TraceCheckUtils]: 83: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:05:07,746 INFO L273 TraceCheckUtils]: 84: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:05:07,746 INFO L273 TraceCheckUtils]: 85: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:05:07,746 INFO L273 TraceCheckUtils]: 86: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:05:07,746 INFO L273 TraceCheckUtils]: 87: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:05:07,746 INFO L273 TraceCheckUtils]: 88: Hoare triple {8776#false} assume !(~i~0 < 100000); {8776#false} is VALID [2018-11-23 12:05:07,747 INFO L273 TraceCheckUtils]: 89: Hoare triple {8776#false} ~i~0 := 0; {8776#false} is VALID [2018-11-23 12:05:07,747 INFO L273 TraceCheckUtils]: 90: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:05:07,747 INFO L273 TraceCheckUtils]: 91: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:05:07,747 INFO L273 TraceCheckUtils]: 92: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:05:07,747 INFO L273 TraceCheckUtils]: 93: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:05:07,748 INFO L273 TraceCheckUtils]: 94: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:05:07,748 INFO L273 TraceCheckUtils]: 95: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:05:07,748 INFO L273 TraceCheckUtils]: 96: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:05:07,748 INFO L273 TraceCheckUtils]: 97: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:05:07,748 INFO L273 TraceCheckUtils]: 98: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:05:07,749 INFO L273 TraceCheckUtils]: 99: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:05:07,749 INFO L273 TraceCheckUtils]: 100: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:05:07,749 INFO L273 TraceCheckUtils]: 101: Hoare triple {8776#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8776#false} is VALID [2018-11-23 12:05:07,749 INFO L273 TraceCheckUtils]: 102: Hoare triple {8776#false} assume !(~i~0 < 100000); {8776#false} is VALID [2018-11-23 12:05:07,749 INFO L273 TraceCheckUtils]: 103: Hoare triple {8776#false} havoc ~x~0;~x~0 := 0; {8776#false} is VALID [2018-11-23 12:05:07,749 INFO L273 TraceCheckUtils]: 104: Hoare triple {8776#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8776#false} is VALID [2018-11-23 12:05:07,749 INFO L256 TraceCheckUtils]: 105: Hoare triple {8776#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {8776#false} is VALID [2018-11-23 12:05:07,750 INFO L273 TraceCheckUtils]: 106: Hoare triple {8776#false} ~cond := #in~cond; {8776#false} is VALID [2018-11-23 12:05:07,750 INFO L273 TraceCheckUtils]: 107: Hoare triple {8776#false} assume 0 == ~cond; {8776#false} is VALID [2018-11-23 12:05:07,750 INFO L273 TraceCheckUtils]: 108: Hoare triple {8776#false} assume !false; {8776#false} is VALID [2018-11-23 12:05:07,754 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2018-11-23 12:05:07,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:07,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 12:05:07,784 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 109 [2018-11-23 12:05:07,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:07,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 12:05:07,849 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:07,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 12:05:07,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 12:05:07,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:05:07,851 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 16 states. [2018-11-23 12:05:08,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:08,627 INFO L93 Difference]: Finished difference Result 216 states and 236 transitions. [2018-11-23 12:05:08,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:05:08,627 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 109 [2018-11-23 12:05:08,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:08,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:05:08,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 164 transitions. [2018-11-23 12:05:08,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:05:08,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 164 transitions. [2018-11-23 12:05:08,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 164 transitions. [2018-11-23 12:05:08,816 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:08,819 INFO L225 Difference]: With dead ends: 216 [2018-11-23 12:05:08,819 INFO L226 Difference]: Without dead ends: 121 [2018-11-23 12:05:08,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:05:08,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-23 12:05:08,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-11-23 12:05:08,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:08,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 121 states. [2018-11-23 12:05:08,922 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 121 states. [2018-11-23 12:05:08,922 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 121 states. [2018-11-23 12:05:08,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:08,925 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2018-11-23 12:05:08,925 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2018-11-23 12:05:08,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:08,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:08,926 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 121 states. [2018-11-23 12:05:08,926 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 121 states. [2018-11-23 12:05:08,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:08,928 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2018-11-23 12:05:08,928 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2018-11-23 12:05:08,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:08,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:08,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:08,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:08,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-23 12:05:08,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2018-11-23 12:05:08,931 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 109 [2018-11-23 12:05:08,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:08,932 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2018-11-23 12:05:08,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 12:05:08,932 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2018-11-23 12:05:08,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-23 12:05:08,933 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:08,933 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:08,933 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:08,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:08,934 INFO L82 PathProgramCache]: Analyzing trace with hash -882690329, now seen corresponding path program 13 times [2018-11-23 12:05:08,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:08,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:08,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:08,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:08,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:09,312 INFO L256 TraceCheckUtils]: 0: Hoare triple {9987#true} call ULTIMATE.init(); {9987#true} is VALID [2018-11-23 12:05:09,312 INFO L273 TraceCheckUtils]: 1: Hoare triple {9987#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9987#true} is VALID [2018-11-23 12:05:09,313 INFO L273 TraceCheckUtils]: 2: Hoare triple {9987#true} assume true; {9987#true} is VALID [2018-11-23 12:05:09,313 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9987#true} {9987#true} #126#return; {9987#true} is VALID [2018-11-23 12:05:09,313 INFO L256 TraceCheckUtils]: 4: Hoare triple {9987#true} call #t~ret2 := main(); {9987#true} is VALID [2018-11-23 12:05:09,314 INFO L273 TraceCheckUtils]: 5: Hoare triple {9987#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9989#(= main_~i~0 0)} is VALID [2018-11-23 12:05:09,314 INFO L273 TraceCheckUtils]: 6: Hoare triple {9989#(= 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; {9990#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:09,315 INFO L273 TraceCheckUtils]: 7: Hoare triple {9990#(<= 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; {9991#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:09,315 INFO L273 TraceCheckUtils]: 8: Hoare triple {9991#(<= 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; {9992#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:09,316 INFO L273 TraceCheckUtils]: 9: Hoare triple {9992#(<= 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; {9993#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:09,317 INFO L273 TraceCheckUtils]: 10: Hoare triple {9993#(<= 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; {9994#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:09,318 INFO L273 TraceCheckUtils]: 11: Hoare triple {9994#(<= 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; {9995#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:09,319 INFO L273 TraceCheckUtils]: 12: Hoare triple {9995#(<= 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; {9996#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:09,320 INFO L273 TraceCheckUtils]: 13: Hoare triple {9996#(<= 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; {9997#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:09,321 INFO L273 TraceCheckUtils]: 14: Hoare triple {9997#(<= 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; {9998#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:09,322 INFO L273 TraceCheckUtils]: 15: Hoare triple {9998#(<= 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; {9999#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:09,323 INFO L273 TraceCheckUtils]: 16: Hoare triple {9999#(<= 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; {10000#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:09,324 INFO L273 TraceCheckUtils]: 17: Hoare triple {10000#(<= 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; {10001#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:09,325 INFO L273 TraceCheckUtils]: 18: Hoare triple {10001#(<= 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; {10002#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:09,325 INFO L273 TraceCheckUtils]: 19: Hoare triple {10002#(<= main_~i~0 13)} assume !(~i~0 < 100000); {9988#false} is VALID [2018-11-23 12:05:09,325 INFO L273 TraceCheckUtils]: 20: Hoare triple {9988#false} ~i~0 := 0; {9988#false} is VALID [2018-11-23 12:05:09,326 INFO L273 TraceCheckUtils]: 21: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,326 INFO L273 TraceCheckUtils]: 22: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,326 INFO L273 TraceCheckUtils]: 23: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,326 INFO L273 TraceCheckUtils]: 24: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,326 INFO L273 TraceCheckUtils]: 25: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,327 INFO L273 TraceCheckUtils]: 26: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,327 INFO L273 TraceCheckUtils]: 27: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,327 INFO L273 TraceCheckUtils]: 28: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,327 INFO L273 TraceCheckUtils]: 29: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,328 INFO L273 TraceCheckUtils]: 30: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,328 INFO L273 TraceCheckUtils]: 31: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,328 INFO L273 TraceCheckUtils]: 32: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,328 INFO L273 TraceCheckUtils]: 33: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,328 INFO L273 TraceCheckUtils]: 34: Hoare triple {9988#false} assume !(~i~0 < 100000); {9988#false} is VALID [2018-11-23 12:05:09,329 INFO L273 TraceCheckUtils]: 35: Hoare triple {9988#false} ~i~0 := 0; {9988#false} is VALID [2018-11-23 12:05:09,329 INFO L273 TraceCheckUtils]: 36: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,329 INFO L273 TraceCheckUtils]: 37: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,329 INFO L273 TraceCheckUtils]: 38: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,329 INFO L273 TraceCheckUtils]: 39: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,330 INFO L273 TraceCheckUtils]: 40: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,330 INFO L273 TraceCheckUtils]: 41: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,330 INFO L273 TraceCheckUtils]: 42: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,330 INFO L273 TraceCheckUtils]: 43: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,330 INFO L273 TraceCheckUtils]: 44: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,330 INFO L273 TraceCheckUtils]: 45: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,330 INFO L273 TraceCheckUtils]: 46: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,331 INFO L273 TraceCheckUtils]: 47: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,331 INFO L273 TraceCheckUtils]: 48: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,331 INFO L273 TraceCheckUtils]: 49: Hoare triple {9988#false} assume !(~i~0 < 100000); {9988#false} is VALID [2018-11-23 12:05:09,331 INFO L273 TraceCheckUtils]: 50: Hoare triple {9988#false} ~i~0 := 0; {9988#false} is VALID [2018-11-23 12:05:09,331 INFO L273 TraceCheckUtils]: 51: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,331 INFO L273 TraceCheckUtils]: 52: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,331 INFO L273 TraceCheckUtils]: 53: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,331 INFO L273 TraceCheckUtils]: 54: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,331 INFO L273 TraceCheckUtils]: 55: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,332 INFO L273 TraceCheckUtils]: 56: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,332 INFO L273 TraceCheckUtils]: 57: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,332 INFO L273 TraceCheckUtils]: 58: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,332 INFO L273 TraceCheckUtils]: 59: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,332 INFO L273 TraceCheckUtils]: 60: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,332 INFO L273 TraceCheckUtils]: 61: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,332 INFO L273 TraceCheckUtils]: 62: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,332 INFO L273 TraceCheckUtils]: 63: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,332 INFO L273 TraceCheckUtils]: 64: Hoare triple {9988#false} assume !(~i~0 < 100000); {9988#false} is VALID [2018-11-23 12:05:09,333 INFO L273 TraceCheckUtils]: 65: Hoare triple {9988#false} ~i~0 := 0; {9988#false} is VALID [2018-11-23 12:05:09,333 INFO L273 TraceCheckUtils]: 66: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,333 INFO L273 TraceCheckUtils]: 67: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,333 INFO L273 TraceCheckUtils]: 68: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,333 INFO L273 TraceCheckUtils]: 69: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,333 INFO L273 TraceCheckUtils]: 70: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,333 INFO L273 TraceCheckUtils]: 71: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,333 INFO L273 TraceCheckUtils]: 72: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,334 INFO L273 TraceCheckUtils]: 73: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,334 INFO L273 TraceCheckUtils]: 74: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,334 INFO L273 TraceCheckUtils]: 75: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,334 INFO L273 TraceCheckUtils]: 76: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,334 INFO L273 TraceCheckUtils]: 77: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,334 INFO L273 TraceCheckUtils]: 78: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,334 INFO L273 TraceCheckUtils]: 79: Hoare triple {9988#false} assume !(~i~0 < 100000); {9988#false} is VALID [2018-11-23 12:05:09,334 INFO L273 TraceCheckUtils]: 80: Hoare triple {9988#false} ~i~0 := 0; {9988#false} is VALID [2018-11-23 12:05:09,334 INFO L273 TraceCheckUtils]: 81: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,335 INFO L273 TraceCheckUtils]: 82: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,335 INFO L273 TraceCheckUtils]: 83: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,335 INFO L273 TraceCheckUtils]: 84: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,335 INFO L273 TraceCheckUtils]: 85: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,335 INFO L273 TraceCheckUtils]: 86: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,335 INFO L273 TraceCheckUtils]: 87: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,335 INFO L273 TraceCheckUtils]: 88: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,335 INFO L273 TraceCheckUtils]: 89: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,335 INFO L273 TraceCheckUtils]: 90: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,336 INFO L273 TraceCheckUtils]: 91: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,336 INFO L273 TraceCheckUtils]: 92: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,336 INFO L273 TraceCheckUtils]: 93: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,336 INFO L273 TraceCheckUtils]: 94: Hoare triple {9988#false} assume !(~i~0 < 100000); {9988#false} is VALID [2018-11-23 12:05:09,336 INFO L273 TraceCheckUtils]: 95: Hoare triple {9988#false} ~i~0 := 0; {9988#false} is VALID [2018-11-23 12:05:09,336 INFO L273 TraceCheckUtils]: 96: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,336 INFO L273 TraceCheckUtils]: 97: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,336 INFO L273 TraceCheckUtils]: 98: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,337 INFO L273 TraceCheckUtils]: 99: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,337 INFO L273 TraceCheckUtils]: 100: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,337 INFO L273 TraceCheckUtils]: 101: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,337 INFO L273 TraceCheckUtils]: 102: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,337 INFO L273 TraceCheckUtils]: 103: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,337 INFO L273 TraceCheckUtils]: 104: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,337 INFO L273 TraceCheckUtils]: 105: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,337 INFO L273 TraceCheckUtils]: 106: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,337 INFO L273 TraceCheckUtils]: 107: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,338 INFO L273 TraceCheckUtils]: 108: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,338 INFO L273 TraceCheckUtils]: 109: Hoare triple {9988#false} assume !(~i~0 < 100000); {9988#false} is VALID [2018-11-23 12:05:09,338 INFO L273 TraceCheckUtils]: 110: Hoare triple {9988#false} havoc ~x~0;~x~0 := 0; {9988#false} is VALID [2018-11-23 12:05:09,338 INFO L273 TraceCheckUtils]: 111: Hoare triple {9988#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9988#false} is VALID [2018-11-23 12:05:09,338 INFO L256 TraceCheckUtils]: 112: Hoare triple {9988#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {9988#false} is VALID [2018-11-23 12:05:09,338 INFO L273 TraceCheckUtils]: 113: Hoare triple {9988#false} ~cond := #in~cond; {9988#false} is VALID [2018-11-23 12:05:09,338 INFO L273 TraceCheckUtils]: 114: Hoare triple {9988#false} assume 0 == ~cond; {9988#false} is VALID [2018-11-23 12:05:09,338 INFO L273 TraceCheckUtils]: 115: Hoare triple {9988#false} assume !false; {9988#false} is VALID [2018-11-23 12:05:09,344 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2018-11-23 12:05:09,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:09,344 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:05:09,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:09,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:09,769 INFO L256 TraceCheckUtils]: 0: Hoare triple {9987#true} call ULTIMATE.init(); {9987#true} is VALID [2018-11-23 12:05:09,769 INFO L273 TraceCheckUtils]: 1: Hoare triple {9987#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9987#true} is VALID [2018-11-23 12:05:09,769 INFO L273 TraceCheckUtils]: 2: Hoare triple {9987#true} assume true; {9987#true} is VALID [2018-11-23 12:05:09,770 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9987#true} {9987#true} #126#return; {9987#true} is VALID [2018-11-23 12:05:09,770 INFO L256 TraceCheckUtils]: 4: Hoare triple {9987#true} call #t~ret2 := main(); {9987#true} is VALID [2018-11-23 12:05:09,771 INFO L273 TraceCheckUtils]: 5: Hoare triple {9987#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10021#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:09,772 INFO L273 TraceCheckUtils]: 6: Hoare triple {10021#(<= 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; {9990#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:09,772 INFO L273 TraceCheckUtils]: 7: Hoare triple {9990#(<= 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; {9991#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:09,773 INFO L273 TraceCheckUtils]: 8: Hoare triple {9991#(<= 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; {9992#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:09,773 INFO L273 TraceCheckUtils]: 9: Hoare triple {9992#(<= 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; {9993#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:09,774 INFO L273 TraceCheckUtils]: 10: Hoare triple {9993#(<= 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; {9994#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:09,775 INFO L273 TraceCheckUtils]: 11: Hoare triple {9994#(<= 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; {9995#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:09,776 INFO L273 TraceCheckUtils]: 12: Hoare triple {9995#(<= 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; {9996#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:09,777 INFO L273 TraceCheckUtils]: 13: Hoare triple {9996#(<= 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; {9997#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:09,778 INFO L273 TraceCheckUtils]: 14: Hoare triple {9997#(<= 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; {9998#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:09,779 INFO L273 TraceCheckUtils]: 15: Hoare triple {9998#(<= 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; {9999#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:09,780 INFO L273 TraceCheckUtils]: 16: Hoare triple {9999#(<= 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; {10000#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:09,781 INFO L273 TraceCheckUtils]: 17: Hoare triple {10000#(<= 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; {10001#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:09,782 INFO L273 TraceCheckUtils]: 18: Hoare triple {10001#(<= 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; {10002#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:09,782 INFO L273 TraceCheckUtils]: 19: Hoare triple {10002#(<= main_~i~0 13)} assume !(~i~0 < 100000); {9988#false} is VALID [2018-11-23 12:05:09,783 INFO L273 TraceCheckUtils]: 20: Hoare triple {9988#false} ~i~0 := 0; {9988#false} is VALID [2018-11-23 12:05:09,783 INFO L273 TraceCheckUtils]: 21: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,783 INFO L273 TraceCheckUtils]: 22: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,783 INFO L273 TraceCheckUtils]: 23: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,783 INFO L273 TraceCheckUtils]: 24: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,784 INFO L273 TraceCheckUtils]: 25: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,784 INFO L273 TraceCheckUtils]: 26: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,784 INFO L273 TraceCheckUtils]: 27: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,784 INFO L273 TraceCheckUtils]: 28: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,784 INFO L273 TraceCheckUtils]: 29: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,785 INFO L273 TraceCheckUtils]: 30: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,785 INFO L273 TraceCheckUtils]: 31: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,785 INFO L273 TraceCheckUtils]: 32: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,785 INFO L273 TraceCheckUtils]: 33: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,785 INFO L273 TraceCheckUtils]: 34: Hoare triple {9988#false} assume !(~i~0 < 100000); {9988#false} is VALID [2018-11-23 12:05:09,786 INFO L273 TraceCheckUtils]: 35: Hoare triple {9988#false} ~i~0 := 0; {9988#false} is VALID [2018-11-23 12:05:09,786 INFO L273 TraceCheckUtils]: 36: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,786 INFO L273 TraceCheckUtils]: 37: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,786 INFO L273 TraceCheckUtils]: 38: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,786 INFO L273 TraceCheckUtils]: 39: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,787 INFO L273 TraceCheckUtils]: 40: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,787 INFO L273 TraceCheckUtils]: 41: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,787 INFO L273 TraceCheckUtils]: 42: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,787 INFO L273 TraceCheckUtils]: 43: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,787 INFO L273 TraceCheckUtils]: 44: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,787 INFO L273 TraceCheckUtils]: 45: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,787 INFO L273 TraceCheckUtils]: 46: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,787 INFO L273 TraceCheckUtils]: 47: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,788 INFO L273 TraceCheckUtils]: 48: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,788 INFO L273 TraceCheckUtils]: 49: Hoare triple {9988#false} assume !(~i~0 < 100000); {9988#false} is VALID [2018-11-23 12:05:09,788 INFO L273 TraceCheckUtils]: 50: Hoare triple {9988#false} ~i~0 := 0; {9988#false} is VALID [2018-11-23 12:05:09,788 INFO L273 TraceCheckUtils]: 51: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,788 INFO L273 TraceCheckUtils]: 52: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,788 INFO L273 TraceCheckUtils]: 53: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,788 INFO L273 TraceCheckUtils]: 54: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,788 INFO L273 TraceCheckUtils]: 55: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,789 INFO L273 TraceCheckUtils]: 56: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,789 INFO L273 TraceCheckUtils]: 57: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,789 INFO L273 TraceCheckUtils]: 58: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,789 INFO L273 TraceCheckUtils]: 59: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,789 INFO L273 TraceCheckUtils]: 60: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,789 INFO L273 TraceCheckUtils]: 61: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,789 INFO L273 TraceCheckUtils]: 62: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,789 INFO L273 TraceCheckUtils]: 63: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,789 INFO L273 TraceCheckUtils]: 64: Hoare triple {9988#false} assume !(~i~0 < 100000); {9988#false} is VALID [2018-11-23 12:05:09,790 INFO L273 TraceCheckUtils]: 65: Hoare triple {9988#false} ~i~0 := 0; {9988#false} is VALID [2018-11-23 12:05:09,790 INFO L273 TraceCheckUtils]: 66: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,790 INFO L273 TraceCheckUtils]: 67: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,790 INFO L273 TraceCheckUtils]: 68: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,790 INFO L273 TraceCheckUtils]: 69: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,790 INFO L273 TraceCheckUtils]: 70: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,790 INFO L273 TraceCheckUtils]: 71: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,790 INFO L273 TraceCheckUtils]: 72: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,790 INFO L273 TraceCheckUtils]: 73: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,791 INFO L273 TraceCheckUtils]: 74: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,791 INFO L273 TraceCheckUtils]: 75: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,791 INFO L273 TraceCheckUtils]: 76: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,791 INFO L273 TraceCheckUtils]: 77: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,791 INFO L273 TraceCheckUtils]: 78: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,791 INFO L273 TraceCheckUtils]: 79: Hoare triple {9988#false} assume !(~i~0 < 100000); {9988#false} is VALID [2018-11-23 12:05:09,791 INFO L273 TraceCheckUtils]: 80: Hoare triple {9988#false} ~i~0 := 0; {9988#false} is VALID [2018-11-23 12:05:09,791 INFO L273 TraceCheckUtils]: 81: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,791 INFO L273 TraceCheckUtils]: 82: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,792 INFO L273 TraceCheckUtils]: 83: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,792 INFO L273 TraceCheckUtils]: 84: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,792 INFO L273 TraceCheckUtils]: 85: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,792 INFO L273 TraceCheckUtils]: 86: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,792 INFO L273 TraceCheckUtils]: 87: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,792 INFO L273 TraceCheckUtils]: 88: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,792 INFO L273 TraceCheckUtils]: 89: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,792 INFO L273 TraceCheckUtils]: 90: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,793 INFO L273 TraceCheckUtils]: 91: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,793 INFO L273 TraceCheckUtils]: 92: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,793 INFO L273 TraceCheckUtils]: 93: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,793 INFO L273 TraceCheckUtils]: 94: Hoare triple {9988#false} assume !(~i~0 < 100000); {9988#false} is VALID [2018-11-23 12:05:09,793 INFO L273 TraceCheckUtils]: 95: Hoare triple {9988#false} ~i~0 := 0; {9988#false} is VALID [2018-11-23 12:05:09,793 INFO L273 TraceCheckUtils]: 96: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,793 INFO L273 TraceCheckUtils]: 97: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,793 INFO L273 TraceCheckUtils]: 98: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,793 INFO L273 TraceCheckUtils]: 99: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,794 INFO L273 TraceCheckUtils]: 100: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,794 INFO L273 TraceCheckUtils]: 101: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,794 INFO L273 TraceCheckUtils]: 102: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,794 INFO L273 TraceCheckUtils]: 103: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,794 INFO L273 TraceCheckUtils]: 104: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,794 INFO L273 TraceCheckUtils]: 105: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,794 INFO L273 TraceCheckUtils]: 106: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,794 INFO L273 TraceCheckUtils]: 107: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,794 INFO L273 TraceCheckUtils]: 108: Hoare triple {9988#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9988#false} is VALID [2018-11-23 12:05:09,795 INFO L273 TraceCheckUtils]: 109: Hoare triple {9988#false} assume !(~i~0 < 100000); {9988#false} is VALID [2018-11-23 12:05:09,795 INFO L273 TraceCheckUtils]: 110: Hoare triple {9988#false} havoc ~x~0;~x~0 := 0; {9988#false} is VALID [2018-11-23 12:05:09,795 INFO L273 TraceCheckUtils]: 111: Hoare triple {9988#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9988#false} is VALID [2018-11-23 12:05:09,795 INFO L256 TraceCheckUtils]: 112: Hoare triple {9988#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {9988#false} is VALID [2018-11-23 12:05:09,795 INFO L273 TraceCheckUtils]: 113: Hoare triple {9988#false} ~cond := #in~cond; {9988#false} is VALID [2018-11-23 12:05:09,795 INFO L273 TraceCheckUtils]: 114: Hoare triple {9988#false} assume 0 == ~cond; {9988#false} is VALID [2018-11-23 12:05:09,795 INFO L273 TraceCheckUtils]: 115: Hoare triple {9988#false} assume !false; {9988#false} is VALID [2018-11-23 12:05:09,801 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2018-11-23 12:05:09,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:09,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:05:09,821 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 116 [2018-11-23 12:05:09,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:09,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:05:09,856 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:09,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:05:09,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:05:09,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:05:09,858 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 17 states. [2018-11-23 12:05:10,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:10,855 INFO L93 Difference]: Finished difference Result 229 states and 249 transitions. [2018-11-23 12:05:10,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:05:10,855 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 116 [2018-11-23 12:05:10,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:10,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:05:10,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 171 transitions. [2018-11-23 12:05:10,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:05:10,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 171 transitions. [2018-11-23 12:05:10,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 171 transitions. [2018-11-23 12:05:11,154 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:11,156 INFO L225 Difference]: With dead ends: 229 [2018-11-23 12:05:11,156 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 12:05:11,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:05:11,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 12:05:11,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-11-23 12:05:11,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:11,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 128 states. [2018-11-23 12:05:11,293 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 128 states. [2018-11-23 12:05:11,293 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 128 states. [2018-11-23 12:05:11,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:11,295 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2018-11-23 12:05:11,295 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions. [2018-11-23 12:05:11,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:11,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:11,296 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 128 states. [2018-11-23 12:05:11,296 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 128 states. [2018-11-23 12:05:11,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:11,298 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2018-11-23 12:05:11,298 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions. [2018-11-23 12:05:11,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:11,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:11,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:11,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:11,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-23 12:05:11,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 135 transitions. [2018-11-23 12:05:11,300 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 135 transitions. Word has length 116 [2018-11-23 12:05:11,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:11,301 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 135 transitions. [2018-11-23 12:05:11,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:05:11,301 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions. [2018-11-23 12:05:11,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-23 12:05:11,302 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:11,302 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:11,302 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:11,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:11,302 INFO L82 PathProgramCache]: Analyzing trace with hash 108084330, now seen corresponding path program 14 times [2018-11-23 12:05:11,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:11,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:11,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:11,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:11,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:11,895 INFO L256 TraceCheckUtils]: 0: Hoare triple {11275#true} call ULTIMATE.init(); {11275#true} is VALID [2018-11-23 12:05:11,896 INFO L273 TraceCheckUtils]: 1: Hoare triple {11275#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11275#true} is VALID [2018-11-23 12:05:11,896 INFO L273 TraceCheckUtils]: 2: Hoare triple {11275#true} assume true; {11275#true} is VALID [2018-11-23 12:05:11,896 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11275#true} {11275#true} #126#return; {11275#true} is VALID [2018-11-23 12:05:11,896 INFO L256 TraceCheckUtils]: 4: Hoare triple {11275#true} call #t~ret2 := main(); {11275#true} is VALID [2018-11-23 12:05:11,897 INFO L273 TraceCheckUtils]: 5: Hoare triple {11275#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11277#(= main_~i~0 0)} is VALID [2018-11-23 12:05:11,898 INFO L273 TraceCheckUtils]: 6: Hoare triple {11277#(= 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; {11278#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:11,898 INFO L273 TraceCheckUtils]: 7: Hoare triple {11278#(<= 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; {11279#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:11,899 INFO L273 TraceCheckUtils]: 8: Hoare triple {11279#(<= 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; {11280#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:11,900 INFO L273 TraceCheckUtils]: 9: Hoare triple {11280#(<= 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; {11281#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:11,900 INFO L273 TraceCheckUtils]: 10: Hoare triple {11281#(<= 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; {11282#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:11,901 INFO L273 TraceCheckUtils]: 11: Hoare triple {11282#(<= 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; {11283#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:11,902 INFO L273 TraceCheckUtils]: 12: Hoare triple {11283#(<= 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; {11284#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:11,903 INFO L273 TraceCheckUtils]: 13: Hoare triple {11284#(<= 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; {11285#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:11,904 INFO L273 TraceCheckUtils]: 14: Hoare triple {11285#(<= 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; {11286#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:11,905 INFO L273 TraceCheckUtils]: 15: Hoare triple {11286#(<= 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; {11287#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:11,906 INFO L273 TraceCheckUtils]: 16: Hoare triple {11287#(<= 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; {11288#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:11,907 INFO L273 TraceCheckUtils]: 17: Hoare triple {11288#(<= 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; {11289#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:11,908 INFO L273 TraceCheckUtils]: 18: Hoare triple {11289#(<= 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; {11290#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:11,909 INFO L273 TraceCheckUtils]: 19: Hoare triple {11290#(<= 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; {11291#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:11,910 INFO L273 TraceCheckUtils]: 20: Hoare triple {11291#(<= main_~i~0 14)} assume !(~i~0 < 100000); {11276#false} is VALID [2018-11-23 12:05:11,910 INFO L273 TraceCheckUtils]: 21: Hoare triple {11276#false} ~i~0 := 0; {11276#false} is VALID [2018-11-23 12:05:11,910 INFO L273 TraceCheckUtils]: 22: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,910 INFO L273 TraceCheckUtils]: 23: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,910 INFO L273 TraceCheckUtils]: 24: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,911 INFO L273 TraceCheckUtils]: 25: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,911 INFO L273 TraceCheckUtils]: 26: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,911 INFO L273 TraceCheckUtils]: 27: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,912 INFO L273 TraceCheckUtils]: 28: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,912 INFO L273 TraceCheckUtils]: 29: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,912 INFO L273 TraceCheckUtils]: 30: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,912 INFO L273 TraceCheckUtils]: 31: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,913 INFO L273 TraceCheckUtils]: 32: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,913 INFO L273 TraceCheckUtils]: 33: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,913 INFO L273 TraceCheckUtils]: 34: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,913 INFO L273 TraceCheckUtils]: 35: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,914 INFO L273 TraceCheckUtils]: 36: Hoare triple {11276#false} assume !(~i~0 < 100000); {11276#false} is VALID [2018-11-23 12:05:11,914 INFO L273 TraceCheckUtils]: 37: Hoare triple {11276#false} ~i~0 := 0; {11276#false} is VALID [2018-11-23 12:05:11,914 INFO L273 TraceCheckUtils]: 38: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,914 INFO L273 TraceCheckUtils]: 39: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,914 INFO L273 TraceCheckUtils]: 40: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,914 INFO L273 TraceCheckUtils]: 41: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,915 INFO L273 TraceCheckUtils]: 42: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,915 INFO L273 TraceCheckUtils]: 43: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,915 INFO L273 TraceCheckUtils]: 44: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,915 INFO L273 TraceCheckUtils]: 45: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,915 INFO L273 TraceCheckUtils]: 46: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,915 INFO L273 TraceCheckUtils]: 47: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,916 INFO L273 TraceCheckUtils]: 48: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,916 INFO L273 TraceCheckUtils]: 49: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,916 INFO L273 TraceCheckUtils]: 50: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,916 INFO L273 TraceCheckUtils]: 51: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,916 INFO L273 TraceCheckUtils]: 52: Hoare triple {11276#false} assume !(~i~0 < 100000); {11276#false} is VALID [2018-11-23 12:05:11,916 INFO L273 TraceCheckUtils]: 53: Hoare triple {11276#false} ~i~0 := 0; {11276#false} is VALID [2018-11-23 12:05:11,917 INFO L273 TraceCheckUtils]: 54: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,917 INFO L273 TraceCheckUtils]: 55: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,917 INFO L273 TraceCheckUtils]: 56: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,917 INFO L273 TraceCheckUtils]: 57: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,917 INFO L273 TraceCheckUtils]: 58: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,917 INFO L273 TraceCheckUtils]: 59: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,918 INFO L273 TraceCheckUtils]: 60: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,918 INFO L273 TraceCheckUtils]: 61: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,918 INFO L273 TraceCheckUtils]: 62: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,918 INFO L273 TraceCheckUtils]: 63: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,918 INFO L273 TraceCheckUtils]: 64: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,918 INFO L273 TraceCheckUtils]: 65: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,919 INFO L273 TraceCheckUtils]: 66: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,919 INFO L273 TraceCheckUtils]: 67: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,919 INFO L273 TraceCheckUtils]: 68: Hoare triple {11276#false} assume !(~i~0 < 100000); {11276#false} is VALID [2018-11-23 12:05:11,919 INFO L273 TraceCheckUtils]: 69: Hoare triple {11276#false} ~i~0 := 0; {11276#false} is VALID [2018-11-23 12:05:11,919 INFO L273 TraceCheckUtils]: 70: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,919 INFO L273 TraceCheckUtils]: 71: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,920 INFO L273 TraceCheckUtils]: 72: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,920 INFO L273 TraceCheckUtils]: 73: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,920 INFO L273 TraceCheckUtils]: 74: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,920 INFO L273 TraceCheckUtils]: 75: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,920 INFO L273 TraceCheckUtils]: 76: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,920 INFO L273 TraceCheckUtils]: 77: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,921 INFO L273 TraceCheckUtils]: 78: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,921 INFO L273 TraceCheckUtils]: 79: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,921 INFO L273 TraceCheckUtils]: 80: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,921 INFO L273 TraceCheckUtils]: 81: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,921 INFO L273 TraceCheckUtils]: 82: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,921 INFO L273 TraceCheckUtils]: 83: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,921 INFO L273 TraceCheckUtils]: 84: Hoare triple {11276#false} assume !(~i~0 < 100000); {11276#false} is VALID [2018-11-23 12:05:11,922 INFO L273 TraceCheckUtils]: 85: Hoare triple {11276#false} ~i~0 := 0; {11276#false} is VALID [2018-11-23 12:05:11,922 INFO L273 TraceCheckUtils]: 86: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,922 INFO L273 TraceCheckUtils]: 87: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,922 INFO L273 TraceCheckUtils]: 88: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,922 INFO L273 TraceCheckUtils]: 89: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,922 INFO L273 TraceCheckUtils]: 90: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,923 INFO L273 TraceCheckUtils]: 91: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,923 INFO L273 TraceCheckUtils]: 92: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,923 INFO L273 TraceCheckUtils]: 93: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,923 INFO L273 TraceCheckUtils]: 94: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,923 INFO L273 TraceCheckUtils]: 95: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,923 INFO L273 TraceCheckUtils]: 96: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,924 INFO L273 TraceCheckUtils]: 97: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,924 INFO L273 TraceCheckUtils]: 98: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,924 INFO L273 TraceCheckUtils]: 99: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,924 INFO L273 TraceCheckUtils]: 100: Hoare triple {11276#false} assume !(~i~0 < 100000); {11276#false} is VALID [2018-11-23 12:05:11,924 INFO L273 TraceCheckUtils]: 101: Hoare triple {11276#false} ~i~0 := 0; {11276#false} is VALID [2018-11-23 12:05:11,924 INFO L273 TraceCheckUtils]: 102: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,925 INFO L273 TraceCheckUtils]: 103: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,925 INFO L273 TraceCheckUtils]: 104: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,925 INFO L273 TraceCheckUtils]: 105: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,925 INFO L273 TraceCheckUtils]: 106: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,925 INFO L273 TraceCheckUtils]: 107: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,925 INFO L273 TraceCheckUtils]: 108: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,925 INFO L273 TraceCheckUtils]: 109: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,926 INFO L273 TraceCheckUtils]: 110: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,926 INFO L273 TraceCheckUtils]: 111: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,926 INFO L273 TraceCheckUtils]: 112: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,926 INFO L273 TraceCheckUtils]: 113: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,926 INFO L273 TraceCheckUtils]: 114: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,926 INFO L273 TraceCheckUtils]: 115: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:11,927 INFO L273 TraceCheckUtils]: 116: Hoare triple {11276#false} assume !(~i~0 < 100000); {11276#false} is VALID [2018-11-23 12:05:11,927 INFO L273 TraceCheckUtils]: 117: Hoare triple {11276#false} havoc ~x~0;~x~0 := 0; {11276#false} is VALID [2018-11-23 12:05:11,927 INFO L273 TraceCheckUtils]: 118: Hoare triple {11276#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11276#false} is VALID [2018-11-23 12:05:11,927 INFO L256 TraceCheckUtils]: 119: Hoare triple {11276#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {11276#false} is VALID [2018-11-23 12:05:11,927 INFO L273 TraceCheckUtils]: 120: Hoare triple {11276#false} ~cond := #in~cond; {11276#false} is VALID [2018-11-23 12:05:11,927 INFO L273 TraceCheckUtils]: 121: Hoare triple {11276#false} assume 0 == ~cond; {11276#false} is VALID [2018-11-23 12:05:11,928 INFO L273 TraceCheckUtils]: 122: Hoare triple {11276#false} assume !false; {11276#false} is VALID [2018-11-23 12:05:11,935 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-11-23 12:05:11,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:11,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 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:05:11,944 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:05:12,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:05:12,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:12,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:12,237 INFO L256 TraceCheckUtils]: 0: Hoare triple {11275#true} call ULTIMATE.init(); {11275#true} is VALID [2018-11-23 12:05:12,238 INFO L273 TraceCheckUtils]: 1: Hoare triple {11275#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11275#true} is VALID [2018-11-23 12:05:12,238 INFO L273 TraceCheckUtils]: 2: Hoare triple {11275#true} assume true; {11275#true} is VALID [2018-11-23 12:05:12,238 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11275#true} {11275#true} #126#return; {11275#true} is VALID [2018-11-23 12:05:12,238 INFO L256 TraceCheckUtils]: 4: Hoare triple {11275#true} call #t~ret2 := main(); {11275#true} is VALID [2018-11-23 12:05:12,239 INFO L273 TraceCheckUtils]: 5: Hoare triple {11275#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11310#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:12,240 INFO L273 TraceCheckUtils]: 6: Hoare triple {11310#(<= 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; {11278#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:12,240 INFO L273 TraceCheckUtils]: 7: Hoare triple {11278#(<= 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; {11279#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:12,241 INFO L273 TraceCheckUtils]: 8: Hoare triple {11279#(<= 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; {11280#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:12,242 INFO L273 TraceCheckUtils]: 9: Hoare triple {11280#(<= 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; {11281#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:12,242 INFO L273 TraceCheckUtils]: 10: Hoare triple {11281#(<= 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; {11282#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:12,243 INFO L273 TraceCheckUtils]: 11: Hoare triple {11282#(<= 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; {11283#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:12,244 INFO L273 TraceCheckUtils]: 12: Hoare triple {11283#(<= 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; {11284#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:12,245 INFO L273 TraceCheckUtils]: 13: Hoare triple {11284#(<= 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; {11285#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:12,246 INFO L273 TraceCheckUtils]: 14: Hoare triple {11285#(<= 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; {11286#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:12,247 INFO L273 TraceCheckUtils]: 15: Hoare triple {11286#(<= 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; {11287#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:12,247 INFO L273 TraceCheckUtils]: 16: Hoare triple {11287#(<= 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; {11288#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:12,248 INFO L273 TraceCheckUtils]: 17: Hoare triple {11288#(<= 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; {11289#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:12,249 INFO L273 TraceCheckUtils]: 18: Hoare triple {11289#(<= 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; {11290#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:12,250 INFO L273 TraceCheckUtils]: 19: Hoare triple {11290#(<= 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; {11291#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:12,251 INFO L273 TraceCheckUtils]: 20: Hoare triple {11291#(<= main_~i~0 14)} assume !(~i~0 < 100000); {11276#false} is VALID [2018-11-23 12:05:12,251 INFO L273 TraceCheckUtils]: 21: Hoare triple {11276#false} ~i~0 := 0; {11276#false} is VALID [2018-11-23 12:05:12,251 INFO L273 TraceCheckUtils]: 22: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,252 INFO L273 TraceCheckUtils]: 23: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,252 INFO L273 TraceCheckUtils]: 24: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,252 INFO L273 TraceCheckUtils]: 25: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,252 INFO L273 TraceCheckUtils]: 26: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,252 INFO L273 TraceCheckUtils]: 27: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,253 INFO L273 TraceCheckUtils]: 28: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,253 INFO L273 TraceCheckUtils]: 29: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,253 INFO L273 TraceCheckUtils]: 30: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,253 INFO L273 TraceCheckUtils]: 31: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,253 INFO L273 TraceCheckUtils]: 32: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,254 INFO L273 TraceCheckUtils]: 33: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,254 INFO L273 TraceCheckUtils]: 34: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,254 INFO L273 TraceCheckUtils]: 35: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,254 INFO L273 TraceCheckUtils]: 36: Hoare triple {11276#false} assume !(~i~0 < 100000); {11276#false} is VALID [2018-11-23 12:05:12,254 INFO L273 TraceCheckUtils]: 37: Hoare triple {11276#false} ~i~0 := 0; {11276#false} is VALID [2018-11-23 12:05:12,255 INFO L273 TraceCheckUtils]: 38: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,255 INFO L273 TraceCheckUtils]: 39: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,255 INFO L273 TraceCheckUtils]: 40: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,255 INFO L273 TraceCheckUtils]: 41: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,255 INFO L273 TraceCheckUtils]: 42: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,255 INFO L273 TraceCheckUtils]: 43: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,255 INFO L273 TraceCheckUtils]: 44: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,255 INFO L273 TraceCheckUtils]: 45: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,255 INFO L273 TraceCheckUtils]: 46: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,256 INFO L273 TraceCheckUtils]: 47: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,256 INFO L273 TraceCheckUtils]: 48: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,256 INFO L273 TraceCheckUtils]: 49: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,256 INFO L273 TraceCheckUtils]: 50: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,256 INFO L273 TraceCheckUtils]: 51: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,256 INFO L273 TraceCheckUtils]: 52: Hoare triple {11276#false} assume !(~i~0 < 100000); {11276#false} is VALID [2018-11-23 12:05:12,256 INFO L273 TraceCheckUtils]: 53: Hoare triple {11276#false} ~i~0 := 0; {11276#false} is VALID [2018-11-23 12:05:12,256 INFO L273 TraceCheckUtils]: 54: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,256 INFO L273 TraceCheckUtils]: 55: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,257 INFO L273 TraceCheckUtils]: 56: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,257 INFO L273 TraceCheckUtils]: 57: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,257 INFO L273 TraceCheckUtils]: 58: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,257 INFO L273 TraceCheckUtils]: 59: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,257 INFO L273 TraceCheckUtils]: 60: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,257 INFO L273 TraceCheckUtils]: 61: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,257 INFO L273 TraceCheckUtils]: 62: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,257 INFO L273 TraceCheckUtils]: 63: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,257 INFO L273 TraceCheckUtils]: 64: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,258 INFO L273 TraceCheckUtils]: 65: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,258 INFO L273 TraceCheckUtils]: 66: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,258 INFO L273 TraceCheckUtils]: 67: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,258 INFO L273 TraceCheckUtils]: 68: Hoare triple {11276#false} assume !(~i~0 < 100000); {11276#false} is VALID [2018-11-23 12:05:12,258 INFO L273 TraceCheckUtils]: 69: Hoare triple {11276#false} ~i~0 := 0; {11276#false} is VALID [2018-11-23 12:05:12,258 INFO L273 TraceCheckUtils]: 70: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,258 INFO L273 TraceCheckUtils]: 71: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,258 INFO L273 TraceCheckUtils]: 72: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,258 INFO L273 TraceCheckUtils]: 73: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,259 INFO L273 TraceCheckUtils]: 74: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,259 INFO L273 TraceCheckUtils]: 75: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,259 INFO L273 TraceCheckUtils]: 76: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,259 INFO L273 TraceCheckUtils]: 77: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,259 INFO L273 TraceCheckUtils]: 78: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,259 INFO L273 TraceCheckUtils]: 79: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,259 INFO L273 TraceCheckUtils]: 80: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,259 INFO L273 TraceCheckUtils]: 81: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,259 INFO L273 TraceCheckUtils]: 82: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,260 INFO L273 TraceCheckUtils]: 83: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,260 INFO L273 TraceCheckUtils]: 84: Hoare triple {11276#false} assume !(~i~0 < 100000); {11276#false} is VALID [2018-11-23 12:05:12,260 INFO L273 TraceCheckUtils]: 85: Hoare triple {11276#false} ~i~0 := 0; {11276#false} is VALID [2018-11-23 12:05:12,260 INFO L273 TraceCheckUtils]: 86: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,260 INFO L273 TraceCheckUtils]: 87: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,260 INFO L273 TraceCheckUtils]: 88: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,260 INFO L273 TraceCheckUtils]: 89: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,260 INFO L273 TraceCheckUtils]: 90: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,261 INFO L273 TraceCheckUtils]: 91: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,261 INFO L273 TraceCheckUtils]: 92: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,261 INFO L273 TraceCheckUtils]: 93: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,261 INFO L273 TraceCheckUtils]: 94: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,261 INFO L273 TraceCheckUtils]: 95: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,261 INFO L273 TraceCheckUtils]: 96: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,261 INFO L273 TraceCheckUtils]: 97: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,261 INFO L273 TraceCheckUtils]: 98: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,261 INFO L273 TraceCheckUtils]: 99: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,262 INFO L273 TraceCheckUtils]: 100: Hoare triple {11276#false} assume !(~i~0 < 100000); {11276#false} is VALID [2018-11-23 12:05:12,262 INFO L273 TraceCheckUtils]: 101: Hoare triple {11276#false} ~i~0 := 0; {11276#false} is VALID [2018-11-23 12:05:12,262 INFO L273 TraceCheckUtils]: 102: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,262 INFO L273 TraceCheckUtils]: 103: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,262 INFO L273 TraceCheckUtils]: 104: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,262 INFO L273 TraceCheckUtils]: 105: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,262 INFO L273 TraceCheckUtils]: 106: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,262 INFO L273 TraceCheckUtils]: 107: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,262 INFO L273 TraceCheckUtils]: 108: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,263 INFO L273 TraceCheckUtils]: 109: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,263 INFO L273 TraceCheckUtils]: 110: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,263 INFO L273 TraceCheckUtils]: 111: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,263 INFO L273 TraceCheckUtils]: 112: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,263 INFO L273 TraceCheckUtils]: 113: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,263 INFO L273 TraceCheckUtils]: 114: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,263 INFO L273 TraceCheckUtils]: 115: Hoare triple {11276#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11276#false} is VALID [2018-11-23 12:05:12,263 INFO L273 TraceCheckUtils]: 116: Hoare triple {11276#false} assume !(~i~0 < 100000); {11276#false} is VALID [2018-11-23 12:05:12,263 INFO L273 TraceCheckUtils]: 117: Hoare triple {11276#false} havoc ~x~0;~x~0 := 0; {11276#false} is VALID [2018-11-23 12:05:12,264 INFO L273 TraceCheckUtils]: 118: Hoare triple {11276#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11276#false} is VALID [2018-11-23 12:05:12,264 INFO L256 TraceCheckUtils]: 119: Hoare triple {11276#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {11276#false} is VALID [2018-11-23 12:05:12,264 INFO L273 TraceCheckUtils]: 120: Hoare triple {11276#false} ~cond := #in~cond; {11276#false} is VALID [2018-11-23 12:05:12,264 INFO L273 TraceCheckUtils]: 121: Hoare triple {11276#false} assume 0 == ~cond; {11276#false} is VALID [2018-11-23 12:05:12,264 INFO L273 TraceCheckUtils]: 122: Hoare triple {11276#false} assume !false; {11276#false} is VALID [2018-11-23 12:05:12,270 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-11-23 12:05:12,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:12,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:05:12,290 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 123 [2018-11-23 12:05:12,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:12,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:05:12,327 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:12,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:05:12,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:05:12,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:05:12,329 INFO L87 Difference]: Start difference. First operand 128 states and 135 transitions. Second operand 18 states. [2018-11-23 12:05:13,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:13,891 INFO L93 Difference]: Finished difference Result 242 states and 262 transitions. [2018-11-23 12:05:13,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:05:13,891 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 123 [2018-11-23 12:05:13,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:13,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:05:13,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 178 transitions. [2018-11-23 12:05:13,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:05:13,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 178 transitions. [2018-11-23 12:05:13,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 178 transitions. [2018-11-23 12:05:14,156 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:14,159 INFO L225 Difference]: With dead ends: 242 [2018-11-23 12:05:14,160 INFO L226 Difference]: Without dead ends: 135 [2018-11-23 12:05:14,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:05:14,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-23 12:05:15,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-11-23 12:05:15,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:15,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand 135 states. [2018-11-23 12:05:15,807 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 135 states. [2018-11-23 12:05:15,807 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 135 states. [2018-11-23 12:05:15,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:15,809 INFO L93 Difference]: Finished difference Result 135 states and 142 transitions. [2018-11-23 12:05:15,809 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2018-11-23 12:05:15,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:15,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:15,810 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 135 states. [2018-11-23 12:05:15,810 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 135 states. [2018-11-23 12:05:15,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:15,812 INFO L93 Difference]: Finished difference Result 135 states and 142 transitions. [2018-11-23 12:05:15,813 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2018-11-23 12:05:15,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:15,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:15,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:15,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:15,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 12:05:15,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 142 transitions. [2018-11-23 12:05:15,816 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 142 transitions. Word has length 123 [2018-11-23 12:05:15,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:15,816 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 142 transitions. [2018-11-23 12:05:15,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:05:15,816 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2018-11-23 12:05:15,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 12:05:15,817 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:15,818 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:15,818 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:15,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:15,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1972607623, now seen corresponding path program 15 times [2018-11-23 12:05:15,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:15,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:15,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:15,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:15,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:16,271 INFO L256 TraceCheckUtils]: 0: Hoare triple {12639#true} call ULTIMATE.init(); {12639#true} is VALID [2018-11-23 12:05:16,271 INFO L273 TraceCheckUtils]: 1: Hoare triple {12639#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12639#true} is VALID [2018-11-23 12:05:16,272 INFO L273 TraceCheckUtils]: 2: Hoare triple {12639#true} assume true; {12639#true} is VALID [2018-11-23 12:05:16,272 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12639#true} {12639#true} #126#return; {12639#true} is VALID [2018-11-23 12:05:16,272 INFO L256 TraceCheckUtils]: 4: Hoare triple {12639#true} call #t~ret2 := main(); {12639#true} is VALID [2018-11-23 12:05:16,273 INFO L273 TraceCheckUtils]: 5: Hoare triple {12639#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12641#(= main_~i~0 0)} is VALID [2018-11-23 12:05:16,274 INFO L273 TraceCheckUtils]: 6: Hoare triple {12641#(= 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; {12642#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:16,275 INFO L273 TraceCheckUtils]: 7: Hoare triple {12642#(<= 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; {12643#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:16,275 INFO L273 TraceCheckUtils]: 8: Hoare triple {12643#(<= 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; {12644#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:16,276 INFO L273 TraceCheckUtils]: 9: Hoare triple {12644#(<= 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; {12645#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:16,277 INFO L273 TraceCheckUtils]: 10: Hoare triple {12645#(<= 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; {12646#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:16,278 INFO L273 TraceCheckUtils]: 11: Hoare triple {12646#(<= 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; {12647#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:16,279 INFO L273 TraceCheckUtils]: 12: Hoare triple {12647#(<= 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; {12648#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:16,280 INFO L273 TraceCheckUtils]: 13: Hoare triple {12648#(<= 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; {12649#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:16,281 INFO L273 TraceCheckUtils]: 14: Hoare triple {12649#(<= 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; {12650#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:16,282 INFO L273 TraceCheckUtils]: 15: Hoare triple {12650#(<= 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; {12651#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:16,283 INFO L273 TraceCheckUtils]: 16: Hoare triple {12651#(<= 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; {12652#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:16,284 INFO L273 TraceCheckUtils]: 17: Hoare triple {12652#(<= 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; {12653#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:16,285 INFO L273 TraceCheckUtils]: 18: Hoare triple {12653#(<= 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; {12654#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:16,286 INFO L273 TraceCheckUtils]: 19: Hoare triple {12654#(<= 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; {12655#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:16,287 INFO L273 TraceCheckUtils]: 20: Hoare triple {12655#(<= 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; {12656#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:16,287 INFO L273 TraceCheckUtils]: 21: Hoare triple {12656#(<= main_~i~0 15)} assume !(~i~0 < 100000); {12640#false} is VALID [2018-11-23 12:05:16,288 INFO L273 TraceCheckUtils]: 22: Hoare triple {12640#false} ~i~0 := 0; {12640#false} is VALID [2018-11-23 12:05:16,288 INFO L273 TraceCheckUtils]: 23: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,288 INFO L273 TraceCheckUtils]: 24: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,288 INFO L273 TraceCheckUtils]: 25: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,288 INFO L273 TraceCheckUtils]: 26: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,289 INFO L273 TraceCheckUtils]: 27: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,289 INFO L273 TraceCheckUtils]: 28: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,289 INFO L273 TraceCheckUtils]: 29: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,289 INFO L273 TraceCheckUtils]: 30: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,289 INFO L273 TraceCheckUtils]: 31: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,290 INFO L273 TraceCheckUtils]: 32: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,290 INFO L273 TraceCheckUtils]: 33: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,290 INFO L273 TraceCheckUtils]: 34: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,290 INFO L273 TraceCheckUtils]: 35: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,290 INFO L273 TraceCheckUtils]: 36: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,290 INFO L273 TraceCheckUtils]: 37: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,291 INFO L273 TraceCheckUtils]: 38: Hoare triple {12640#false} assume !(~i~0 < 100000); {12640#false} is VALID [2018-11-23 12:05:16,291 INFO L273 TraceCheckUtils]: 39: Hoare triple {12640#false} ~i~0 := 0; {12640#false} is VALID [2018-11-23 12:05:16,291 INFO L273 TraceCheckUtils]: 40: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,291 INFO L273 TraceCheckUtils]: 41: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,291 INFO L273 TraceCheckUtils]: 42: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,291 INFO L273 TraceCheckUtils]: 43: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,291 INFO L273 TraceCheckUtils]: 44: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,291 INFO L273 TraceCheckUtils]: 45: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,292 INFO L273 TraceCheckUtils]: 46: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,292 INFO L273 TraceCheckUtils]: 47: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,292 INFO L273 TraceCheckUtils]: 48: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,292 INFO L273 TraceCheckUtils]: 49: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,292 INFO L273 TraceCheckUtils]: 50: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,292 INFO L273 TraceCheckUtils]: 51: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,292 INFO L273 TraceCheckUtils]: 52: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,292 INFO L273 TraceCheckUtils]: 53: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,292 INFO L273 TraceCheckUtils]: 54: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,293 INFO L273 TraceCheckUtils]: 55: Hoare triple {12640#false} assume !(~i~0 < 100000); {12640#false} is VALID [2018-11-23 12:05:16,293 INFO L273 TraceCheckUtils]: 56: Hoare triple {12640#false} ~i~0 := 0; {12640#false} is VALID [2018-11-23 12:05:16,293 INFO L273 TraceCheckUtils]: 57: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,293 INFO L273 TraceCheckUtils]: 58: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,293 INFO L273 TraceCheckUtils]: 59: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,293 INFO L273 TraceCheckUtils]: 60: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,293 INFO L273 TraceCheckUtils]: 61: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,293 INFO L273 TraceCheckUtils]: 62: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,293 INFO L273 TraceCheckUtils]: 63: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,294 INFO L273 TraceCheckUtils]: 64: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,294 INFO L273 TraceCheckUtils]: 65: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,294 INFO L273 TraceCheckUtils]: 66: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,294 INFO L273 TraceCheckUtils]: 67: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,294 INFO L273 TraceCheckUtils]: 68: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,294 INFO L273 TraceCheckUtils]: 69: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,294 INFO L273 TraceCheckUtils]: 70: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,294 INFO L273 TraceCheckUtils]: 71: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,295 INFO L273 TraceCheckUtils]: 72: Hoare triple {12640#false} assume !(~i~0 < 100000); {12640#false} is VALID [2018-11-23 12:05:16,295 INFO L273 TraceCheckUtils]: 73: Hoare triple {12640#false} ~i~0 := 0; {12640#false} is VALID [2018-11-23 12:05:16,295 INFO L273 TraceCheckUtils]: 74: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,295 INFO L273 TraceCheckUtils]: 75: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,295 INFO L273 TraceCheckUtils]: 76: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,295 INFO L273 TraceCheckUtils]: 77: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,295 INFO L273 TraceCheckUtils]: 78: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,295 INFO L273 TraceCheckUtils]: 79: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,295 INFO L273 TraceCheckUtils]: 80: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,296 INFO L273 TraceCheckUtils]: 81: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,296 INFO L273 TraceCheckUtils]: 82: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,296 INFO L273 TraceCheckUtils]: 83: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,296 INFO L273 TraceCheckUtils]: 84: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,296 INFO L273 TraceCheckUtils]: 85: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,296 INFO L273 TraceCheckUtils]: 86: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,296 INFO L273 TraceCheckUtils]: 87: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,296 INFO L273 TraceCheckUtils]: 88: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,296 INFO L273 TraceCheckUtils]: 89: Hoare triple {12640#false} assume !(~i~0 < 100000); {12640#false} is VALID [2018-11-23 12:05:16,297 INFO L273 TraceCheckUtils]: 90: Hoare triple {12640#false} ~i~0 := 0; {12640#false} is VALID [2018-11-23 12:05:16,297 INFO L273 TraceCheckUtils]: 91: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,297 INFO L273 TraceCheckUtils]: 92: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,297 INFO L273 TraceCheckUtils]: 93: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,297 INFO L273 TraceCheckUtils]: 94: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,297 INFO L273 TraceCheckUtils]: 95: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,297 INFO L273 TraceCheckUtils]: 96: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,297 INFO L273 TraceCheckUtils]: 97: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,298 INFO L273 TraceCheckUtils]: 98: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,298 INFO L273 TraceCheckUtils]: 99: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,298 INFO L273 TraceCheckUtils]: 100: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,298 INFO L273 TraceCheckUtils]: 101: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,298 INFO L273 TraceCheckUtils]: 102: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,298 INFO L273 TraceCheckUtils]: 103: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,298 INFO L273 TraceCheckUtils]: 104: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,298 INFO L273 TraceCheckUtils]: 105: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,298 INFO L273 TraceCheckUtils]: 106: Hoare triple {12640#false} assume !(~i~0 < 100000); {12640#false} is VALID [2018-11-23 12:05:16,299 INFO L273 TraceCheckUtils]: 107: Hoare triple {12640#false} ~i~0 := 0; {12640#false} is VALID [2018-11-23 12:05:16,299 INFO L273 TraceCheckUtils]: 108: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,299 INFO L273 TraceCheckUtils]: 109: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,299 INFO L273 TraceCheckUtils]: 110: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,299 INFO L273 TraceCheckUtils]: 111: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,299 INFO L273 TraceCheckUtils]: 112: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,299 INFO L273 TraceCheckUtils]: 113: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,299 INFO L273 TraceCheckUtils]: 114: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,299 INFO L273 TraceCheckUtils]: 115: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,300 INFO L273 TraceCheckUtils]: 116: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,300 INFO L273 TraceCheckUtils]: 117: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,300 INFO L273 TraceCheckUtils]: 118: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,300 INFO L273 TraceCheckUtils]: 119: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,300 INFO L273 TraceCheckUtils]: 120: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,300 INFO L273 TraceCheckUtils]: 121: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,300 INFO L273 TraceCheckUtils]: 122: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:05:16,300 INFO L273 TraceCheckUtils]: 123: Hoare triple {12640#false} assume !(~i~0 < 100000); {12640#false} is VALID [2018-11-23 12:05:16,300 INFO L273 TraceCheckUtils]: 124: Hoare triple {12640#false} havoc ~x~0;~x~0 := 0; {12640#false} is VALID [2018-11-23 12:05:16,301 INFO L273 TraceCheckUtils]: 125: Hoare triple {12640#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12640#false} is VALID [2018-11-23 12:05:16,301 INFO L256 TraceCheckUtils]: 126: Hoare triple {12640#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {12640#false} is VALID [2018-11-23 12:05:16,301 INFO L273 TraceCheckUtils]: 127: Hoare triple {12640#false} ~cond := #in~cond; {12640#false} is VALID [2018-11-23 12:05:16,301 INFO L273 TraceCheckUtils]: 128: Hoare triple {12640#false} assume 0 == ~cond; {12640#false} is VALID [2018-11-23 12:05:16,301 INFO L273 TraceCheckUtils]: 129: Hoare triple {12640#false} assume !false; {12640#false} is VALID [2018-11-23 12:05:16,308 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 720 trivial. 0 not checked. [2018-11-23 12:05:16,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:16,308 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:05:16,317 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:06:06,423 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:06:06,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:06,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:06,705 INFO L256 TraceCheckUtils]: 0: Hoare triple {12639#true} call ULTIMATE.init(); {12639#true} is VALID [2018-11-23 12:06:06,705 INFO L273 TraceCheckUtils]: 1: Hoare triple {12639#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12639#true} is VALID [2018-11-23 12:06:06,706 INFO L273 TraceCheckUtils]: 2: Hoare triple {12639#true} assume true; {12639#true} is VALID [2018-11-23 12:06:06,706 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12639#true} {12639#true} #126#return; {12639#true} is VALID [2018-11-23 12:06:06,706 INFO L256 TraceCheckUtils]: 4: Hoare triple {12639#true} call #t~ret2 := main(); {12639#true} is VALID [2018-11-23 12:06:06,706 INFO L273 TraceCheckUtils]: 5: Hoare triple {12639#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12639#true} is VALID [2018-11-23 12:06:06,706 INFO L273 TraceCheckUtils]: 6: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,707 INFO L273 TraceCheckUtils]: 7: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,707 INFO L273 TraceCheckUtils]: 8: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,707 INFO L273 TraceCheckUtils]: 9: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,707 INFO L273 TraceCheckUtils]: 10: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,707 INFO L273 TraceCheckUtils]: 11: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,708 INFO L273 TraceCheckUtils]: 12: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,708 INFO L273 TraceCheckUtils]: 13: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,708 INFO L273 TraceCheckUtils]: 14: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,708 INFO L273 TraceCheckUtils]: 15: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,708 INFO L273 TraceCheckUtils]: 16: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,709 INFO L273 TraceCheckUtils]: 17: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,709 INFO L273 TraceCheckUtils]: 18: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,709 INFO L273 TraceCheckUtils]: 19: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,709 INFO L273 TraceCheckUtils]: 20: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,709 INFO L273 TraceCheckUtils]: 21: Hoare triple {12639#true} assume !(~i~0 < 100000); {12639#true} is VALID [2018-11-23 12:06:06,709 INFO L273 TraceCheckUtils]: 22: Hoare triple {12639#true} ~i~0 := 0; {12639#true} is VALID [2018-11-23 12:06:06,709 INFO L273 TraceCheckUtils]: 23: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,709 INFO L273 TraceCheckUtils]: 24: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,709 INFO L273 TraceCheckUtils]: 25: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,710 INFO L273 TraceCheckUtils]: 26: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,710 INFO L273 TraceCheckUtils]: 27: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,710 INFO L273 TraceCheckUtils]: 28: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,710 INFO L273 TraceCheckUtils]: 29: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,710 INFO L273 TraceCheckUtils]: 30: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,710 INFO L273 TraceCheckUtils]: 31: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,710 INFO L273 TraceCheckUtils]: 32: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,710 INFO L273 TraceCheckUtils]: 33: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,711 INFO L273 TraceCheckUtils]: 34: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,711 INFO L273 TraceCheckUtils]: 35: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,711 INFO L273 TraceCheckUtils]: 36: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,711 INFO L273 TraceCheckUtils]: 37: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,711 INFO L273 TraceCheckUtils]: 38: Hoare triple {12639#true} assume !(~i~0 < 100000); {12639#true} is VALID [2018-11-23 12:06:06,711 INFO L273 TraceCheckUtils]: 39: Hoare triple {12639#true} ~i~0 := 0; {12639#true} is VALID [2018-11-23 12:06:06,711 INFO L273 TraceCheckUtils]: 40: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,711 INFO L273 TraceCheckUtils]: 41: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,711 INFO L273 TraceCheckUtils]: 42: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,712 INFO L273 TraceCheckUtils]: 43: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,712 INFO L273 TraceCheckUtils]: 44: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,712 INFO L273 TraceCheckUtils]: 45: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,712 INFO L273 TraceCheckUtils]: 46: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,712 INFO L273 TraceCheckUtils]: 47: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,712 INFO L273 TraceCheckUtils]: 48: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,712 INFO L273 TraceCheckUtils]: 49: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,712 INFO L273 TraceCheckUtils]: 50: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,712 INFO L273 TraceCheckUtils]: 51: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,713 INFO L273 TraceCheckUtils]: 52: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,713 INFO L273 TraceCheckUtils]: 53: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,713 INFO L273 TraceCheckUtils]: 54: Hoare triple {12639#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12639#true} is VALID [2018-11-23 12:06:06,713 INFO L273 TraceCheckUtils]: 55: Hoare triple {12639#true} assume !(~i~0 < 100000); {12639#true} is VALID [2018-11-23 12:06:06,713 INFO L273 TraceCheckUtils]: 56: Hoare triple {12639#true} ~i~0 := 0; {12828#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:06,714 INFO L273 TraceCheckUtils]: 57: Hoare triple {12828#(<= 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; {12642#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:06,714 INFO L273 TraceCheckUtils]: 58: Hoare triple {12642#(<= 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; {12643#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:06,715 INFO L273 TraceCheckUtils]: 59: Hoare triple {12643#(<= 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; {12644#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:06,716 INFO L273 TraceCheckUtils]: 60: Hoare triple {12644#(<= 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; {12645#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:06,717 INFO L273 TraceCheckUtils]: 61: Hoare triple {12645#(<= 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; {12646#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:06,718 INFO L273 TraceCheckUtils]: 62: Hoare triple {12646#(<= 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; {12647#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:06,719 INFO L273 TraceCheckUtils]: 63: Hoare triple {12647#(<= 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; {12648#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:06,719 INFO L273 TraceCheckUtils]: 64: Hoare triple {12648#(<= 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; {12649#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:06,720 INFO L273 TraceCheckUtils]: 65: Hoare triple {12649#(<= 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; {12650#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:06,721 INFO L273 TraceCheckUtils]: 66: Hoare triple {12650#(<= 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; {12651#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:06,722 INFO L273 TraceCheckUtils]: 67: Hoare triple {12651#(<= 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; {12652#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:06,723 INFO L273 TraceCheckUtils]: 68: Hoare triple {12652#(<= 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; {12653#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:06,724 INFO L273 TraceCheckUtils]: 69: Hoare triple {12653#(<= 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; {12654#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:06,725 INFO L273 TraceCheckUtils]: 70: Hoare triple {12654#(<= 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; {12655#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:06,726 INFO L273 TraceCheckUtils]: 71: Hoare triple {12655#(<= 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; {12656#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:06,727 INFO L273 TraceCheckUtils]: 72: Hoare triple {12656#(<= main_~i~0 15)} assume !(~i~0 < 100000); {12640#false} is VALID [2018-11-23 12:06:06,727 INFO L273 TraceCheckUtils]: 73: Hoare triple {12640#false} ~i~0 := 0; {12640#false} is VALID [2018-11-23 12:06:06,727 INFO L273 TraceCheckUtils]: 74: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,727 INFO L273 TraceCheckUtils]: 75: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,727 INFO L273 TraceCheckUtils]: 76: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,728 INFO L273 TraceCheckUtils]: 77: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,728 INFO L273 TraceCheckUtils]: 78: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,728 INFO L273 TraceCheckUtils]: 79: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,728 INFO L273 TraceCheckUtils]: 80: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,728 INFO L273 TraceCheckUtils]: 81: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,729 INFO L273 TraceCheckUtils]: 82: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,729 INFO L273 TraceCheckUtils]: 83: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,729 INFO L273 TraceCheckUtils]: 84: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,729 INFO L273 TraceCheckUtils]: 85: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,729 INFO L273 TraceCheckUtils]: 86: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,730 INFO L273 TraceCheckUtils]: 87: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,730 INFO L273 TraceCheckUtils]: 88: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,730 INFO L273 TraceCheckUtils]: 89: Hoare triple {12640#false} assume !(~i~0 < 100000); {12640#false} is VALID [2018-11-23 12:06:06,730 INFO L273 TraceCheckUtils]: 90: Hoare triple {12640#false} ~i~0 := 0; {12640#false} is VALID [2018-11-23 12:06:06,730 INFO L273 TraceCheckUtils]: 91: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,731 INFO L273 TraceCheckUtils]: 92: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,731 INFO L273 TraceCheckUtils]: 93: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,731 INFO L273 TraceCheckUtils]: 94: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,731 INFO L273 TraceCheckUtils]: 95: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,731 INFO L273 TraceCheckUtils]: 96: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,732 INFO L273 TraceCheckUtils]: 97: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,732 INFO L273 TraceCheckUtils]: 98: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,732 INFO L273 TraceCheckUtils]: 99: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,732 INFO L273 TraceCheckUtils]: 100: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,732 INFO L273 TraceCheckUtils]: 101: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,732 INFO L273 TraceCheckUtils]: 102: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,732 INFO L273 TraceCheckUtils]: 103: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,732 INFO L273 TraceCheckUtils]: 104: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,732 INFO L273 TraceCheckUtils]: 105: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,733 INFO L273 TraceCheckUtils]: 106: Hoare triple {12640#false} assume !(~i~0 < 100000); {12640#false} is VALID [2018-11-23 12:06:06,733 INFO L273 TraceCheckUtils]: 107: Hoare triple {12640#false} ~i~0 := 0; {12640#false} is VALID [2018-11-23 12:06:06,733 INFO L273 TraceCheckUtils]: 108: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,733 INFO L273 TraceCheckUtils]: 109: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,733 INFO L273 TraceCheckUtils]: 110: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,733 INFO L273 TraceCheckUtils]: 111: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,733 INFO L273 TraceCheckUtils]: 112: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,733 INFO L273 TraceCheckUtils]: 113: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,733 INFO L273 TraceCheckUtils]: 114: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,734 INFO L273 TraceCheckUtils]: 115: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,734 INFO L273 TraceCheckUtils]: 116: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,734 INFO L273 TraceCheckUtils]: 117: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,734 INFO L273 TraceCheckUtils]: 118: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,734 INFO L273 TraceCheckUtils]: 119: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,734 INFO L273 TraceCheckUtils]: 120: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,734 INFO L273 TraceCheckUtils]: 121: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,734 INFO L273 TraceCheckUtils]: 122: Hoare triple {12640#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12640#false} is VALID [2018-11-23 12:06:06,734 INFO L273 TraceCheckUtils]: 123: Hoare triple {12640#false} assume !(~i~0 < 100000); {12640#false} is VALID [2018-11-23 12:06:06,735 INFO L273 TraceCheckUtils]: 124: Hoare triple {12640#false} havoc ~x~0;~x~0 := 0; {12640#false} is VALID [2018-11-23 12:06:06,735 INFO L273 TraceCheckUtils]: 125: Hoare triple {12640#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12640#false} is VALID [2018-11-23 12:06:06,735 INFO L256 TraceCheckUtils]: 126: Hoare triple {12640#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {12640#false} is VALID [2018-11-23 12:06:06,735 INFO L273 TraceCheckUtils]: 127: Hoare triple {12640#false} ~cond := #in~cond; {12640#false} is VALID [2018-11-23 12:06:06,735 INFO L273 TraceCheckUtils]: 128: Hoare triple {12640#false} assume 0 == ~cond; {12640#false} is VALID [2018-11-23 12:06:06,735 INFO L273 TraceCheckUtils]: 129: Hoare triple {12640#false} assume !false; {12640#false} is VALID [2018-11-23 12:06:06,742 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 720 trivial. 0 not checked. [2018-11-23 12:06:06,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:06,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 12:06:06,777 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 130 [2018-11-23 12:06:06,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:06,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:06:06,888 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:06:06,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:06:06,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:06:06,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:06:06,889 INFO L87 Difference]: Start difference. First operand 135 states and 142 transitions. Second operand 19 states. [2018-11-23 12:06:08,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:08,285 INFO L93 Difference]: Finished difference Result 255 states and 275 transitions. [2018-11-23 12:06:08,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 12:06:08,285 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 130 [2018-11-23 12:06:08,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:08,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:06:08,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 185 transitions. [2018-11-23 12:06:08,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:06:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 185 transitions. [2018-11-23 12:06:08,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 185 transitions. [2018-11-23 12:06:08,485 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:08,488 INFO L225 Difference]: With dead ends: 255 [2018-11-23 12:06:08,488 INFO L226 Difference]: Without dead ends: 142 [2018-11-23 12:06:08,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 130 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:06:08,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-23 12:06:08,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-11-23 12:06:08,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:08,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 142 states. [2018-11-23 12:06:08,579 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 142 states. [2018-11-23 12:06:08,579 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 142 states. [2018-11-23 12:06:08,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:08,581 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2018-11-23 12:06:08,581 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 149 transitions. [2018-11-23 12:06:08,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:08,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:08,581 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 142 states. [2018-11-23 12:06:08,581 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 142 states. [2018-11-23 12:06:08,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:08,584 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2018-11-23 12:06:08,584 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 149 transitions. [2018-11-23 12:06:08,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:08,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:08,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:08,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:08,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-23 12:06:08,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 149 transitions. [2018-11-23 12:06:08,587 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 149 transitions. Word has length 130 [2018-11-23 12:06:08,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:08,588 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 149 transitions. [2018-11-23 12:06:08,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:06:08,588 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 149 transitions. [2018-11-23 12:06:08,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-23 12:06:08,589 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:08,589 INFO L402 BasicCegarLoop]: trace histogram [16, 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, 1, 1] [2018-11-23 12:06:08,589 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:08,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:08,590 INFO L82 PathProgramCache]: Analyzing trace with hash 795738570, now seen corresponding path program 16 times [2018-11-23 12:06:08,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:08,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:08,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:08,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:08,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:09,186 INFO L256 TraceCheckUtils]: 0: Hoare triple {14079#true} call ULTIMATE.init(); {14079#true} is VALID [2018-11-23 12:06:09,186 INFO L273 TraceCheckUtils]: 1: Hoare triple {14079#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14079#true} is VALID [2018-11-23 12:06:09,186 INFO L273 TraceCheckUtils]: 2: Hoare triple {14079#true} assume true; {14079#true} is VALID [2018-11-23 12:06:09,186 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14079#true} {14079#true} #126#return; {14079#true} is VALID [2018-11-23 12:06:09,187 INFO L256 TraceCheckUtils]: 4: Hoare triple {14079#true} call #t~ret2 := main(); {14079#true} is VALID [2018-11-23 12:06:09,187 INFO L273 TraceCheckUtils]: 5: Hoare triple {14079#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {14081#(= main_~i~0 0)} is VALID [2018-11-23 12:06:09,188 INFO L273 TraceCheckUtils]: 6: Hoare triple {14081#(= 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; {14082#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:09,188 INFO L273 TraceCheckUtils]: 7: Hoare triple {14082#(<= 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; {14083#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:09,189 INFO L273 TraceCheckUtils]: 8: Hoare triple {14083#(<= 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; {14084#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:09,189 INFO L273 TraceCheckUtils]: 9: Hoare triple {14084#(<= 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; {14085#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:09,190 INFO L273 TraceCheckUtils]: 10: Hoare triple {14085#(<= 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; {14086#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:09,191 INFO L273 TraceCheckUtils]: 11: Hoare triple {14086#(<= 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; {14087#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:09,192 INFO L273 TraceCheckUtils]: 12: Hoare triple {14087#(<= 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; {14088#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:09,193 INFO L273 TraceCheckUtils]: 13: Hoare triple {14088#(<= 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; {14089#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:09,194 INFO L273 TraceCheckUtils]: 14: Hoare triple {14089#(<= 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; {14090#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:09,195 INFO L273 TraceCheckUtils]: 15: Hoare triple {14090#(<= 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; {14091#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:09,196 INFO L273 TraceCheckUtils]: 16: Hoare triple {14091#(<= 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; {14092#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:09,196 INFO L273 TraceCheckUtils]: 17: Hoare triple {14092#(<= 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; {14093#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:09,197 INFO L273 TraceCheckUtils]: 18: Hoare triple {14093#(<= 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; {14094#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:09,198 INFO L273 TraceCheckUtils]: 19: Hoare triple {14094#(<= 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; {14095#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:09,199 INFO L273 TraceCheckUtils]: 20: Hoare triple {14095#(<= 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; {14096#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:09,200 INFO L273 TraceCheckUtils]: 21: Hoare triple {14096#(<= 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; {14097#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:09,201 INFO L273 TraceCheckUtils]: 22: Hoare triple {14097#(<= main_~i~0 16)} assume !(~i~0 < 100000); {14080#false} is VALID [2018-11-23 12:06:09,201 INFO L273 TraceCheckUtils]: 23: Hoare triple {14080#false} ~i~0 := 0; {14080#false} is VALID [2018-11-23 12:06:09,201 INFO L273 TraceCheckUtils]: 24: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,201 INFO L273 TraceCheckUtils]: 25: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,202 INFO L273 TraceCheckUtils]: 26: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,202 INFO L273 TraceCheckUtils]: 27: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,202 INFO L273 TraceCheckUtils]: 28: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,202 INFO L273 TraceCheckUtils]: 29: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,202 INFO L273 TraceCheckUtils]: 30: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,203 INFO L273 TraceCheckUtils]: 31: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,203 INFO L273 TraceCheckUtils]: 32: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,203 INFO L273 TraceCheckUtils]: 33: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,203 INFO L273 TraceCheckUtils]: 34: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,203 INFO L273 TraceCheckUtils]: 35: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,204 INFO L273 TraceCheckUtils]: 36: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,204 INFO L273 TraceCheckUtils]: 37: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,204 INFO L273 TraceCheckUtils]: 38: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,204 INFO L273 TraceCheckUtils]: 39: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,204 INFO L273 TraceCheckUtils]: 40: Hoare triple {14080#false} assume !(~i~0 < 100000); {14080#false} is VALID [2018-11-23 12:06:09,205 INFO L273 TraceCheckUtils]: 41: Hoare triple {14080#false} ~i~0 := 0; {14080#false} is VALID [2018-11-23 12:06:09,205 INFO L273 TraceCheckUtils]: 42: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,205 INFO L273 TraceCheckUtils]: 43: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,205 INFO L273 TraceCheckUtils]: 44: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,205 INFO L273 TraceCheckUtils]: 45: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,205 INFO L273 TraceCheckUtils]: 46: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,206 INFO L273 TraceCheckUtils]: 47: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,206 INFO L273 TraceCheckUtils]: 48: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,206 INFO L273 TraceCheckUtils]: 49: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,206 INFO L273 TraceCheckUtils]: 50: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,206 INFO L273 TraceCheckUtils]: 51: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,206 INFO L273 TraceCheckUtils]: 52: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,206 INFO L273 TraceCheckUtils]: 53: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,206 INFO L273 TraceCheckUtils]: 54: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,206 INFO L273 TraceCheckUtils]: 55: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,207 INFO L273 TraceCheckUtils]: 56: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,207 INFO L273 TraceCheckUtils]: 57: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,207 INFO L273 TraceCheckUtils]: 58: Hoare triple {14080#false} assume !(~i~0 < 100000); {14080#false} is VALID [2018-11-23 12:06:09,207 INFO L273 TraceCheckUtils]: 59: Hoare triple {14080#false} ~i~0 := 0; {14080#false} is VALID [2018-11-23 12:06:09,207 INFO L273 TraceCheckUtils]: 60: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,207 INFO L273 TraceCheckUtils]: 61: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,207 INFO L273 TraceCheckUtils]: 62: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,207 INFO L273 TraceCheckUtils]: 63: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,207 INFO L273 TraceCheckUtils]: 64: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,208 INFO L273 TraceCheckUtils]: 65: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,208 INFO L273 TraceCheckUtils]: 66: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,208 INFO L273 TraceCheckUtils]: 67: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,208 INFO L273 TraceCheckUtils]: 68: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,208 INFO L273 TraceCheckUtils]: 69: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,208 INFO L273 TraceCheckUtils]: 70: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,208 INFO L273 TraceCheckUtils]: 71: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,208 INFO L273 TraceCheckUtils]: 72: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,209 INFO L273 TraceCheckUtils]: 73: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,209 INFO L273 TraceCheckUtils]: 74: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,209 INFO L273 TraceCheckUtils]: 75: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,209 INFO L273 TraceCheckUtils]: 76: Hoare triple {14080#false} assume !(~i~0 < 100000); {14080#false} is VALID [2018-11-23 12:06:09,209 INFO L273 TraceCheckUtils]: 77: Hoare triple {14080#false} ~i~0 := 0; {14080#false} is VALID [2018-11-23 12:06:09,209 INFO L273 TraceCheckUtils]: 78: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,209 INFO L273 TraceCheckUtils]: 79: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,209 INFO L273 TraceCheckUtils]: 80: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,209 INFO L273 TraceCheckUtils]: 81: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,210 INFO L273 TraceCheckUtils]: 82: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,210 INFO L273 TraceCheckUtils]: 83: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,210 INFO L273 TraceCheckUtils]: 84: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,210 INFO L273 TraceCheckUtils]: 85: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,210 INFO L273 TraceCheckUtils]: 86: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,210 INFO L273 TraceCheckUtils]: 87: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,210 INFO L273 TraceCheckUtils]: 88: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,210 INFO L273 TraceCheckUtils]: 89: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,210 INFO L273 TraceCheckUtils]: 90: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,211 INFO L273 TraceCheckUtils]: 91: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,211 INFO L273 TraceCheckUtils]: 92: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,211 INFO L273 TraceCheckUtils]: 93: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,211 INFO L273 TraceCheckUtils]: 94: Hoare triple {14080#false} assume !(~i~0 < 100000); {14080#false} is VALID [2018-11-23 12:06:09,211 INFO L273 TraceCheckUtils]: 95: Hoare triple {14080#false} ~i~0 := 0; {14080#false} is VALID [2018-11-23 12:06:09,211 INFO L273 TraceCheckUtils]: 96: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,211 INFO L273 TraceCheckUtils]: 97: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,211 INFO L273 TraceCheckUtils]: 98: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,211 INFO L273 TraceCheckUtils]: 99: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,212 INFO L273 TraceCheckUtils]: 100: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,212 INFO L273 TraceCheckUtils]: 101: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,212 INFO L273 TraceCheckUtils]: 102: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,212 INFO L273 TraceCheckUtils]: 103: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,212 INFO L273 TraceCheckUtils]: 104: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,212 INFO L273 TraceCheckUtils]: 105: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,212 INFO L273 TraceCheckUtils]: 106: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,212 INFO L273 TraceCheckUtils]: 107: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,212 INFO L273 TraceCheckUtils]: 108: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,213 INFO L273 TraceCheckUtils]: 109: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,213 INFO L273 TraceCheckUtils]: 110: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,213 INFO L273 TraceCheckUtils]: 111: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,213 INFO L273 TraceCheckUtils]: 112: Hoare triple {14080#false} assume !(~i~0 < 100000); {14080#false} is VALID [2018-11-23 12:06:09,213 INFO L273 TraceCheckUtils]: 113: Hoare triple {14080#false} ~i~0 := 0; {14080#false} is VALID [2018-11-23 12:06:09,213 INFO L273 TraceCheckUtils]: 114: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,213 INFO L273 TraceCheckUtils]: 115: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,213 INFO L273 TraceCheckUtils]: 116: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,213 INFO L273 TraceCheckUtils]: 117: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,214 INFO L273 TraceCheckUtils]: 118: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,214 INFO L273 TraceCheckUtils]: 119: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,214 INFO L273 TraceCheckUtils]: 120: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,214 INFO L273 TraceCheckUtils]: 121: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,214 INFO L273 TraceCheckUtils]: 122: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,214 INFO L273 TraceCheckUtils]: 123: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,214 INFO L273 TraceCheckUtils]: 124: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,214 INFO L273 TraceCheckUtils]: 125: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,215 INFO L273 TraceCheckUtils]: 126: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,215 INFO L273 TraceCheckUtils]: 127: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,215 INFO L273 TraceCheckUtils]: 128: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,215 INFO L273 TraceCheckUtils]: 129: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,215 INFO L273 TraceCheckUtils]: 130: Hoare triple {14080#false} assume !(~i~0 < 100000); {14080#false} is VALID [2018-11-23 12:06:09,215 INFO L273 TraceCheckUtils]: 131: Hoare triple {14080#false} havoc ~x~0;~x~0 := 0; {14080#false} is VALID [2018-11-23 12:06:09,215 INFO L273 TraceCheckUtils]: 132: Hoare triple {14080#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {14080#false} is VALID [2018-11-23 12:06:09,215 INFO L256 TraceCheckUtils]: 133: Hoare triple {14080#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {14080#false} is VALID [2018-11-23 12:06:09,215 INFO L273 TraceCheckUtils]: 134: Hoare triple {14080#false} ~cond := #in~cond; {14080#false} is VALID [2018-11-23 12:06:09,216 INFO L273 TraceCheckUtils]: 135: Hoare triple {14080#false} assume 0 == ~cond; {14080#false} is VALID [2018-11-23 12:06:09,216 INFO L273 TraceCheckUtils]: 136: Hoare triple {14080#false} assume !false; {14080#false} is VALID [2018-11-23 12:06:09,223 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2018-11-23 12:06:09,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:09,223 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:06:09,235 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:06:09,320 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:06:09,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:09,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:09,630 INFO L256 TraceCheckUtils]: 0: Hoare triple {14079#true} call ULTIMATE.init(); {14079#true} is VALID [2018-11-23 12:06:09,630 INFO L273 TraceCheckUtils]: 1: Hoare triple {14079#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14079#true} is VALID [2018-11-23 12:06:09,630 INFO L273 TraceCheckUtils]: 2: Hoare triple {14079#true} assume true; {14079#true} is VALID [2018-11-23 12:06:09,630 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14079#true} {14079#true} #126#return; {14079#true} is VALID [2018-11-23 12:06:09,630 INFO L256 TraceCheckUtils]: 4: Hoare triple {14079#true} call #t~ret2 := main(); {14079#true} is VALID [2018-11-23 12:06:09,631 INFO L273 TraceCheckUtils]: 5: Hoare triple {14079#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {14116#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:09,632 INFO L273 TraceCheckUtils]: 6: Hoare triple {14116#(<= 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; {14082#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:09,632 INFO L273 TraceCheckUtils]: 7: Hoare triple {14082#(<= 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; {14083#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:09,633 INFO L273 TraceCheckUtils]: 8: Hoare triple {14083#(<= 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; {14084#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:09,633 INFO L273 TraceCheckUtils]: 9: Hoare triple {14084#(<= 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; {14085#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:09,634 INFO L273 TraceCheckUtils]: 10: Hoare triple {14085#(<= 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; {14086#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:09,635 INFO L273 TraceCheckUtils]: 11: Hoare triple {14086#(<= 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; {14087#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:09,635 INFO L273 TraceCheckUtils]: 12: Hoare triple {14087#(<= 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; {14088#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:09,636 INFO L273 TraceCheckUtils]: 13: Hoare triple {14088#(<= 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; {14089#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:09,637 INFO L273 TraceCheckUtils]: 14: Hoare triple {14089#(<= 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; {14090#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:09,638 INFO L273 TraceCheckUtils]: 15: Hoare triple {14090#(<= 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; {14091#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:09,639 INFO L273 TraceCheckUtils]: 16: Hoare triple {14091#(<= 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; {14092#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:09,640 INFO L273 TraceCheckUtils]: 17: Hoare triple {14092#(<= 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; {14093#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:09,641 INFO L273 TraceCheckUtils]: 18: Hoare triple {14093#(<= 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; {14094#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:09,642 INFO L273 TraceCheckUtils]: 19: Hoare triple {14094#(<= 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; {14095#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:09,643 INFO L273 TraceCheckUtils]: 20: Hoare triple {14095#(<= 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; {14096#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:09,644 INFO L273 TraceCheckUtils]: 21: Hoare triple {14096#(<= 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; {14097#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:09,644 INFO L273 TraceCheckUtils]: 22: Hoare triple {14097#(<= main_~i~0 16)} assume !(~i~0 < 100000); {14080#false} is VALID [2018-11-23 12:06:09,645 INFO L273 TraceCheckUtils]: 23: Hoare triple {14080#false} ~i~0 := 0; {14080#false} is VALID [2018-11-23 12:06:09,645 INFO L273 TraceCheckUtils]: 24: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,645 INFO L273 TraceCheckUtils]: 25: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,645 INFO L273 TraceCheckUtils]: 26: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,645 INFO L273 TraceCheckUtils]: 27: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,646 INFO L273 TraceCheckUtils]: 28: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,646 INFO L273 TraceCheckUtils]: 29: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,646 INFO L273 TraceCheckUtils]: 30: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,646 INFO L273 TraceCheckUtils]: 31: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,646 INFO L273 TraceCheckUtils]: 32: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,647 INFO L273 TraceCheckUtils]: 33: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,647 INFO L273 TraceCheckUtils]: 34: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,647 INFO L273 TraceCheckUtils]: 35: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,647 INFO L273 TraceCheckUtils]: 36: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,647 INFO L273 TraceCheckUtils]: 37: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,648 INFO L273 TraceCheckUtils]: 38: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,648 INFO L273 TraceCheckUtils]: 39: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,648 INFO L273 TraceCheckUtils]: 40: Hoare triple {14080#false} assume !(~i~0 < 100000); {14080#false} is VALID [2018-11-23 12:06:09,648 INFO L273 TraceCheckUtils]: 41: Hoare triple {14080#false} ~i~0 := 0; {14080#false} is VALID [2018-11-23 12:06:09,648 INFO L273 TraceCheckUtils]: 42: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,648 INFO L273 TraceCheckUtils]: 43: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,648 INFO L273 TraceCheckUtils]: 44: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,649 INFO L273 TraceCheckUtils]: 45: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,649 INFO L273 TraceCheckUtils]: 46: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,649 INFO L273 TraceCheckUtils]: 47: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,649 INFO L273 TraceCheckUtils]: 48: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,649 INFO L273 TraceCheckUtils]: 49: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,649 INFO L273 TraceCheckUtils]: 50: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,649 INFO L273 TraceCheckUtils]: 51: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,649 INFO L273 TraceCheckUtils]: 52: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,649 INFO L273 TraceCheckUtils]: 53: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,650 INFO L273 TraceCheckUtils]: 54: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,650 INFO L273 TraceCheckUtils]: 55: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,650 INFO L273 TraceCheckUtils]: 56: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,650 INFO L273 TraceCheckUtils]: 57: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,650 INFO L273 TraceCheckUtils]: 58: Hoare triple {14080#false} assume !(~i~0 < 100000); {14080#false} is VALID [2018-11-23 12:06:09,650 INFO L273 TraceCheckUtils]: 59: Hoare triple {14080#false} ~i~0 := 0; {14080#false} is VALID [2018-11-23 12:06:09,651 INFO L273 TraceCheckUtils]: 60: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,651 INFO L273 TraceCheckUtils]: 61: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,651 INFO L273 TraceCheckUtils]: 62: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,651 INFO L273 TraceCheckUtils]: 63: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,651 INFO L273 TraceCheckUtils]: 64: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,652 INFO L273 TraceCheckUtils]: 65: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,652 INFO L273 TraceCheckUtils]: 66: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,652 INFO L273 TraceCheckUtils]: 67: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,652 INFO L273 TraceCheckUtils]: 68: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,652 INFO L273 TraceCheckUtils]: 69: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,652 INFO L273 TraceCheckUtils]: 70: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,653 INFO L273 TraceCheckUtils]: 71: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,653 INFO L273 TraceCheckUtils]: 72: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,653 INFO L273 TraceCheckUtils]: 73: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,653 INFO L273 TraceCheckUtils]: 74: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,653 INFO L273 TraceCheckUtils]: 75: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,653 INFO L273 TraceCheckUtils]: 76: Hoare triple {14080#false} assume !(~i~0 < 100000); {14080#false} is VALID [2018-11-23 12:06:09,654 INFO L273 TraceCheckUtils]: 77: Hoare triple {14080#false} ~i~0 := 0; {14080#false} is VALID [2018-11-23 12:06:09,654 INFO L273 TraceCheckUtils]: 78: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,654 INFO L273 TraceCheckUtils]: 79: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,654 INFO L273 TraceCheckUtils]: 80: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,654 INFO L273 TraceCheckUtils]: 81: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,654 INFO L273 TraceCheckUtils]: 82: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,655 INFO L273 TraceCheckUtils]: 83: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,655 INFO L273 TraceCheckUtils]: 84: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,655 INFO L273 TraceCheckUtils]: 85: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,655 INFO L273 TraceCheckUtils]: 86: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,655 INFO L273 TraceCheckUtils]: 87: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,655 INFO L273 TraceCheckUtils]: 88: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,656 INFO L273 TraceCheckUtils]: 89: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,656 INFO L273 TraceCheckUtils]: 90: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,656 INFO L273 TraceCheckUtils]: 91: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,656 INFO L273 TraceCheckUtils]: 92: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,656 INFO L273 TraceCheckUtils]: 93: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,656 INFO L273 TraceCheckUtils]: 94: Hoare triple {14080#false} assume !(~i~0 < 100000); {14080#false} is VALID [2018-11-23 12:06:09,657 INFO L273 TraceCheckUtils]: 95: Hoare triple {14080#false} ~i~0 := 0; {14080#false} is VALID [2018-11-23 12:06:09,657 INFO L273 TraceCheckUtils]: 96: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,657 INFO L273 TraceCheckUtils]: 97: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,657 INFO L273 TraceCheckUtils]: 98: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,657 INFO L273 TraceCheckUtils]: 99: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,657 INFO L273 TraceCheckUtils]: 100: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,658 INFO L273 TraceCheckUtils]: 101: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,658 INFO L273 TraceCheckUtils]: 102: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,658 INFO L273 TraceCheckUtils]: 103: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,658 INFO L273 TraceCheckUtils]: 104: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,658 INFO L273 TraceCheckUtils]: 105: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,658 INFO L273 TraceCheckUtils]: 106: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,658 INFO L273 TraceCheckUtils]: 107: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,659 INFO L273 TraceCheckUtils]: 108: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,659 INFO L273 TraceCheckUtils]: 109: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,659 INFO L273 TraceCheckUtils]: 110: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,659 INFO L273 TraceCheckUtils]: 111: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,659 INFO L273 TraceCheckUtils]: 112: Hoare triple {14080#false} assume !(~i~0 < 100000); {14080#false} is VALID [2018-11-23 12:06:09,659 INFO L273 TraceCheckUtils]: 113: Hoare triple {14080#false} ~i~0 := 0; {14080#false} is VALID [2018-11-23 12:06:09,660 INFO L273 TraceCheckUtils]: 114: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,660 INFO L273 TraceCheckUtils]: 115: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,660 INFO L273 TraceCheckUtils]: 116: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,660 INFO L273 TraceCheckUtils]: 117: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,660 INFO L273 TraceCheckUtils]: 118: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,660 INFO L273 TraceCheckUtils]: 119: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,661 INFO L273 TraceCheckUtils]: 120: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,661 INFO L273 TraceCheckUtils]: 121: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,661 INFO L273 TraceCheckUtils]: 122: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,661 INFO L273 TraceCheckUtils]: 123: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,661 INFO L273 TraceCheckUtils]: 124: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,661 INFO L273 TraceCheckUtils]: 125: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,662 INFO L273 TraceCheckUtils]: 126: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,662 INFO L273 TraceCheckUtils]: 127: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,662 INFO L273 TraceCheckUtils]: 128: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,662 INFO L273 TraceCheckUtils]: 129: Hoare triple {14080#false} assume !!(~i~0 < 100000);call write~int(48, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14080#false} is VALID [2018-11-23 12:06:09,662 INFO L273 TraceCheckUtils]: 130: Hoare triple {14080#false} assume !(~i~0 < 100000); {14080#false} is VALID [2018-11-23 12:06:09,662 INFO L273 TraceCheckUtils]: 131: Hoare triple {14080#false} havoc ~x~0;~x~0 := 0; {14080#false} is VALID [2018-11-23 12:06:09,662 INFO L273 TraceCheckUtils]: 132: Hoare triple {14080#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {14080#false} is VALID [2018-11-23 12:06:09,663 INFO L256 TraceCheckUtils]: 133: Hoare triple {14080#false} call __VERIFIER_assert((if 48 == #t~mem1 then 1 else 0)); {14080#false} is VALID [2018-11-23 12:06:09,663 INFO L273 TraceCheckUtils]: 134: Hoare triple {14080#false} ~cond := #in~cond; {14080#false} is VALID [2018-11-23 12:06:09,663 INFO L273 TraceCheckUtils]: 135: Hoare triple {14080#false} assume 0 == ~cond; {14080#false} is VALID [2018-11-23 12:06:09,663 INFO L273 TraceCheckUtils]: 136: Hoare triple {14080#false} assume !false; {14080#false} is VALID [2018-11-23 12:06:09,673 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2018-11-23 12:06:09,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:09,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:06:09,696 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 137 [2018-11-23 12:06:09,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:09,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:06:09,754 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:09,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:06:09,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:06:09,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:06:09,755 INFO L87 Difference]: Start difference. First operand 142 states and 149 transitions. Second operand 20 states. [2018-11-23 12:06:11,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:11,194 INFO L93 Difference]: Finished difference Result 268 states and 288 transitions. [2018-11-23 12:06:11,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:06:11,195 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 137 [2018-11-23 12:06:11,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:11,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:06:11,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 192 transitions. [2018-11-23 12:06:11,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:06:11,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 192 transitions. [2018-11-23 12:06:11,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 192 transitions.