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_init3_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:54:47,894 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:54:47,896 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:54:47,910 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:54:47,910 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:54:47,911 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:54:47,912 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:54:47,914 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:54:47,916 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:54:47,917 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:54:47,918 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:54:47,918 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:54:47,919 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:54:47,920 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:54:47,921 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:54:47,922 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:54:47,923 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:54:47,929 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:54:47,931 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:54:47,936 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:54:47,937 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:54:47,943 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:54:47,945 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:54:47,946 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:54:47,946 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:54:47,947 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:54:47,948 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:54:47,949 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:54:47,949 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:54:47,950 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:54:47,951 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:54:47,951 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:54:47,951 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:54:47,952 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:54:47,952 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:54:47,953 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:54:47,953 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 11:54:47,968 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:54:47,969 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:54:47,969 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:54:47,970 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:54:47,970 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:54:47,970 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:54:47,971 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:54:47,971 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:54:47,971 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:54:47,971 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:54:47,971 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:54:47,972 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:54:47,972 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:54:47,972 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:54:47,972 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:54:47,972 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:54:47,973 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:54:47,973 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:54:47,973 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:54:47,973 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:54:47,973 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:54:47,974 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:54:47,974 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:54:47,974 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:54:47,974 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:54:47,974 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:54:47,975 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:54:47,975 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:54:47,975 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:54:47,975 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:54:47,975 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:54:48,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:54:48,049 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:54:48,053 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:54:48,054 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:54:48,055 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:54:48,055 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init3_false-unreach-call_ground.i [2018-11-23 11:54:48,122 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b105180b/d2ac64a4d0c147e396295313cd700b46/FLAG9e7df23e3 [2018-11-23 11:54:48,636 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:54:48,637 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init3_false-unreach-call_ground.i [2018-11-23 11:54:48,646 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b105180b/d2ac64a4d0c147e396295313cd700b46/FLAG9e7df23e3 [2018-11-23 11:54:48,956 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b105180b/d2ac64a4d0c147e396295313cd700b46 [2018-11-23 11:54:48,968 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:54:48,970 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:54:48,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:54:48,971 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:54:48,975 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:54:48,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:54:48" (1/1) ... [2018-11-23 11:54:48,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@645f74d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:48, skipping insertion in model container [2018-11-23 11:54:48,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:54:48" (1/1) ... [2018-11-23 11:54:48,992 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:54:49,018 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:54:49,258 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:54:49,262 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:54:49,287 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:54:49,319 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:54:49,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:49 WrapperNode [2018-11-23 11:54:49,320 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:54:49,321 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:54:49,321 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:54:49,322 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:54:49,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:49" (1/1) ... [2018-11-23 11:54:49,343 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:49" (1/1) ... [2018-11-23 11:54:49,352 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:54:49,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:54:49,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:54:49,353 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:54:49,363 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:49" (1/1) ... [2018-11-23 11:54:49,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:49" (1/1) ... [2018-11-23 11:54:49,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:49" (1/1) ... [2018-11-23 11:54:49,367 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:49" (1/1) ... [2018-11-23 11:54:49,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:49" (1/1) ... [2018-11-23 11:54:49,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:49" (1/1) ... [2018-11-23 11:54:49,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:49" (1/1) ... [2018-11-23 11:54:49,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:54:49,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:54:49,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:54:49,392 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:54:49,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:54:49,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:54:49,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:54:49,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:54:49,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:54:49,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:54:49,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:54:49,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:54:49,562 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:54:49,562 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:54:49,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:54:49,563 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:54:49,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:54:50,116 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:54:50,117 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 11:54:50,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:54:50 BoogieIcfgContainer [2018-11-23 11:54:50,118 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:54:50,119 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:54:50,119 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:54:50,122 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:54:50,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:54:48" (1/3) ... [2018-11-23 11:54:50,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bccc98e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:54:50, skipping insertion in model container [2018-11-23 11:54:50,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:49" (2/3) ... [2018-11-23 11:54:50,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bccc98e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:54:50, skipping insertion in model container [2018-11-23 11:54:50,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:54:50" (3/3) ... [2018-11-23 11:54:50,126 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init3_false-unreach-call_ground.i [2018-11-23 11:54:50,137 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:54:50,145 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:54:50,163 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:54:50,195 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:54:50,196 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:54:50,196 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:54:50,196 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:54:50,196 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:54:50,196 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:54:50,197 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:54:50,197 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:54:50,197 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:54:50,216 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-23 11:54:50,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:54:50,223 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:50,225 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:50,227 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:50,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:50,234 INFO L82 PathProgramCache]: Analyzing trace with hash 578824766, now seen corresponding path program 1 times [2018-11-23 11:54:50,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:50,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:50,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:50,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:50,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:50,409 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-23 11:54:50,412 INFO L273 TraceCheckUtils]: 1: Hoare triple {30#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30#true} is VALID [2018-11-23 11:54:50,413 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-23 11:54:50,413 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #74#return; {30#true} is VALID [2018-11-23 11:54:50,414 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret2 := main(); {30#true} is VALID [2018-11-23 11:54:50,414 INFO L273 TraceCheckUtils]: 5: Hoare triple {30#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {30#true} is VALID [2018-11-23 11:54:50,415 INFO L273 TraceCheckUtils]: 6: Hoare triple {30#true} assume !true; {31#false} is VALID [2018-11-23 11:54:50,415 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#false} ~i~0 := 0; {31#false} is VALID [2018-11-23 11:54:50,415 INFO L273 TraceCheckUtils]: 8: Hoare triple {31#false} assume !(~i~0 < 100000); {31#false} is VALID [2018-11-23 11:54:50,416 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#false} ~i~0 := 0; {31#false} is VALID [2018-11-23 11:54:50,416 INFO L273 TraceCheckUtils]: 10: Hoare triple {31#false} assume !(~i~0 < 100000); {31#false} is VALID [2018-11-23 11:54:50,416 INFO L273 TraceCheckUtils]: 11: Hoare triple {31#false} havoc ~x~0;~x~0 := 0; {31#false} is VALID [2018-11-23 11:54:50,418 INFO L273 TraceCheckUtils]: 12: Hoare triple {31#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {31#false} is VALID [2018-11-23 11:54:50,419 INFO L256 TraceCheckUtils]: 13: Hoare triple {31#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {31#false} is VALID [2018-11-23 11:54:50,419 INFO L273 TraceCheckUtils]: 14: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2018-11-23 11:54:50,420 INFO L273 TraceCheckUtils]: 15: Hoare triple {31#false} assume 0 == ~cond; {31#false} is VALID [2018-11-23 11:54:50,420 INFO L273 TraceCheckUtils]: 16: Hoare triple {31#false} assume !false; {31#false} is VALID [2018-11-23 11:54:50,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:50,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:54:50,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:54:50,432 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 11:54:50,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:50,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:54:50,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:50,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:54:50,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:54:50,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:54:50,590 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-23 11:54:50,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:50,733 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2018-11-23 11:54:50,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:54:50,734 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 11:54:50,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:50,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:54:50,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2018-11-23 11:54:50,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:54:50,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2018-11-23 11:54:50,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 62 transitions. [2018-11-23 11:54:51,047 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:51,058 INFO L225 Difference]: With dead ends: 47 [2018-11-23 11:54:51,059 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 11:54:51,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:54:51,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 11:54:51,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 11:54:51,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:51,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 11:54:51,117 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 11:54:51,117 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 11:54:51,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:51,121 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-23 11:54:51,121 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-23 11:54:51,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:51,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:51,122 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 11:54:51,122 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 11:54:51,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:51,127 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-23 11:54:51,127 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-23 11:54:51,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:51,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:51,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:51,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:51,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:54:51,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-23 11:54:51,133 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2018-11-23 11:54:51,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:51,133 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-23 11:54:51,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:54:51,134 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-23 11:54:51,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:54:51,135 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:51,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:51,135 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:51,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:51,136 INFO L82 PathProgramCache]: Analyzing trace with hash -823304390, now seen corresponding path program 1 times [2018-11-23 11:54:51,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:51,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:51,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:51,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:51,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:51,253 INFO L256 TraceCheckUtils]: 0: Hoare triple {172#true} call ULTIMATE.init(); {172#true} is VALID [2018-11-23 11:54:51,253 INFO L273 TraceCheckUtils]: 1: Hoare triple {172#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {172#true} is VALID [2018-11-23 11:54:51,254 INFO L273 TraceCheckUtils]: 2: Hoare triple {172#true} assume true; {172#true} is VALID [2018-11-23 11:54:51,254 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {172#true} {172#true} #74#return; {172#true} is VALID [2018-11-23 11:54:51,254 INFO L256 TraceCheckUtils]: 4: Hoare triple {172#true} call #t~ret2 := main(); {172#true} is VALID [2018-11-23 11:54:51,267 INFO L273 TraceCheckUtils]: 5: Hoare triple {172#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {174#(= main_~i~0 0)} is VALID [2018-11-23 11:54:51,280 INFO L273 TraceCheckUtils]: 6: Hoare triple {174#(= main_~i~0 0)} assume !(~i~0 < 100000); {173#false} is VALID [2018-11-23 11:54:51,281 INFO L273 TraceCheckUtils]: 7: Hoare triple {173#false} ~i~0 := 0; {173#false} is VALID [2018-11-23 11:54:51,281 INFO L273 TraceCheckUtils]: 8: Hoare triple {173#false} assume !(~i~0 < 100000); {173#false} is VALID [2018-11-23 11:54:51,282 INFO L273 TraceCheckUtils]: 9: Hoare triple {173#false} ~i~0 := 0; {173#false} is VALID [2018-11-23 11:54:51,282 INFO L273 TraceCheckUtils]: 10: Hoare triple {173#false} assume !(~i~0 < 100000); {173#false} is VALID [2018-11-23 11:54:51,282 INFO L273 TraceCheckUtils]: 11: Hoare triple {173#false} havoc ~x~0;~x~0 := 0; {173#false} is VALID [2018-11-23 11:54:51,283 INFO L273 TraceCheckUtils]: 12: Hoare triple {173#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {173#false} is VALID [2018-11-23 11:54:51,283 INFO L256 TraceCheckUtils]: 13: Hoare triple {173#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {173#false} is VALID [2018-11-23 11:54:51,283 INFO L273 TraceCheckUtils]: 14: Hoare triple {173#false} ~cond := #in~cond; {173#false} is VALID [2018-11-23 11:54:51,284 INFO L273 TraceCheckUtils]: 15: Hoare triple {173#false} assume 0 == ~cond; {173#false} is VALID [2018-11-23 11:54:51,284 INFO L273 TraceCheckUtils]: 16: Hoare triple {173#false} assume !false; {173#false} is VALID [2018-11-23 11:54:51,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:51,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:54:51,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:54:51,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 11:54:51,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:51,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:54:51,393 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:51,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:54:51,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:54:51,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:54:51,395 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 3 states. [2018-11-23 11:54:51,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:51,569 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-23 11:54:51,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:54:51,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 11:54:51,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:51,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:54:51,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2018-11-23 11:54:51,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:54:51,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2018-11-23 11:54:51,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2018-11-23 11:54:51,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:51,965 INFO L225 Difference]: With dead ends: 40 [2018-11-23 11:54:51,966 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 11:54:51,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:54:51,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 11:54:51,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 11:54:51,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:51,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 11:54:51,992 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 11:54:51,993 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 11:54:51,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:51,995 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 11:54:51,995 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 11:54:51,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:51,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:51,996 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 11:54:51,996 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 11:54:51,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:51,999 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 11:54:51,999 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 11:54:52,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:52,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:52,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:52,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:52,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:54:52,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-23 11:54:52,003 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2018-11-23 11:54:52,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:52,003 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-23 11:54:52,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:54:52,004 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 11:54:52,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:54:52,004 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:52,005 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] [2018-11-23 11:54:52,005 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:52,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:52,005 INFO L82 PathProgramCache]: Analyzing trace with hash 3753729, now seen corresponding path program 1 times [2018-11-23 11:54:52,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:52,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:52,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:52,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:52,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:52,106 INFO L256 TraceCheckUtils]: 0: Hoare triple {323#true} call ULTIMATE.init(); {323#true} is VALID [2018-11-23 11:54:52,107 INFO L273 TraceCheckUtils]: 1: Hoare triple {323#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {323#true} is VALID [2018-11-23 11:54:52,107 INFO L273 TraceCheckUtils]: 2: Hoare triple {323#true} assume true; {323#true} is VALID [2018-11-23 11:54:52,107 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {323#true} {323#true} #74#return; {323#true} is VALID [2018-11-23 11:54:52,108 INFO L256 TraceCheckUtils]: 4: Hoare triple {323#true} call #t~ret2 := main(); {323#true} is VALID [2018-11-23 11:54:52,111 INFO L273 TraceCheckUtils]: 5: Hoare triple {323#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {325#(= main_~i~0 0)} is VALID [2018-11-23 11:54:52,114 INFO L273 TraceCheckUtils]: 6: Hoare triple {325#(= 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; {326#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:52,115 INFO L273 TraceCheckUtils]: 7: Hoare triple {326#(<= main_~i~0 1)} assume !(~i~0 < 100000); {324#false} is VALID [2018-11-23 11:54:52,115 INFO L273 TraceCheckUtils]: 8: Hoare triple {324#false} ~i~0 := 0; {324#false} is VALID [2018-11-23 11:54:52,115 INFO L273 TraceCheckUtils]: 9: Hoare triple {324#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {324#false} is VALID [2018-11-23 11:54:52,115 INFO L273 TraceCheckUtils]: 10: Hoare triple {324#false} assume !(~i~0 < 100000); {324#false} is VALID [2018-11-23 11:54:52,116 INFO L273 TraceCheckUtils]: 11: Hoare triple {324#false} ~i~0 := 0; {324#false} is VALID [2018-11-23 11:54:52,116 INFO L273 TraceCheckUtils]: 12: Hoare triple {324#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {324#false} is VALID [2018-11-23 11:54:52,116 INFO L273 TraceCheckUtils]: 13: Hoare triple {324#false} assume !(~i~0 < 100000); {324#false} is VALID [2018-11-23 11:54:52,116 INFO L273 TraceCheckUtils]: 14: Hoare triple {324#false} havoc ~x~0;~x~0 := 0; {324#false} is VALID [2018-11-23 11:54:52,117 INFO L273 TraceCheckUtils]: 15: Hoare triple {324#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {324#false} is VALID [2018-11-23 11:54:52,117 INFO L256 TraceCheckUtils]: 16: Hoare triple {324#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {324#false} is VALID [2018-11-23 11:54:52,118 INFO L273 TraceCheckUtils]: 17: Hoare triple {324#false} ~cond := #in~cond; {324#false} is VALID [2018-11-23 11:54:52,118 INFO L273 TraceCheckUtils]: 18: Hoare triple {324#false} assume 0 == ~cond; {324#false} is VALID [2018-11-23 11:54:52,118 INFO L273 TraceCheckUtils]: 19: Hoare triple {324#false} assume !false; {324#false} is VALID [2018-11-23 11:54:52,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:54:52,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:52,120 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:52,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:52,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:52,343 INFO L256 TraceCheckUtils]: 0: Hoare triple {323#true} call ULTIMATE.init(); {323#true} is VALID [2018-11-23 11:54:52,343 INFO L273 TraceCheckUtils]: 1: Hoare triple {323#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {323#true} is VALID [2018-11-23 11:54:52,344 INFO L273 TraceCheckUtils]: 2: Hoare triple {323#true} assume true; {323#true} is VALID [2018-11-23 11:54:52,344 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {323#true} {323#true} #74#return; {323#true} is VALID [2018-11-23 11:54:52,344 INFO L256 TraceCheckUtils]: 4: Hoare triple {323#true} call #t~ret2 := main(); {323#true} is VALID [2018-11-23 11:54:52,345 INFO L273 TraceCheckUtils]: 5: Hoare triple {323#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {345#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:52,346 INFO L273 TraceCheckUtils]: 6: Hoare triple {345#(<= 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; {326#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:52,347 INFO L273 TraceCheckUtils]: 7: Hoare triple {326#(<= main_~i~0 1)} assume !(~i~0 < 100000); {324#false} is VALID [2018-11-23 11:54:52,347 INFO L273 TraceCheckUtils]: 8: Hoare triple {324#false} ~i~0 := 0; {324#false} is VALID [2018-11-23 11:54:52,348 INFO L273 TraceCheckUtils]: 9: Hoare triple {324#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {324#false} is VALID [2018-11-23 11:54:52,348 INFO L273 TraceCheckUtils]: 10: Hoare triple {324#false} assume !(~i~0 < 100000); {324#false} is VALID [2018-11-23 11:54:52,348 INFO L273 TraceCheckUtils]: 11: Hoare triple {324#false} ~i~0 := 0; {324#false} is VALID [2018-11-23 11:54:52,349 INFO L273 TraceCheckUtils]: 12: Hoare triple {324#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {324#false} is VALID [2018-11-23 11:54:52,349 INFO L273 TraceCheckUtils]: 13: Hoare triple {324#false} assume !(~i~0 < 100000); {324#false} is VALID [2018-11-23 11:54:52,349 INFO L273 TraceCheckUtils]: 14: Hoare triple {324#false} havoc ~x~0;~x~0 := 0; {324#false} is VALID [2018-11-23 11:54:52,350 INFO L273 TraceCheckUtils]: 15: Hoare triple {324#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {324#false} is VALID [2018-11-23 11:54:52,350 INFO L256 TraceCheckUtils]: 16: Hoare triple {324#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {324#false} is VALID [2018-11-23 11:54:52,351 INFO L273 TraceCheckUtils]: 17: Hoare triple {324#false} ~cond := #in~cond; {324#false} is VALID [2018-11-23 11:54:52,351 INFO L273 TraceCheckUtils]: 18: Hoare triple {324#false} assume 0 == ~cond; {324#false} is VALID [2018-11-23 11:54:52,351 INFO L273 TraceCheckUtils]: 19: Hoare triple {324#false} assume !false; {324#false} is VALID [2018-11-23 11:54:52,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:54:52,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:52,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:54:52,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 11:54:52,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:52,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:54:52,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:52,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:54:52,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:54:52,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:54:52,413 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2018-11-23 11:54:52,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:52,847 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2018-11-23 11:54:52,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:54:52,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 11:54:52,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:52,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:54:52,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2018-11-23 11:54:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:54:52,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2018-11-23 11:54:52,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2018-11-23 11:54:52,966 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:52,968 INFO L225 Difference]: With dead ends: 45 [2018-11-23 11:54:52,969 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 11:54:52,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:54:52,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 11:54:52,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 11:54:53,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:53,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 11:54:53,000 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 11:54:53,000 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 11:54:53,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:53,003 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-23 11:54:53,003 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-23 11:54:53,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:53,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:53,004 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 11:54:53,004 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 11:54:53,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:53,007 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-23 11:54:53,007 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-23 11:54:53,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:53,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:53,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:53,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:53,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:54:53,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-23 11:54:53,010 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 20 [2018-11-23 11:54:53,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:53,011 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-23 11:54:53,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:54:53,011 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-23 11:54:53,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:54:53,012 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:53,012 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:53,012 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:53,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:53,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1185149478, now seen corresponding path program 2 times [2018-11-23 11:54:53,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:53,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:53,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:53,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:53,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:53,167 INFO L256 TraceCheckUtils]: 0: Hoare triple {555#true} call ULTIMATE.init(); {555#true} is VALID [2018-11-23 11:54:53,167 INFO L273 TraceCheckUtils]: 1: Hoare triple {555#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {555#true} is VALID [2018-11-23 11:54:53,168 INFO L273 TraceCheckUtils]: 2: Hoare triple {555#true} assume true; {555#true} is VALID [2018-11-23 11:54:53,168 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {555#true} {555#true} #74#return; {555#true} is VALID [2018-11-23 11:54:53,169 INFO L256 TraceCheckUtils]: 4: Hoare triple {555#true} call #t~ret2 := main(); {555#true} is VALID [2018-11-23 11:54:53,169 INFO L273 TraceCheckUtils]: 5: Hoare triple {555#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {557#(= main_~i~0 0)} is VALID [2018-11-23 11:54:53,170 INFO L273 TraceCheckUtils]: 6: Hoare triple {557#(= 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; {558#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:53,171 INFO L273 TraceCheckUtils]: 7: Hoare triple {558#(<= 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; {559#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:53,172 INFO L273 TraceCheckUtils]: 8: Hoare triple {559#(<= main_~i~0 2)} assume !(~i~0 < 100000); {556#false} is VALID [2018-11-23 11:54:53,172 INFO L273 TraceCheckUtils]: 9: Hoare triple {556#false} ~i~0 := 0; {556#false} is VALID [2018-11-23 11:54:53,173 INFO L273 TraceCheckUtils]: 10: Hoare triple {556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {556#false} is VALID [2018-11-23 11:54:53,173 INFO L273 TraceCheckUtils]: 11: Hoare triple {556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {556#false} is VALID [2018-11-23 11:54:53,173 INFO L273 TraceCheckUtils]: 12: Hoare triple {556#false} assume !(~i~0 < 100000); {556#false} is VALID [2018-11-23 11:54:53,174 INFO L273 TraceCheckUtils]: 13: Hoare triple {556#false} ~i~0 := 0; {556#false} is VALID [2018-11-23 11:54:53,174 INFO L273 TraceCheckUtils]: 14: Hoare triple {556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {556#false} is VALID [2018-11-23 11:54:53,175 INFO L273 TraceCheckUtils]: 15: Hoare triple {556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {556#false} is VALID [2018-11-23 11:54:53,175 INFO L273 TraceCheckUtils]: 16: Hoare triple {556#false} assume !(~i~0 < 100000); {556#false} is VALID [2018-11-23 11:54:53,175 INFO L273 TraceCheckUtils]: 17: Hoare triple {556#false} havoc ~x~0;~x~0 := 0; {556#false} is VALID [2018-11-23 11:54:53,175 INFO L273 TraceCheckUtils]: 18: Hoare triple {556#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {556#false} is VALID [2018-11-23 11:54:53,176 INFO L256 TraceCheckUtils]: 19: Hoare triple {556#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {556#false} is VALID [2018-11-23 11:54:53,176 INFO L273 TraceCheckUtils]: 20: Hoare triple {556#false} ~cond := #in~cond; {556#false} is VALID [2018-11-23 11:54:53,176 INFO L273 TraceCheckUtils]: 21: Hoare triple {556#false} assume 0 == ~cond; {556#false} is VALID [2018-11-23 11:54:53,176 INFO L273 TraceCheckUtils]: 22: Hoare triple {556#false} assume !false; {556#false} is VALID [2018-11-23 11:54:53,178 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 11:54:53,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:53,178 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:53,197 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:54:53,243 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:54:53,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:53,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:53,327 INFO L256 TraceCheckUtils]: 0: Hoare triple {555#true} call ULTIMATE.init(); {555#true} is VALID [2018-11-23 11:54:53,327 INFO L273 TraceCheckUtils]: 1: Hoare triple {555#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {555#true} is VALID [2018-11-23 11:54:53,328 INFO L273 TraceCheckUtils]: 2: Hoare triple {555#true} assume true; {555#true} is VALID [2018-11-23 11:54:53,328 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {555#true} {555#true} #74#return; {555#true} is VALID [2018-11-23 11:54:53,328 INFO L256 TraceCheckUtils]: 4: Hoare triple {555#true} call #t~ret2 := main(); {555#true} is VALID [2018-11-23 11:54:53,329 INFO L273 TraceCheckUtils]: 5: Hoare triple {555#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {578#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:53,330 INFO L273 TraceCheckUtils]: 6: Hoare triple {578#(<= 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; {558#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:53,330 INFO L273 TraceCheckUtils]: 7: Hoare triple {558#(<= 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; {559#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:53,331 INFO L273 TraceCheckUtils]: 8: Hoare triple {559#(<= main_~i~0 2)} assume !(~i~0 < 100000); {556#false} is VALID [2018-11-23 11:54:53,331 INFO L273 TraceCheckUtils]: 9: Hoare triple {556#false} ~i~0 := 0; {556#false} is VALID [2018-11-23 11:54:53,332 INFO L273 TraceCheckUtils]: 10: Hoare triple {556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {556#false} is VALID [2018-11-23 11:54:53,332 INFO L273 TraceCheckUtils]: 11: Hoare triple {556#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {556#false} is VALID [2018-11-23 11:54:53,332 INFO L273 TraceCheckUtils]: 12: Hoare triple {556#false} assume !(~i~0 < 100000); {556#false} is VALID [2018-11-23 11:54:53,333 INFO L273 TraceCheckUtils]: 13: Hoare triple {556#false} ~i~0 := 0; {556#false} is VALID [2018-11-23 11:54:53,333 INFO L273 TraceCheckUtils]: 14: Hoare triple {556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {556#false} is VALID [2018-11-23 11:54:53,334 INFO L273 TraceCheckUtils]: 15: Hoare triple {556#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {556#false} is VALID [2018-11-23 11:54:53,334 INFO L273 TraceCheckUtils]: 16: Hoare triple {556#false} assume !(~i~0 < 100000); {556#false} is VALID [2018-11-23 11:54:53,335 INFO L273 TraceCheckUtils]: 17: Hoare triple {556#false} havoc ~x~0;~x~0 := 0; {556#false} is VALID [2018-11-23 11:54:53,335 INFO L273 TraceCheckUtils]: 18: Hoare triple {556#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {556#false} is VALID [2018-11-23 11:54:53,335 INFO L256 TraceCheckUtils]: 19: Hoare triple {556#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {556#false} is VALID [2018-11-23 11:54:53,336 INFO L273 TraceCheckUtils]: 20: Hoare triple {556#false} ~cond := #in~cond; {556#false} is VALID [2018-11-23 11:54:53,336 INFO L273 TraceCheckUtils]: 21: Hoare triple {556#false} assume 0 == ~cond; {556#false} is VALID [2018-11-23 11:54:53,336 INFO L273 TraceCheckUtils]: 22: Hoare triple {556#false} assume !false; {556#false} is VALID [2018-11-23 11:54:53,337 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 11:54:53,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:53,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 11:54:53,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-23 11:54:53,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:53,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:54:53,397 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:53,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:54:53,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:54:53,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:54:53,398 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 6 states. [2018-11-23 11:54:53,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:53,632 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-23 11:54:53,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:54:53,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-23 11:54:53,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:53,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:54:53,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2018-11-23 11:54:53,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:54:53,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2018-11-23 11:54:53,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2018-11-23 11:54:53,712 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 11:54:53,714 INFO L225 Difference]: With dead ends: 50 [2018-11-23 11:54:53,715 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 11:54:53,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:54:53,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 11:54:53,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 11:54:53,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:53,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-23 11:54:53,741 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 11:54:53,741 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 11:54:53,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:53,745 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-23 11:54:53,745 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-23 11:54:53,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:53,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:53,746 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 11:54:53,746 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 11:54:53,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:53,748 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-23 11:54:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-23 11:54:53,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:53,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:53,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:53,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:53,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:54:53,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-23 11:54:53,751 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 23 [2018-11-23 11:54:53,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:53,752 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-23 11:54:53,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:54:53,752 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-23 11:54:53,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:54:53,753 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:53,753 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:53,754 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:53,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:53,754 INFO L82 PathProgramCache]: Analyzing trace with hash 455820257, now seen corresponding path program 3 times [2018-11-23 11:54:53,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:53,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:53,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:53,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:53,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:53,901 INFO L256 TraceCheckUtils]: 0: Hoare triple {819#true} call ULTIMATE.init(); {819#true} is VALID [2018-11-23 11:54:53,902 INFO L273 TraceCheckUtils]: 1: Hoare triple {819#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {819#true} is VALID [2018-11-23 11:54:53,902 INFO L273 TraceCheckUtils]: 2: Hoare triple {819#true} assume true; {819#true} is VALID [2018-11-23 11:54:53,902 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {819#true} {819#true} #74#return; {819#true} is VALID [2018-11-23 11:54:53,903 INFO L256 TraceCheckUtils]: 4: Hoare triple {819#true} call #t~ret2 := main(); {819#true} is VALID [2018-11-23 11:54:53,916 INFO L273 TraceCheckUtils]: 5: Hoare triple {819#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {821#(= main_~i~0 0)} is VALID [2018-11-23 11:54:53,931 INFO L273 TraceCheckUtils]: 6: Hoare triple {821#(= 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; {822#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:53,940 INFO L273 TraceCheckUtils]: 7: Hoare triple {822#(<= 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; {823#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:53,954 INFO L273 TraceCheckUtils]: 8: Hoare triple {823#(<= 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; {824#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:53,964 INFO L273 TraceCheckUtils]: 9: Hoare triple {824#(<= main_~i~0 3)} assume !(~i~0 < 100000); {820#false} is VALID [2018-11-23 11:54:53,965 INFO L273 TraceCheckUtils]: 10: Hoare triple {820#false} ~i~0 := 0; {820#false} is VALID [2018-11-23 11:54:53,965 INFO L273 TraceCheckUtils]: 11: Hoare triple {820#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {820#false} is VALID [2018-11-23 11:54:53,966 INFO L273 TraceCheckUtils]: 12: Hoare triple {820#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {820#false} is VALID [2018-11-23 11:54:53,966 INFO L273 TraceCheckUtils]: 13: Hoare triple {820#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {820#false} is VALID [2018-11-23 11:54:53,966 INFO L273 TraceCheckUtils]: 14: Hoare triple {820#false} assume !(~i~0 < 100000); {820#false} is VALID [2018-11-23 11:54:53,966 INFO L273 TraceCheckUtils]: 15: Hoare triple {820#false} ~i~0 := 0; {820#false} is VALID [2018-11-23 11:54:53,967 INFO L273 TraceCheckUtils]: 16: Hoare triple {820#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {820#false} is VALID [2018-11-23 11:54:53,967 INFO L273 TraceCheckUtils]: 17: Hoare triple {820#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {820#false} is VALID [2018-11-23 11:54:53,967 INFO L273 TraceCheckUtils]: 18: Hoare triple {820#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {820#false} is VALID [2018-11-23 11:54:53,967 INFO L273 TraceCheckUtils]: 19: Hoare triple {820#false} assume !(~i~0 < 100000); {820#false} is VALID [2018-11-23 11:54:53,968 INFO L273 TraceCheckUtils]: 20: Hoare triple {820#false} havoc ~x~0;~x~0 := 0; {820#false} is VALID [2018-11-23 11:54:53,968 INFO L273 TraceCheckUtils]: 21: Hoare triple {820#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {820#false} is VALID [2018-11-23 11:54:53,968 INFO L256 TraceCheckUtils]: 22: Hoare triple {820#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {820#false} is VALID [2018-11-23 11:54:53,968 INFO L273 TraceCheckUtils]: 23: Hoare triple {820#false} ~cond := #in~cond; {820#false} is VALID [2018-11-23 11:54:53,969 INFO L273 TraceCheckUtils]: 24: Hoare triple {820#false} assume 0 == ~cond; {820#false} is VALID [2018-11-23 11:54:53,969 INFO L273 TraceCheckUtils]: 25: Hoare triple {820#false} assume !false; {820#false} is VALID [2018-11-23 11:54:53,970 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 11:54:53,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:53,971 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:53,982 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:54:54,008 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:54:54,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:54,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:54,098 INFO L256 TraceCheckUtils]: 0: Hoare triple {819#true} call ULTIMATE.init(); {819#true} is VALID [2018-11-23 11:54:54,098 INFO L273 TraceCheckUtils]: 1: Hoare triple {819#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {819#true} is VALID [2018-11-23 11:54:54,098 INFO L273 TraceCheckUtils]: 2: Hoare triple {819#true} assume true; {819#true} is VALID [2018-11-23 11:54:54,099 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {819#true} {819#true} #74#return; {819#true} is VALID [2018-11-23 11:54:54,099 INFO L256 TraceCheckUtils]: 4: Hoare triple {819#true} call #t~ret2 := main(); {819#true} is VALID [2018-11-23 11:54:54,099 INFO L273 TraceCheckUtils]: 5: Hoare triple {819#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {819#true} is VALID [2018-11-23 11:54:54,099 INFO L273 TraceCheckUtils]: 6: Hoare triple {819#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {819#true} is VALID [2018-11-23 11:54:54,099 INFO L273 TraceCheckUtils]: 7: Hoare triple {819#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {819#true} is VALID [2018-11-23 11:54:54,100 INFO L273 TraceCheckUtils]: 8: Hoare triple {819#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {819#true} is VALID [2018-11-23 11:54:54,100 INFO L273 TraceCheckUtils]: 9: Hoare triple {819#true} assume !(~i~0 < 100000); {819#true} is VALID [2018-11-23 11:54:54,100 INFO L273 TraceCheckUtils]: 10: Hoare triple {819#true} ~i~0 := 0; {819#true} is VALID [2018-11-23 11:54:54,100 INFO L273 TraceCheckUtils]: 11: Hoare triple {819#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {819#true} is VALID [2018-11-23 11:54:54,101 INFO L273 TraceCheckUtils]: 12: Hoare triple {819#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {819#true} is VALID [2018-11-23 11:54:54,101 INFO L273 TraceCheckUtils]: 13: Hoare triple {819#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {819#true} is VALID [2018-11-23 11:54:54,101 INFO L273 TraceCheckUtils]: 14: Hoare triple {819#true} assume !(~i~0 < 100000); {819#true} is VALID [2018-11-23 11:54:54,102 INFO L273 TraceCheckUtils]: 15: Hoare triple {819#true} ~i~0 := 0; {873#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:54,103 INFO L273 TraceCheckUtils]: 16: Hoare triple {873#(<= 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; {822#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:54,103 INFO L273 TraceCheckUtils]: 17: Hoare triple {822#(<= 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; {823#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:54,105 INFO L273 TraceCheckUtils]: 18: Hoare triple {823#(<= 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; {824#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:54,105 INFO L273 TraceCheckUtils]: 19: Hoare triple {824#(<= main_~i~0 3)} assume !(~i~0 < 100000); {820#false} is VALID [2018-11-23 11:54:54,106 INFO L273 TraceCheckUtils]: 20: Hoare triple {820#false} havoc ~x~0;~x~0 := 0; {820#false} is VALID [2018-11-23 11:54:54,106 INFO L273 TraceCheckUtils]: 21: Hoare triple {820#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {820#false} is VALID [2018-11-23 11:54:54,106 INFO L256 TraceCheckUtils]: 22: Hoare triple {820#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {820#false} is VALID [2018-11-23 11:54:54,106 INFO L273 TraceCheckUtils]: 23: Hoare triple {820#false} ~cond := #in~cond; {820#false} is VALID [2018-11-23 11:54:54,107 INFO L273 TraceCheckUtils]: 24: Hoare triple {820#false} assume 0 == ~cond; {820#false} is VALID [2018-11-23 11:54:54,107 INFO L273 TraceCheckUtils]: 25: Hoare triple {820#false} assume !false; {820#false} is VALID [2018-11-23 11:54:54,109 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 11:54:54,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:54,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 11:54:54,129 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 11:54:54,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:54,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:54:54,174 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:54,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:54:54,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:54:54,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:54:54,175 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 7 states. [2018-11-23 11:54:54,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:54,453 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-23 11:54:54,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:54:54,453 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 11:54:54,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:54,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:54:54,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2018-11-23 11:54:54,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:54:54,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2018-11-23 11:54:54,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2018-11-23 11:54:54,582 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:54,586 INFO L225 Difference]: With dead ends: 55 [2018-11-23 11:54:54,586 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 11:54:54,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:54:54,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 11:54:54,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 11:54:54,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:54,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-23 11:54:54,623 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 11:54:54,623 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 11:54:54,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:54,626 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 11:54:54,627 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 11:54:54,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:54,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:54,628 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 11:54:54,628 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 11:54:54,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:54,630 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 11:54:54,630 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 11:54:54,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:54,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:54,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:54,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:54,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:54:54,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-23 11:54:54,634 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 26 [2018-11-23 11:54:54,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:54,634 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-23 11:54:54,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:54:54,634 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 11:54:54,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:54:54,636 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:54,636 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:54,636 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:54,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:54,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1002382458, now seen corresponding path program 4 times [2018-11-23 11:54:54,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:54,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:54,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:54,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:54,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:54,798 INFO L256 TraceCheckUtils]: 0: Hoare triple {1115#true} call ULTIMATE.init(); {1115#true} is VALID [2018-11-23 11:54:54,798 INFO L273 TraceCheckUtils]: 1: Hoare triple {1115#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1115#true} is VALID [2018-11-23 11:54:54,799 INFO L273 TraceCheckUtils]: 2: Hoare triple {1115#true} assume true; {1115#true} is VALID [2018-11-23 11:54:54,799 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1115#true} {1115#true} #74#return; {1115#true} is VALID [2018-11-23 11:54:54,800 INFO L256 TraceCheckUtils]: 4: Hoare triple {1115#true} call #t~ret2 := main(); {1115#true} is VALID [2018-11-23 11:54:54,800 INFO L273 TraceCheckUtils]: 5: Hoare triple {1115#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1117#(= main_~i~0 0)} is VALID [2018-11-23 11:54:54,801 INFO L273 TraceCheckUtils]: 6: Hoare triple {1117#(= 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; {1118#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:54,802 INFO L273 TraceCheckUtils]: 7: Hoare triple {1118#(<= 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; {1119#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:54,803 INFO L273 TraceCheckUtils]: 8: Hoare triple {1119#(<= 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; {1120#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:54,804 INFO L273 TraceCheckUtils]: 9: Hoare triple {1120#(<= 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; {1121#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:54,804 INFO L273 TraceCheckUtils]: 10: Hoare triple {1121#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1116#false} is VALID [2018-11-23 11:54:54,804 INFO L273 TraceCheckUtils]: 11: Hoare triple {1116#false} ~i~0 := 0; {1116#false} is VALID [2018-11-23 11:54:54,805 INFO L273 TraceCheckUtils]: 12: Hoare triple {1116#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1116#false} is VALID [2018-11-23 11:54:54,805 INFO L273 TraceCheckUtils]: 13: Hoare triple {1116#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1116#false} is VALID [2018-11-23 11:54:54,805 INFO L273 TraceCheckUtils]: 14: Hoare triple {1116#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1116#false} is VALID [2018-11-23 11:54:54,806 INFO L273 TraceCheckUtils]: 15: Hoare triple {1116#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1116#false} is VALID [2018-11-23 11:54:54,806 INFO L273 TraceCheckUtils]: 16: Hoare triple {1116#false} assume !(~i~0 < 100000); {1116#false} is VALID [2018-11-23 11:54:54,806 INFO L273 TraceCheckUtils]: 17: Hoare triple {1116#false} ~i~0 := 0; {1116#false} is VALID [2018-11-23 11:54:54,807 INFO L273 TraceCheckUtils]: 18: Hoare triple {1116#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1116#false} is VALID [2018-11-23 11:54:54,807 INFO L273 TraceCheckUtils]: 19: Hoare triple {1116#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1116#false} is VALID [2018-11-23 11:54:54,808 INFO L273 TraceCheckUtils]: 20: Hoare triple {1116#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1116#false} is VALID [2018-11-23 11:54:54,808 INFO L273 TraceCheckUtils]: 21: Hoare triple {1116#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1116#false} is VALID [2018-11-23 11:54:54,809 INFO L273 TraceCheckUtils]: 22: Hoare triple {1116#false} assume !(~i~0 < 100000); {1116#false} is VALID [2018-11-23 11:54:54,809 INFO L273 TraceCheckUtils]: 23: Hoare triple {1116#false} havoc ~x~0;~x~0 := 0; {1116#false} is VALID [2018-11-23 11:54:54,809 INFO L273 TraceCheckUtils]: 24: Hoare triple {1116#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1116#false} is VALID [2018-11-23 11:54:54,810 INFO L256 TraceCheckUtils]: 25: Hoare triple {1116#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {1116#false} is VALID [2018-11-23 11:54:54,810 INFO L273 TraceCheckUtils]: 26: Hoare triple {1116#false} ~cond := #in~cond; {1116#false} is VALID [2018-11-23 11:54:54,810 INFO L273 TraceCheckUtils]: 27: Hoare triple {1116#false} assume 0 == ~cond; {1116#false} is VALID [2018-11-23 11:54:54,810 INFO L273 TraceCheckUtils]: 28: Hoare triple {1116#false} assume !false; {1116#false} is VALID [2018-11-23 11:54:54,812 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 11:54:54,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:54,812 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:54,829 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:54:54,863 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:54:54,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:54,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:55,050 INFO L256 TraceCheckUtils]: 0: Hoare triple {1115#true} call ULTIMATE.init(); {1115#true} is VALID [2018-11-23 11:54:55,051 INFO L273 TraceCheckUtils]: 1: Hoare triple {1115#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1115#true} is VALID [2018-11-23 11:54:55,051 INFO L273 TraceCheckUtils]: 2: Hoare triple {1115#true} assume true; {1115#true} is VALID [2018-11-23 11:54:55,052 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1115#true} {1115#true} #74#return; {1115#true} is VALID [2018-11-23 11:54:55,052 INFO L256 TraceCheckUtils]: 4: Hoare triple {1115#true} call #t~ret2 := main(); {1115#true} is VALID [2018-11-23 11:54:55,058 INFO L273 TraceCheckUtils]: 5: Hoare triple {1115#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1140#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:55,060 INFO L273 TraceCheckUtils]: 6: Hoare triple {1140#(<= 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; {1118#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:55,060 INFO L273 TraceCheckUtils]: 7: Hoare triple {1118#(<= 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; {1119#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:55,061 INFO L273 TraceCheckUtils]: 8: Hoare triple {1119#(<= 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; {1120#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:55,070 INFO L273 TraceCheckUtils]: 9: Hoare triple {1120#(<= 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; {1121#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:55,071 INFO L273 TraceCheckUtils]: 10: Hoare triple {1121#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1116#false} is VALID [2018-11-23 11:54:55,071 INFO L273 TraceCheckUtils]: 11: Hoare triple {1116#false} ~i~0 := 0; {1116#false} is VALID [2018-11-23 11:54:55,072 INFO L273 TraceCheckUtils]: 12: Hoare triple {1116#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1116#false} is VALID [2018-11-23 11:54:55,072 INFO L273 TraceCheckUtils]: 13: Hoare triple {1116#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1116#false} is VALID [2018-11-23 11:54:55,072 INFO L273 TraceCheckUtils]: 14: Hoare triple {1116#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1116#false} is VALID [2018-11-23 11:54:55,072 INFO L273 TraceCheckUtils]: 15: Hoare triple {1116#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1116#false} is VALID [2018-11-23 11:54:55,072 INFO L273 TraceCheckUtils]: 16: Hoare triple {1116#false} assume !(~i~0 < 100000); {1116#false} is VALID [2018-11-23 11:54:55,073 INFO L273 TraceCheckUtils]: 17: Hoare triple {1116#false} ~i~0 := 0; {1116#false} is VALID [2018-11-23 11:54:55,073 INFO L273 TraceCheckUtils]: 18: Hoare triple {1116#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1116#false} is VALID [2018-11-23 11:54:55,073 INFO L273 TraceCheckUtils]: 19: Hoare triple {1116#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1116#false} is VALID [2018-11-23 11:54:55,074 INFO L273 TraceCheckUtils]: 20: Hoare triple {1116#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1116#false} is VALID [2018-11-23 11:54:55,074 INFO L273 TraceCheckUtils]: 21: Hoare triple {1116#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1116#false} is VALID [2018-11-23 11:54:55,074 INFO L273 TraceCheckUtils]: 22: Hoare triple {1116#false} assume !(~i~0 < 100000); {1116#false} is VALID [2018-11-23 11:54:55,074 INFO L273 TraceCheckUtils]: 23: Hoare triple {1116#false} havoc ~x~0;~x~0 := 0; {1116#false} is VALID [2018-11-23 11:54:55,074 INFO L273 TraceCheckUtils]: 24: Hoare triple {1116#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1116#false} is VALID [2018-11-23 11:54:55,075 INFO L256 TraceCheckUtils]: 25: Hoare triple {1116#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {1116#false} is VALID [2018-11-23 11:54:55,075 INFO L273 TraceCheckUtils]: 26: Hoare triple {1116#false} ~cond := #in~cond; {1116#false} is VALID [2018-11-23 11:54:55,075 INFO L273 TraceCheckUtils]: 27: Hoare triple {1116#false} assume 0 == ~cond; {1116#false} is VALID [2018-11-23 11:54:55,076 INFO L273 TraceCheckUtils]: 28: Hoare triple {1116#false} assume !false; {1116#false} is VALID [2018-11-23 11:54:55,077 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 11:54:55,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:55,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 11:54:55,100 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-23 11:54:55,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:55,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:54:55,132 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 11:54:55,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:54:55,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:54:55,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:54:55,134 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 8 states. [2018-11-23 11:54:55,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:55,393 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-11-23 11:54:55,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:54:55,393 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-23 11:54:55,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:55,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:54:55,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2018-11-23 11:54:55,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:54:55,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2018-11-23 11:54:55,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2018-11-23 11:54:55,537 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:55,539 INFO L225 Difference]: With dead ends: 60 [2018-11-23 11:54:55,539 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 11:54:55,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:54:55,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 11:54:55,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 11:54:55,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:55,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-23 11:54:55,576 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 11:54:55,576 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 11:54:55,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:55,578 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-23 11:54:55,578 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-23 11:54:55,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:55,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:55,579 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 11:54:55,580 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 11:54:55,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:55,582 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-23 11:54:55,582 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-23 11:54:55,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:55,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:55,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:55,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:55,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:54:55,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-11-23 11:54:55,585 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 29 [2018-11-23 11:54:55,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:55,586 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-23 11:54:55,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:54:55,586 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-23 11:54:55,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 11:54:55,587 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:55,587 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:55,587 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:55,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:55,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1395779391, now seen corresponding path program 5 times [2018-11-23 11:54:55,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:55,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:55,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:55,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:55,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:55,740 INFO L256 TraceCheckUtils]: 0: Hoare triple {1443#true} call ULTIMATE.init(); {1443#true} is VALID [2018-11-23 11:54:55,740 INFO L273 TraceCheckUtils]: 1: Hoare triple {1443#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1443#true} is VALID [2018-11-23 11:54:55,741 INFO L273 TraceCheckUtils]: 2: Hoare triple {1443#true} assume true; {1443#true} is VALID [2018-11-23 11:54:55,741 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1443#true} {1443#true} #74#return; {1443#true} is VALID [2018-11-23 11:54:55,742 INFO L256 TraceCheckUtils]: 4: Hoare triple {1443#true} call #t~ret2 := main(); {1443#true} is VALID [2018-11-23 11:54:55,742 INFO L273 TraceCheckUtils]: 5: Hoare triple {1443#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1445#(= main_~i~0 0)} is VALID [2018-11-23 11:54:55,744 INFO L273 TraceCheckUtils]: 6: Hoare triple {1445#(= 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; {1446#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:55,745 INFO L273 TraceCheckUtils]: 7: Hoare triple {1446#(<= 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; {1447#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:55,746 INFO L273 TraceCheckUtils]: 8: Hoare triple {1447#(<= 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; {1448#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:55,747 INFO L273 TraceCheckUtils]: 9: Hoare triple {1448#(<= 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; {1449#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:55,748 INFO L273 TraceCheckUtils]: 10: Hoare triple {1449#(<= 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; {1450#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:55,749 INFO L273 TraceCheckUtils]: 11: Hoare triple {1450#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1444#false} is VALID [2018-11-23 11:54:55,750 INFO L273 TraceCheckUtils]: 12: Hoare triple {1444#false} ~i~0 := 0; {1444#false} is VALID [2018-11-23 11:54:55,750 INFO L273 TraceCheckUtils]: 13: Hoare triple {1444#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1444#false} is VALID [2018-11-23 11:54:55,750 INFO L273 TraceCheckUtils]: 14: Hoare triple {1444#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1444#false} is VALID [2018-11-23 11:54:55,751 INFO L273 TraceCheckUtils]: 15: Hoare triple {1444#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1444#false} is VALID [2018-11-23 11:54:55,751 INFO L273 TraceCheckUtils]: 16: Hoare triple {1444#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1444#false} is VALID [2018-11-23 11:54:55,751 INFO L273 TraceCheckUtils]: 17: Hoare triple {1444#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1444#false} is VALID [2018-11-23 11:54:55,752 INFO L273 TraceCheckUtils]: 18: Hoare triple {1444#false} assume !(~i~0 < 100000); {1444#false} is VALID [2018-11-23 11:54:55,752 INFO L273 TraceCheckUtils]: 19: Hoare triple {1444#false} ~i~0 := 0; {1444#false} is VALID [2018-11-23 11:54:55,752 INFO L273 TraceCheckUtils]: 20: Hoare triple {1444#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1444#false} is VALID [2018-11-23 11:54:55,753 INFO L273 TraceCheckUtils]: 21: Hoare triple {1444#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1444#false} is VALID [2018-11-23 11:54:55,753 INFO L273 TraceCheckUtils]: 22: Hoare triple {1444#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1444#false} is VALID [2018-11-23 11:54:55,753 INFO L273 TraceCheckUtils]: 23: Hoare triple {1444#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1444#false} is VALID [2018-11-23 11:54:55,754 INFO L273 TraceCheckUtils]: 24: Hoare triple {1444#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1444#false} is VALID [2018-11-23 11:54:55,754 INFO L273 TraceCheckUtils]: 25: Hoare triple {1444#false} assume !(~i~0 < 100000); {1444#false} is VALID [2018-11-23 11:54:55,754 INFO L273 TraceCheckUtils]: 26: Hoare triple {1444#false} havoc ~x~0;~x~0 := 0; {1444#false} is VALID [2018-11-23 11:54:55,755 INFO L273 TraceCheckUtils]: 27: Hoare triple {1444#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1444#false} is VALID [2018-11-23 11:54:55,755 INFO L256 TraceCheckUtils]: 28: Hoare triple {1444#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {1444#false} is VALID [2018-11-23 11:54:55,755 INFO L273 TraceCheckUtils]: 29: Hoare triple {1444#false} ~cond := #in~cond; {1444#false} is VALID [2018-11-23 11:54:55,755 INFO L273 TraceCheckUtils]: 30: Hoare triple {1444#false} assume 0 == ~cond; {1444#false} is VALID [2018-11-23 11:54:55,756 INFO L273 TraceCheckUtils]: 31: Hoare triple {1444#false} assume !false; {1444#false} is VALID [2018-11-23 11:54:55,757 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 11:54:55,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:55,758 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:55,775 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:54:55,928 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 11:54:55,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:55,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:56,039 INFO L256 TraceCheckUtils]: 0: Hoare triple {1443#true} call ULTIMATE.init(); {1443#true} is VALID [2018-11-23 11:54:56,040 INFO L273 TraceCheckUtils]: 1: Hoare triple {1443#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1443#true} is VALID [2018-11-23 11:54:56,041 INFO L273 TraceCheckUtils]: 2: Hoare triple {1443#true} assume true; {1443#true} is VALID [2018-11-23 11:54:56,041 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1443#true} {1443#true} #74#return; {1443#true} is VALID [2018-11-23 11:54:56,041 INFO L256 TraceCheckUtils]: 4: Hoare triple {1443#true} call #t~ret2 := main(); {1443#true} is VALID [2018-11-23 11:54:56,042 INFO L273 TraceCheckUtils]: 5: Hoare triple {1443#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1443#true} is VALID [2018-11-23 11:54:56,042 INFO L273 TraceCheckUtils]: 6: Hoare triple {1443#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1443#true} is VALID [2018-11-23 11:54:56,042 INFO L273 TraceCheckUtils]: 7: Hoare triple {1443#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1443#true} is VALID [2018-11-23 11:54:56,042 INFO L273 TraceCheckUtils]: 8: Hoare triple {1443#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1443#true} is VALID [2018-11-23 11:54:56,042 INFO L273 TraceCheckUtils]: 9: Hoare triple {1443#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1443#true} is VALID [2018-11-23 11:54:56,043 INFO L273 TraceCheckUtils]: 10: Hoare triple {1443#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1443#true} is VALID [2018-11-23 11:54:56,043 INFO L273 TraceCheckUtils]: 11: Hoare triple {1443#true} assume !(~i~0 < 100000); {1443#true} is VALID [2018-11-23 11:54:56,043 INFO L273 TraceCheckUtils]: 12: Hoare triple {1443#true} ~i~0 := 0; {1443#true} is VALID [2018-11-23 11:54:56,043 INFO L273 TraceCheckUtils]: 13: Hoare triple {1443#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1443#true} is VALID [2018-11-23 11:54:56,043 INFO L273 TraceCheckUtils]: 14: Hoare triple {1443#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1443#true} is VALID [2018-11-23 11:54:56,044 INFO L273 TraceCheckUtils]: 15: Hoare triple {1443#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1443#true} is VALID [2018-11-23 11:54:56,044 INFO L273 TraceCheckUtils]: 16: Hoare triple {1443#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1443#true} is VALID [2018-11-23 11:54:56,044 INFO L273 TraceCheckUtils]: 17: Hoare triple {1443#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1443#true} is VALID [2018-11-23 11:54:56,044 INFO L273 TraceCheckUtils]: 18: Hoare triple {1443#true} assume !(~i~0 < 100000); {1443#true} is VALID [2018-11-23 11:54:56,048 INFO L273 TraceCheckUtils]: 19: Hoare triple {1443#true} ~i~0 := 0; {1511#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:56,051 INFO L273 TraceCheckUtils]: 20: Hoare triple {1511#(<= 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; {1446#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:56,051 INFO L273 TraceCheckUtils]: 21: Hoare triple {1446#(<= 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; {1447#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:56,052 INFO L273 TraceCheckUtils]: 22: Hoare triple {1447#(<= 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; {1448#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:56,053 INFO L273 TraceCheckUtils]: 23: Hoare triple {1448#(<= 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; {1449#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:56,053 INFO L273 TraceCheckUtils]: 24: Hoare triple {1449#(<= 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; {1450#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:56,054 INFO L273 TraceCheckUtils]: 25: Hoare triple {1450#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1444#false} is VALID [2018-11-23 11:54:56,054 INFO L273 TraceCheckUtils]: 26: Hoare triple {1444#false} havoc ~x~0;~x~0 := 0; {1444#false} is VALID [2018-11-23 11:54:56,054 INFO L273 TraceCheckUtils]: 27: Hoare triple {1444#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1444#false} is VALID [2018-11-23 11:54:56,054 INFO L256 TraceCheckUtils]: 28: Hoare triple {1444#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {1444#false} is VALID [2018-11-23 11:54:56,054 INFO L273 TraceCheckUtils]: 29: Hoare triple {1444#false} ~cond := #in~cond; {1444#false} is VALID [2018-11-23 11:54:56,055 INFO L273 TraceCheckUtils]: 30: Hoare triple {1444#false} assume 0 == ~cond; {1444#false} is VALID [2018-11-23 11:54:56,055 INFO L273 TraceCheckUtils]: 31: Hoare triple {1444#false} assume !false; {1444#false} is VALID [2018-11-23 11:54:56,056 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 11:54:56,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:56,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 11:54:56,078 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-23 11:54:56,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:56,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:54:56,126 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:56,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:54:56,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:54:56,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:54:56,127 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 9 states. [2018-11-23 11:54:56,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:56,504 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-11-23 11:54:56,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:54:56,505 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-23 11:54:56,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:56,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:54:56,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2018-11-23 11:54:56,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:54:56,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2018-11-23 11:54:56,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 63 transitions. [2018-11-23 11:54:56,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:56,628 INFO L225 Difference]: With dead ends: 65 [2018-11-23 11:54:56,628 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 11:54:56,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 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 11:54:56,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 11:54:56,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 11:54:56,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:56,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-23 11:54:56,663 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 11:54:56,663 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 11:54:56,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:56,664 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-11-23 11:54:56,665 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-11-23 11:54:56,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:56,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:56,666 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 11:54:56,666 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 11:54:56,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:56,668 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-11-23 11:54:56,668 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-11-23 11:54:56,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:56,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:56,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:56,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:56,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:54:56,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-11-23 11:54:56,671 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 32 [2018-11-23 11:54:56,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:56,671 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-11-23 11:54:56,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:54:56,671 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-11-23 11:54:56,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 11:54:56,672 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:56,673 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:56,673 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:56,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:56,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1957995290, now seen corresponding path program 6 times [2018-11-23 11:54:56,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:56,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:56,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:56,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:56,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:56,866 INFO L256 TraceCheckUtils]: 0: Hoare triple {1803#true} call ULTIMATE.init(); {1803#true} is VALID [2018-11-23 11:54:56,867 INFO L273 TraceCheckUtils]: 1: Hoare triple {1803#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1803#true} is VALID [2018-11-23 11:54:56,867 INFO L273 TraceCheckUtils]: 2: Hoare triple {1803#true} assume true; {1803#true} is VALID [2018-11-23 11:54:56,867 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1803#true} {1803#true} #74#return; {1803#true} is VALID [2018-11-23 11:54:56,868 INFO L256 TraceCheckUtils]: 4: Hoare triple {1803#true} call #t~ret2 := main(); {1803#true} is VALID [2018-11-23 11:54:56,868 INFO L273 TraceCheckUtils]: 5: Hoare triple {1803#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1805#(= main_~i~0 0)} is VALID [2018-11-23 11:54:56,869 INFO L273 TraceCheckUtils]: 6: Hoare triple {1805#(= 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; {1806#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:56,871 INFO L273 TraceCheckUtils]: 7: Hoare triple {1806#(<= 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; {1807#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:56,872 INFO L273 TraceCheckUtils]: 8: Hoare triple {1807#(<= 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; {1808#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:56,873 INFO L273 TraceCheckUtils]: 9: Hoare triple {1808#(<= 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; {1809#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:56,874 INFO L273 TraceCheckUtils]: 10: Hoare triple {1809#(<= 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; {1810#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:56,875 INFO L273 TraceCheckUtils]: 11: Hoare triple {1810#(<= 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; {1811#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:56,876 INFO L273 TraceCheckUtils]: 12: Hoare triple {1811#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1804#false} is VALID [2018-11-23 11:54:56,876 INFO L273 TraceCheckUtils]: 13: Hoare triple {1804#false} ~i~0 := 0; {1804#false} is VALID [2018-11-23 11:54:56,877 INFO L273 TraceCheckUtils]: 14: Hoare triple {1804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1804#false} is VALID [2018-11-23 11:54:56,877 INFO L273 TraceCheckUtils]: 15: Hoare triple {1804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1804#false} is VALID [2018-11-23 11:54:56,878 INFO L273 TraceCheckUtils]: 16: Hoare triple {1804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1804#false} is VALID [2018-11-23 11:54:56,878 INFO L273 TraceCheckUtils]: 17: Hoare triple {1804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1804#false} is VALID [2018-11-23 11:54:56,879 INFO L273 TraceCheckUtils]: 18: Hoare triple {1804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1804#false} is VALID [2018-11-23 11:54:56,879 INFO L273 TraceCheckUtils]: 19: Hoare triple {1804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1804#false} is VALID [2018-11-23 11:54:56,879 INFO L273 TraceCheckUtils]: 20: Hoare triple {1804#false} assume !(~i~0 < 100000); {1804#false} is VALID [2018-11-23 11:54:56,880 INFO L273 TraceCheckUtils]: 21: Hoare triple {1804#false} ~i~0 := 0; {1804#false} is VALID [2018-11-23 11:54:56,880 INFO L273 TraceCheckUtils]: 22: Hoare triple {1804#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1804#false} is VALID [2018-11-23 11:54:56,880 INFO L273 TraceCheckUtils]: 23: Hoare triple {1804#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1804#false} is VALID [2018-11-23 11:54:56,881 INFO L273 TraceCheckUtils]: 24: Hoare triple {1804#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1804#false} is VALID [2018-11-23 11:54:56,881 INFO L273 TraceCheckUtils]: 25: Hoare triple {1804#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1804#false} is VALID [2018-11-23 11:54:56,881 INFO L273 TraceCheckUtils]: 26: Hoare triple {1804#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1804#false} is VALID [2018-11-23 11:54:56,881 INFO L273 TraceCheckUtils]: 27: Hoare triple {1804#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1804#false} is VALID [2018-11-23 11:54:56,882 INFO L273 TraceCheckUtils]: 28: Hoare triple {1804#false} assume !(~i~0 < 100000); {1804#false} is VALID [2018-11-23 11:54:56,882 INFO L273 TraceCheckUtils]: 29: Hoare triple {1804#false} havoc ~x~0;~x~0 := 0; {1804#false} is VALID [2018-11-23 11:54:56,882 INFO L273 TraceCheckUtils]: 30: Hoare triple {1804#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1804#false} is VALID [2018-11-23 11:54:56,882 INFO L256 TraceCheckUtils]: 31: Hoare triple {1804#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {1804#false} is VALID [2018-11-23 11:54:56,882 INFO L273 TraceCheckUtils]: 32: Hoare triple {1804#false} ~cond := #in~cond; {1804#false} is VALID [2018-11-23 11:54:56,882 INFO L273 TraceCheckUtils]: 33: Hoare triple {1804#false} assume 0 == ~cond; {1804#false} is VALID [2018-11-23 11:54:56,883 INFO L273 TraceCheckUtils]: 34: Hoare triple {1804#false} assume !false; {1804#false} is VALID [2018-11-23 11:54:56,884 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-23 11:54:56,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:56,884 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:56,894 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:54:57,120 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-23 11:54:57,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:57,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:57,583 INFO L256 TraceCheckUtils]: 0: Hoare triple {1803#true} call ULTIMATE.init(); {1803#true} is VALID [2018-11-23 11:54:57,584 INFO L273 TraceCheckUtils]: 1: Hoare triple {1803#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1803#true} is VALID [2018-11-23 11:54:57,584 INFO L273 TraceCheckUtils]: 2: Hoare triple {1803#true} assume true; {1803#true} is VALID [2018-11-23 11:54:57,585 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1803#true} {1803#true} #74#return; {1803#true} is VALID [2018-11-23 11:54:57,585 INFO L256 TraceCheckUtils]: 4: Hoare triple {1803#true} call #t~ret2 := main(); {1803#true} is VALID [2018-11-23 11:54:57,586 INFO L273 TraceCheckUtils]: 5: Hoare triple {1803#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1830#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:57,587 INFO L273 TraceCheckUtils]: 6: Hoare triple {1830#(<= 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; {1806#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:57,588 INFO L273 TraceCheckUtils]: 7: Hoare triple {1806#(<= 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; {1807#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:57,589 INFO L273 TraceCheckUtils]: 8: Hoare triple {1807#(<= 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; {1808#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:57,589 INFO L273 TraceCheckUtils]: 9: Hoare triple {1808#(<= 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; {1809#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:57,590 INFO L273 TraceCheckUtils]: 10: Hoare triple {1809#(<= 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; {1810#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:57,593 INFO L273 TraceCheckUtils]: 11: Hoare triple {1810#(<= 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; {1811#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:57,594 INFO L273 TraceCheckUtils]: 12: Hoare triple {1811#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1804#false} is VALID [2018-11-23 11:54:57,594 INFO L273 TraceCheckUtils]: 13: Hoare triple {1804#false} ~i~0 := 0; {1804#false} is VALID [2018-11-23 11:54:57,594 INFO L273 TraceCheckUtils]: 14: Hoare triple {1804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1804#false} is VALID [2018-11-23 11:54:57,595 INFO L273 TraceCheckUtils]: 15: Hoare triple {1804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1804#false} is VALID [2018-11-23 11:54:57,595 INFO L273 TraceCheckUtils]: 16: Hoare triple {1804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1804#false} is VALID [2018-11-23 11:54:57,595 INFO L273 TraceCheckUtils]: 17: Hoare triple {1804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1804#false} is VALID [2018-11-23 11:54:57,595 INFO L273 TraceCheckUtils]: 18: Hoare triple {1804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1804#false} is VALID [2018-11-23 11:54:57,595 INFO L273 TraceCheckUtils]: 19: Hoare triple {1804#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1804#false} is VALID [2018-11-23 11:54:57,596 INFO L273 TraceCheckUtils]: 20: Hoare triple {1804#false} assume !(~i~0 < 100000); {1804#false} is VALID [2018-11-23 11:54:57,596 INFO L273 TraceCheckUtils]: 21: Hoare triple {1804#false} ~i~0 := 0; {1804#false} is VALID [2018-11-23 11:54:57,596 INFO L273 TraceCheckUtils]: 22: Hoare triple {1804#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1804#false} is VALID [2018-11-23 11:54:57,596 INFO L273 TraceCheckUtils]: 23: Hoare triple {1804#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1804#false} is VALID [2018-11-23 11:54:57,597 INFO L273 TraceCheckUtils]: 24: Hoare triple {1804#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1804#false} is VALID [2018-11-23 11:54:57,597 INFO L273 TraceCheckUtils]: 25: Hoare triple {1804#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1804#false} is VALID [2018-11-23 11:54:57,597 INFO L273 TraceCheckUtils]: 26: Hoare triple {1804#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1804#false} is VALID [2018-11-23 11:54:57,597 INFO L273 TraceCheckUtils]: 27: Hoare triple {1804#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1804#false} is VALID [2018-11-23 11:54:57,598 INFO L273 TraceCheckUtils]: 28: Hoare triple {1804#false} assume !(~i~0 < 100000); {1804#false} is VALID [2018-11-23 11:54:57,598 INFO L273 TraceCheckUtils]: 29: Hoare triple {1804#false} havoc ~x~0;~x~0 := 0; {1804#false} is VALID [2018-11-23 11:54:57,598 INFO L273 TraceCheckUtils]: 30: Hoare triple {1804#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1804#false} is VALID [2018-11-23 11:54:57,598 INFO L256 TraceCheckUtils]: 31: Hoare triple {1804#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {1804#false} is VALID [2018-11-23 11:54:57,599 INFO L273 TraceCheckUtils]: 32: Hoare triple {1804#false} ~cond := #in~cond; {1804#false} is VALID [2018-11-23 11:54:57,599 INFO L273 TraceCheckUtils]: 33: Hoare triple {1804#false} assume 0 == ~cond; {1804#false} is VALID [2018-11-23 11:54:57,599 INFO L273 TraceCheckUtils]: 34: Hoare triple {1804#false} assume !false; {1804#false} is VALID [2018-11-23 11:54:57,601 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-23 11:54:57,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:57,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 11:54:57,624 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-23 11:54:57,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:57,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:54:57,652 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:57,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:54:57,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:54:57,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:54:57,653 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 10 states. [2018-11-23 11:54:58,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:58,016 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2018-11-23 11:54:58,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:54:58,017 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-23 11:54:58,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:58,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:54:58,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 66 transitions. [2018-11-23 11:54:58,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:54:58,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 66 transitions. [2018-11-23 11:54:58,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 66 transitions. [2018-11-23 11:54:58,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:58,128 INFO L225 Difference]: With dead ends: 70 [2018-11-23 11:54:58,128 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 11:54:58,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:54:58,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 11:54:58,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-23 11:54:58,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:58,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2018-11-23 11:54:58,168 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 11:54:58,168 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 11:54:58,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:58,170 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-11-23 11:54:58,171 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-11-23 11:54:58,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:58,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:58,171 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 11:54:58,171 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 11:54:58,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:58,173 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-11-23 11:54:58,173 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-11-23 11:54:58,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:58,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:58,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:58,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:58,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:54:58,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-11-23 11:54:58,175 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 35 [2018-11-23 11:54:58,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:58,175 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-11-23 11:54:58,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:54:58,175 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-11-23 11:54:58,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 11:54:58,176 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:58,176 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:58,177 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:58,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:58,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1474050655, now seen corresponding path program 7 times [2018-11-23 11:54:58,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:58,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:58,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:58,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:58,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:58,573 INFO L256 TraceCheckUtils]: 0: Hoare triple {2195#true} call ULTIMATE.init(); {2195#true} is VALID [2018-11-23 11:54:58,573 INFO L273 TraceCheckUtils]: 1: Hoare triple {2195#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2195#true} is VALID [2018-11-23 11:54:58,574 INFO L273 TraceCheckUtils]: 2: Hoare triple {2195#true} assume true; {2195#true} is VALID [2018-11-23 11:54:58,574 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2195#true} {2195#true} #74#return; {2195#true} is VALID [2018-11-23 11:54:58,574 INFO L256 TraceCheckUtils]: 4: Hoare triple {2195#true} call #t~ret2 := main(); {2195#true} is VALID [2018-11-23 11:54:58,589 INFO L273 TraceCheckUtils]: 5: Hoare triple {2195#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2197#(= main_~i~0 0)} is VALID [2018-11-23 11:54:58,604 INFO L273 TraceCheckUtils]: 6: Hoare triple {2197#(= 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; {2198#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:58,619 INFO L273 TraceCheckUtils]: 7: Hoare triple {2198#(<= 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; {2199#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:58,628 INFO L273 TraceCheckUtils]: 8: Hoare triple {2199#(<= 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; {2200#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:58,632 INFO L273 TraceCheckUtils]: 9: Hoare triple {2200#(<= 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; {2201#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:58,638 INFO L273 TraceCheckUtils]: 10: Hoare triple {2201#(<= 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; {2202#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:58,638 INFO L273 TraceCheckUtils]: 11: Hoare triple {2202#(<= 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; {2203#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:58,639 INFO L273 TraceCheckUtils]: 12: Hoare triple {2203#(<= 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; {2204#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:58,639 INFO L273 TraceCheckUtils]: 13: Hoare triple {2204#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2196#false} is VALID [2018-11-23 11:54:58,640 INFO L273 TraceCheckUtils]: 14: Hoare triple {2196#false} ~i~0 := 0; {2196#false} is VALID [2018-11-23 11:54:58,640 INFO L273 TraceCheckUtils]: 15: Hoare triple {2196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2196#false} is VALID [2018-11-23 11:54:58,640 INFO L273 TraceCheckUtils]: 16: Hoare triple {2196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2196#false} is VALID [2018-11-23 11:54:58,640 INFO L273 TraceCheckUtils]: 17: Hoare triple {2196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2196#false} is VALID [2018-11-23 11:54:58,640 INFO L273 TraceCheckUtils]: 18: Hoare triple {2196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2196#false} is VALID [2018-11-23 11:54:58,641 INFO L273 TraceCheckUtils]: 19: Hoare triple {2196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2196#false} is VALID [2018-11-23 11:54:58,641 INFO L273 TraceCheckUtils]: 20: Hoare triple {2196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2196#false} is VALID [2018-11-23 11:54:58,641 INFO L273 TraceCheckUtils]: 21: Hoare triple {2196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2196#false} is VALID [2018-11-23 11:54:58,641 INFO L273 TraceCheckUtils]: 22: Hoare triple {2196#false} assume !(~i~0 < 100000); {2196#false} is VALID [2018-11-23 11:54:58,641 INFO L273 TraceCheckUtils]: 23: Hoare triple {2196#false} ~i~0 := 0; {2196#false} is VALID [2018-11-23 11:54:58,642 INFO L273 TraceCheckUtils]: 24: Hoare triple {2196#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2196#false} is VALID [2018-11-23 11:54:58,642 INFO L273 TraceCheckUtils]: 25: Hoare triple {2196#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2196#false} is VALID [2018-11-23 11:54:58,642 INFO L273 TraceCheckUtils]: 26: Hoare triple {2196#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2196#false} is VALID [2018-11-23 11:54:58,642 INFO L273 TraceCheckUtils]: 27: Hoare triple {2196#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2196#false} is VALID [2018-11-23 11:54:58,642 INFO L273 TraceCheckUtils]: 28: Hoare triple {2196#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2196#false} is VALID [2018-11-23 11:54:58,643 INFO L273 TraceCheckUtils]: 29: Hoare triple {2196#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2196#false} is VALID [2018-11-23 11:54:58,643 INFO L273 TraceCheckUtils]: 30: Hoare triple {2196#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2196#false} is VALID [2018-11-23 11:54:58,643 INFO L273 TraceCheckUtils]: 31: Hoare triple {2196#false} assume !(~i~0 < 100000); {2196#false} is VALID [2018-11-23 11:54:58,643 INFO L273 TraceCheckUtils]: 32: Hoare triple {2196#false} havoc ~x~0;~x~0 := 0; {2196#false} is VALID [2018-11-23 11:54:58,643 INFO L273 TraceCheckUtils]: 33: Hoare triple {2196#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2196#false} is VALID [2018-11-23 11:54:58,644 INFO L256 TraceCheckUtils]: 34: Hoare triple {2196#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {2196#false} is VALID [2018-11-23 11:54:58,644 INFO L273 TraceCheckUtils]: 35: Hoare triple {2196#false} ~cond := #in~cond; {2196#false} is VALID [2018-11-23 11:54:58,644 INFO L273 TraceCheckUtils]: 36: Hoare triple {2196#false} assume 0 == ~cond; {2196#false} is VALID [2018-11-23 11:54:58,644 INFO L273 TraceCheckUtils]: 37: Hoare triple {2196#false} assume !false; {2196#false} is VALID [2018-11-23 11:54:58,645 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-23 11:54:58,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:58,646 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:58,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:58,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:58,815 INFO L256 TraceCheckUtils]: 0: Hoare triple {2195#true} call ULTIMATE.init(); {2195#true} is VALID [2018-11-23 11:54:58,816 INFO L273 TraceCheckUtils]: 1: Hoare triple {2195#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2195#true} is VALID [2018-11-23 11:54:58,816 INFO L273 TraceCheckUtils]: 2: Hoare triple {2195#true} assume true; {2195#true} is VALID [2018-11-23 11:54:58,816 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2195#true} {2195#true} #74#return; {2195#true} is VALID [2018-11-23 11:54:58,816 INFO L256 TraceCheckUtils]: 4: Hoare triple {2195#true} call #t~ret2 := main(); {2195#true} is VALID [2018-11-23 11:54:58,817 INFO L273 TraceCheckUtils]: 5: Hoare triple {2195#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2223#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:58,818 INFO L273 TraceCheckUtils]: 6: Hoare triple {2223#(<= 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; {2198#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:58,819 INFO L273 TraceCheckUtils]: 7: Hoare triple {2198#(<= 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; {2199#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:58,819 INFO L273 TraceCheckUtils]: 8: Hoare triple {2199#(<= 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; {2200#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:58,820 INFO L273 TraceCheckUtils]: 9: Hoare triple {2200#(<= 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; {2201#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:58,821 INFO L273 TraceCheckUtils]: 10: Hoare triple {2201#(<= 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; {2202#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:58,822 INFO L273 TraceCheckUtils]: 11: Hoare triple {2202#(<= 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; {2203#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:58,823 INFO L273 TraceCheckUtils]: 12: Hoare triple {2203#(<= 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; {2204#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:58,824 INFO L273 TraceCheckUtils]: 13: Hoare triple {2204#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2196#false} is VALID [2018-11-23 11:54:58,824 INFO L273 TraceCheckUtils]: 14: Hoare triple {2196#false} ~i~0 := 0; {2196#false} is VALID [2018-11-23 11:54:58,824 INFO L273 TraceCheckUtils]: 15: Hoare triple {2196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2196#false} is VALID [2018-11-23 11:54:58,824 INFO L273 TraceCheckUtils]: 16: Hoare triple {2196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2196#false} is VALID [2018-11-23 11:54:58,825 INFO L273 TraceCheckUtils]: 17: Hoare triple {2196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2196#false} is VALID [2018-11-23 11:54:58,825 INFO L273 TraceCheckUtils]: 18: Hoare triple {2196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2196#false} is VALID [2018-11-23 11:54:58,825 INFO L273 TraceCheckUtils]: 19: Hoare triple {2196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2196#false} is VALID [2018-11-23 11:54:58,825 INFO L273 TraceCheckUtils]: 20: Hoare triple {2196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2196#false} is VALID [2018-11-23 11:54:58,826 INFO L273 TraceCheckUtils]: 21: Hoare triple {2196#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2196#false} is VALID [2018-11-23 11:54:58,826 INFO L273 TraceCheckUtils]: 22: Hoare triple {2196#false} assume !(~i~0 < 100000); {2196#false} is VALID [2018-11-23 11:54:58,826 INFO L273 TraceCheckUtils]: 23: Hoare triple {2196#false} ~i~0 := 0; {2196#false} is VALID [2018-11-23 11:54:58,826 INFO L273 TraceCheckUtils]: 24: Hoare triple {2196#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2196#false} is VALID [2018-11-23 11:54:58,827 INFO L273 TraceCheckUtils]: 25: Hoare triple {2196#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2196#false} is VALID [2018-11-23 11:54:58,827 INFO L273 TraceCheckUtils]: 26: Hoare triple {2196#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2196#false} is VALID [2018-11-23 11:54:58,827 INFO L273 TraceCheckUtils]: 27: Hoare triple {2196#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2196#false} is VALID [2018-11-23 11:54:58,827 INFO L273 TraceCheckUtils]: 28: Hoare triple {2196#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2196#false} is VALID [2018-11-23 11:54:58,828 INFO L273 TraceCheckUtils]: 29: Hoare triple {2196#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2196#false} is VALID [2018-11-23 11:54:58,828 INFO L273 TraceCheckUtils]: 30: Hoare triple {2196#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2196#false} is VALID [2018-11-23 11:54:58,828 INFO L273 TraceCheckUtils]: 31: Hoare triple {2196#false} assume !(~i~0 < 100000); {2196#false} is VALID [2018-11-23 11:54:58,828 INFO L273 TraceCheckUtils]: 32: Hoare triple {2196#false} havoc ~x~0;~x~0 := 0; {2196#false} is VALID [2018-11-23 11:54:58,828 INFO L273 TraceCheckUtils]: 33: Hoare triple {2196#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2196#false} is VALID [2018-11-23 11:54:58,829 INFO L256 TraceCheckUtils]: 34: Hoare triple {2196#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {2196#false} is VALID [2018-11-23 11:54:58,829 INFO L273 TraceCheckUtils]: 35: Hoare triple {2196#false} ~cond := #in~cond; {2196#false} is VALID [2018-11-23 11:54:58,829 INFO L273 TraceCheckUtils]: 36: Hoare triple {2196#false} assume 0 == ~cond; {2196#false} is VALID [2018-11-23 11:54:58,829 INFO L273 TraceCheckUtils]: 37: Hoare triple {2196#false} assume !false; {2196#false} is VALID [2018-11-23 11:54:58,830 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-23 11:54:58,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:58,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 11:54:58,850 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-11-23 11:54:58,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:58,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:54:58,897 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:58,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:54:58,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:54:58,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:54:58,898 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 11 states. [2018-11-23 11:54:59,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:59,392 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2018-11-23 11:54:59,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:54:59,392 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-11-23 11:54:59,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:59,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:54:59,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2018-11-23 11:54:59,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:54:59,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2018-11-23 11:54:59,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 69 transitions. [2018-11-23 11:54:59,494 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:59,495 INFO L225 Difference]: With dead ends: 75 [2018-11-23 11:54:59,497 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 11:54:59,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:54:59,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 11:54:59,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-23 11:54:59,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:59,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-23 11:54:59,530 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 11:54:59,530 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 11:54:59,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:59,533 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-11-23 11:54:59,534 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-11-23 11:54:59,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:59,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:59,534 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 11:54:59,535 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 11:54:59,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:59,536 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-11-23 11:54:59,536 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-11-23 11:54:59,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:59,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:59,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:59,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:59,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:54:59,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-11-23 11:54:59,539 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 38 [2018-11-23 11:54:59,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:59,539 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-11-23 11:54:59,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:54:59,540 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-11-23 11:54:59,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 11:54:59,540 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:59,541 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:59,541 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:59,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:59,541 INFO L82 PathProgramCache]: Analyzing trace with hash 2136639930, now seen corresponding path program 8 times [2018-11-23 11:54:59,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:59,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:59,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:59,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:59,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:59,717 INFO L256 TraceCheckUtils]: 0: Hoare triple {2619#true} call ULTIMATE.init(); {2619#true} is VALID [2018-11-23 11:54:59,718 INFO L273 TraceCheckUtils]: 1: Hoare triple {2619#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2619#true} is VALID [2018-11-23 11:54:59,718 INFO L273 TraceCheckUtils]: 2: Hoare triple {2619#true} assume true; {2619#true} is VALID [2018-11-23 11:54:59,719 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2619#true} {2619#true} #74#return; {2619#true} is VALID [2018-11-23 11:54:59,719 INFO L256 TraceCheckUtils]: 4: Hoare triple {2619#true} call #t~ret2 := main(); {2619#true} is VALID [2018-11-23 11:54:59,720 INFO L273 TraceCheckUtils]: 5: Hoare triple {2619#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2621#(= main_~i~0 0)} is VALID [2018-11-23 11:54:59,721 INFO L273 TraceCheckUtils]: 6: Hoare triple {2621#(= 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; {2622#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:59,721 INFO L273 TraceCheckUtils]: 7: Hoare triple {2622#(<= 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; {2623#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:59,722 INFO L273 TraceCheckUtils]: 8: Hoare triple {2623#(<= 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; {2624#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:59,723 INFO L273 TraceCheckUtils]: 9: Hoare triple {2624#(<= 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; {2625#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:59,723 INFO L273 TraceCheckUtils]: 10: Hoare triple {2625#(<= 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; {2626#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:59,724 INFO L273 TraceCheckUtils]: 11: Hoare triple {2626#(<= 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; {2627#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:59,725 INFO L273 TraceCheckUtils]: 12: Hoare triple {2627#(<= 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; {2628#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:59,726 INFO L273 TraceCheckUtils]: 13: Hoare triple {2628#(<= 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; {2629#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:59,731 INFO L273 TraceCheckUtils]: 14: Hoare triple {2629#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2620#false} is VALID [2018-11-23 11:54:59,731 INFO L273 TraceCheckUtils]: 15: Hoare triple {2620#false} ~i~0 := 0; {2620#false} is VALID [2018-11-23 11:54:59,732 INFO L273 TraceCheckUtils]: 16: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,732 INFO L273 TraceCheckUtils]: 17: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,732 INFO L273 TraceCheckUtils]: 18: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,732 INFO L273 TraceCheckUtils]: 19: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,732 INFO L273 TraceCheckUtils]: 20: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,732 INFO L273 TraceCheckUtils]: 21: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,732 INFO L273 TraceCheckUtils]: 22: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,733 INFO L273 TraceCheckUtils]: 23: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,733 INFO L273 TraceCheckUtils]: 24: Hoare triple {2620#false} assume !(~i~0 < 100000); {2620#false} is VALID [2018-11-23 11:54:59,733 INFO L273 TraceCheckUtils]: 25: Hoare triple {2620#false} ~i~0 := 0; {2620#false} is VALID [2018-11-23 11:54:59,733 INFO L273 TraceCheckUtils]: 26: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,733 INFO L273 TraceCheckUtils]: 27: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,734 INFO L273 TraceCheckUtils]: 28: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,734 INFO L273 TraceCheckUtils]: 29: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,734 INFO L273 TraceCheckUtils]: 30: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,734 INFO L273 TraceCheckUtils]: 31: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,734 INFO L273 TraceCheckUtils]: 32: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,735 INFO L273 TraceCheckUtils]: 33: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,735 INFO L273 TraceCheckUtils]: 34: Hoare triple {2620#false} assume !(~i~0 < 100000); {2620#false} is VALID [2018-11-23 11:54:59,735 INFO L273 TraceCheckUtils]: 35: Hoare triple {2620#false} havoc ~x~0;~x~0 := 0; {2620#false} is VALID [2018-11-23 11:54:59,735 INFO L273 TraceCheckUtils]: 36: Hoare triple {2620#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2620#false} is VALID [2018-11-23 11:54:59,735 INFO L256 TraceCheckUtils]: 37: Hoare triple {2620#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {2620#false} is VALID [2018-11-23 11:54:59,736 INFO L273 TraceCheckUtils]: 38: Hoare triple {2620#false} ~cond := #in~cond; {2620#false} is VALID [2018-11-23 11:54:59,736 INFO L273 TraceCheckUtils]: 39: Hoare triple {2620#false} assume 0 == ~cond; {2620#false} is VALID [2018-11-23 11:54:59,736 INFO L273 TraceCheckUtils]: 40: Hoare triple {2620#false} assume !false; {2620#false} is VALID [2018-11-23 11:54:59,737 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-23 11:54:59,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:59,738 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:59,752 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:54:59,777 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:54:59,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:59,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:59,889 INFO L256 TraceCheckUtils]: 0: Hoare triple {2619#true} call ULTIMATE.init(); {2619#true} is VALID [2018-11-23 11:54:59,889 INFO L273 TraceCheckUtils]: 1: Hoare triple {2619#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2619#true} is VALID [2018-11-23 11:54:59,890 INFO L273 TraceCheckUtils]: 2: Hoare triple {2619#true} assume true; {2619#true} is VALID [2018-11-23 11:54:59,890 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2619#true} {2619#true} #74#return; {2619#true} is VALID [2018-11-23 11:54:59,890 INFO L256 TraceCheckUtils]: 4: Hoare triple {2619#true} call #t~ret2 := main(); {2619#true} is VALID [2018-11-23 11:54:59,914 INFO L273 TraceCheckUtils]: 5: Hoare triple {2619#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2648#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:59,928 INFO L273 TraceCheckUtils]: 6: Hoare triple {2648#(<= 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; {2622#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:59,942 INFO L273 TraceCheckUtils]: 7: Hoare triple {2622#(<= 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; {2623#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:59,956 INFO L273 TraceCheckUtils]: 8: Hoare triple {2623#(<= 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; {2624#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:59,961 INFO L273 TraceCheckUtils]: 9: Hoare triple {2624#(<= 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; {2625#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:59,962 INFO L273 TraceCheckUtils]: 10: Hoare triple {2625#(<= 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; {2626#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:59,966 INFO L273 TraceCheckUtils]: 11: Hoare triple {2626#(<= 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; {2627#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:59,966 INFO L273 TraceCheckUtils]: 12: Hoare triple {2627#(<= 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; {2628#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:59,968 INFO L273 TraceCheckUtils]: 13: Hoare triple {2628#(<= 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; {2629#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:59,968 INFO L273 TraceCheckUtils]: 14: Hoare triple {2629#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2620#false} is VALID [2018-11-23 11:54:59,968 INFO L273 TraceCheckUtils]: 15: Hoare triple {2620#false} ~i~0 := 0; {2620#false} is VALID [2018-11-23 11:54:59,968 INFO L273 TraceCheckUtils]: 16: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,969 INFO L273 TraceCheckUtils]: 17: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,969 INFO L273 TraceCheckUtils]: 18: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,969 INFO L273 TraceCheckUtils]: 19: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,969 INFO L273 TraceCheckUtils]: 20: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,969 INFO L273 TraceCheckUtils]: 21: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,969 INFO L273 TraceCheckUtils]: 22: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,969 INFO L273 TraceCheckUtils]: 23: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,970 INFO L273 TraceCheckUtils]: 24: Hoare triple {2620#false} assume !(~i~0 < 100000); {2620#false} is VALID [2018-11-23 11:54:59,970 INFO L273 TraceCheckUtils]: 25: Hoare triple {2620#false} ~i~0 := 0; {2620#false} is VALID [2018-11-23 11:54:59,970 INFO L273 TraceCheckUtils]: 26: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,970 INFO L273 TraceCheckUtils]: 27: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,970 INFO L273 TraceCheckUtils]: 28: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,970 INFO L273 TraceCheckUtils]: 29: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,970 INFO L273 TraceCheckUtils]: 30: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,971 INFO L273 TraceCheckUtils]: 31: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,971 INFO L273 TraceCheckUtils]: 32: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,972 INFO L273 TraceCheckUtils]: 33: Hoare triple {2620#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2620#false} is VALID [2018-11-23 11:54:59,972 INFO L273 TraceCheckUtils]: 34: Hoare triple {2620#false} assume !(~i~0 < 100000); {2620#false} is VALID [2018-11-23 11:54:59,972 INFO L273 TraceCheckUtils]: 35: Hoare triple {2620#false} havoc ~x~0;~x~0 := 0; {2620#false} is VALID [2018-11-23 11:54:59,973 INFO L273 TraceCheckUtils]: 36: Hoare triple {2620#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2620#false} is VALID [2018-11-23 11:54:59,973 INFO L256 TraceCheckUtils]: 37: Hoare triple {2620#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {2620#false} is VALID [2018-11-23 11:54:59,973 INFO L273 TraceCheckUtils]: 38: Hoare triple {2620#false} ~cond := #in~cond; {2620#false} is VALID [2018-11-23 11:54:59,973 INFO L273 TraceCheckUtils]: 39: Hoare triple {2620#false} assume 0 == ~cond; {2620#false} is VALID [2018-11-23 11:54:59,974 INFO L273 TraceCheckUtils]: 40: Hoare triple {2620#false} assume !false; {2620#false} is VALID [2018-11-23 11:54:59,975 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-23 11:54:59,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:59,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 11:54:59,999 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-11-23 11:54:59,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:59,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:55:00,034 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:00,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:55:00,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:55:00,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:55:00,035 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 12 states. [2018-11-23 11:55:00,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:00,535 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-11-23 11:55:00,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:55:00,536 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-11-23 11:55:00,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:00,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:55:00,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 72 transitions. [2018-11-23 11:55:00,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:55:00,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 72 transitions. [2018-11-23 11:55:00,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 72 transitions. [2018-11-23 11:55:00,702 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:00,703 INFO L225 Difference]: With dead ends: 80 [2018-11-23 11:55:00,703 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 11:55:00,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:55:00,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 11:55:00,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-23 11:55:00,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:00,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2018-11-23 11:55:00,734 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-23 11:55:00,734 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-23 11:55:00,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:00,736 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-11-23 11:55:00,736 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-23 11:55:00,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:00,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:00,737 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-23 11:55:00,737 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-23 11:55:00,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:00,738 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-11-23 11:55:00,738 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-23 11:55:00,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:00,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:00,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:00,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:00,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 11:55:00,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-11-23 11:55:00,740 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 41 [2018-11-23 11:55:00,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:00,740 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-11-23 11:55:00,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:55:00,740 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-23 11:55:00,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 11:55:00,741 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:00,741 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:00,741 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:00,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:00,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1548858751, now seen corresponding path program 9 times [2018-11-23 11:55:00,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:00,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:00,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:00,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:00,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:00,947 INFO L256 TraceCheckUtils]: 0: Hoare triple {3075#true} call ULTIMATE.init(); {3075#true} is VALID [2018-11-23 11:55:00,948 INFO L273 TraceCheckUtils]: 1: Hoare triple {3075#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3075#true} is VALID [2018-11-23 11:55:00,948 INFO L273 TraceCheckUtils]: 2: Hoare triple {3075#true} assume true; {3075#true} is VALID [2018-11-23 11:55:00,948 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3075#true} {3075#true} #74#return; {3075#true} is VALID [2018-11-23 11:55:00,948 INFO L256 TraceCheckUtils]: 4: Hoare triple {3075#true} call #t~ret2 := main(); {3075#true} is VALID [2018-11-23 11:55:00,949 INFO L273 TraceCheckUtils]: 5: Hoare triple {3075#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3077#(= main_~i~0 0)} is VALID [2018-11-23 11:55:00,949 INFO L273 TraceCheckUtils]: 6: Hoare triple {3077#(= 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; {3078#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:00,950 INFO L273 TraceCheckUtils]: 7: Hoare triple {3078#(<= 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; {3079#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:00,952 INFO L273 TraceCheckUtils]: 8: Hoare triple {3079#(<= 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; {3080#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:00,952 INFO L273 TraceCheckUtils]: 9: Hoare triple {3080#(<= 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; {3081#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:00,953 INFO L273 TraceCheckUtils]: 10: Hoare triple {3081#(<= 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; {3082#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:00,954 INFO L273 TraceCheckUtils]: 11: Hoare triple {3082#(<= 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; {3083#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:00,955 INFO L273 TraceCheckUtils]: 12: Hoare triple {3083#(<= 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; {3084#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:00,956 INFO L273 TraceCheckUtils]: 13: Hoare triple {3084#(<= 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; {3085#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:00,957 INFO L273 TraceCheckUtils]: 14: Hoare triple {3085#(<= 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; {3086#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:00,957 INFO L273 TraceCheckUtils]: 15: Hoare triple {3086#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3076#false} is VALID [2018-11-23 11:55:00,958 INFO L273 TraceCheckUtils]: 16: Hoare triple {3076#false} ~i~0 := 0; {3076#false} is VALID [2018-11-23 11:55:00,958 INFO L273 TraceCheckUtils]: 17: Hoare triple {3076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3076#false} is VALID [2018-11-23 11:55:00,958 INFO L273 TraceCheckUtils]: 18: Hoare triple {3076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3076#false} is VALID [2018-11-23 11:55:00,958 INFO L273 TraceCheckUtils]: 19: Hoare triple {3076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3076#false} is VALID [2018-11-23 11:55:00,958 INFO L273 TraceCheckUtils]: 20: Hoare triple {3076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3076#false} is VALID [2018-11-23 11:55:00,959 INFO L273 TraceCheckUtils]: 21: Hoare triple {3076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3076#false} is VALID [2018-11-23 11:55:00,959 INFO L273 TraceCheckUtils]: 22: Hoare triple {3076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3076#false} is VALID [2018-11-23 11:55:00,959 INFO L273 TraceCheckUtils]: 23: Hoare triple {3076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3076#false} is VALID [2018-11-23 11:55:00,959 INFO L273 TraceCheckUtils]: 24: Hoare triple {3076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3076#false} is VALID [2018-11-23 11:55:00,959 INFO L273 TraceCheckUtils]: 25: Hoare triple {3076#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3076#false} is VALID [2018-11-23 11:55:00,960 INFO L273 TraceCheckUtils]: 26: Hoare triple {3076#false} assume !(~i~0 < 100000); {3076#false} is VALID [2018-11-23 11:55:00,960 INFO L273 TraceCheckUtils]: 27: Hoare triple {3076#false} ~i~0 := 0; {3076#false} is VALID [2018-11-23 11:55:00,960 INFO L273 TraceCheckUtils]: 28: Hoare triple {3076#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3076#false} is VALID [2018-11-23 11:55:00,960 INFO L273 TraceCheckUtils]: 29: Hoare triple {3076#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3076#false} is VALID [2018-11-23 11:55:00,960 INFO L273 TraceCheckUtils]: 30: Hoare triple {3076#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3076#false} is VALID [2018-11-23 11:55:00,960 INFO L273 TraceCheckUtils]: 31: Hoare triple {3076#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3076#false} is VALID [2018-11-23 11:55:00,960 INFO L273 TraceCheckUtils]: 32: Hoare triple {3076#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3076#false} is VALID [2018-11-23 11:55:00,961 INFO L273 TraceCheckUtils]: 33: Hoare triple {3076#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3076#false} is VALID [2018-11-23 11:55:00,961 INFO L273 TraceCheckUtils]: 34: Hoare triple {3076#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3076#false} is VALID [2018-11-23 11:55:00,961 INFO L273 TraceCheckUtils]: 35: Hoare triple {3076#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3076#false} is VALID [2018-11-23 11:55:00,961 INFO L273 TraceCheckUtils]: 36: Hoare triple {3076#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3076#false} is VALID [2018-11-23 11:55:00,961 INFO L273 TraceCheckUtils]: 37: Hoare triple {3076#false} assume !(~i~0 < 100000); {3076#false} is VALID [2018-11-23 11:55:00,961 INFO L273 TraceCheckUtils]: 38: Hoare triple {3076#false} havoc ~x~0;~x~0 := 0; {3076#false} is VALID [2018-11-23 11:55:00,961 INFO L273 TraceCheckUtils]: 39: Hoare triple {3076#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3076#false} is VALID [2018-11-23 11:55:00,961 INFO L256 TraceCheckUtils]: 40: Hoare triple {3076#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {3076#false} is VALID [2018-11-23 11:55:00,962 INFO L273 TraceCheckUtils]: 41: Hoare triple {3076#false} ~cond := #in~cond; {3076#false} is VALID [2018-11-23 11:55:00,962 INFO L273 TraceCheckUtils]: 42: Hoare triple {3076#false} assume 0 == ~cond; {3076#false} is VALID [2018-11-23 11:55:00,962 INFO L273 TraceCheckUtils]: 43: Hoare triple {3076#false} assume !false; {3076#false} is VALID [2018-11-23 11:55:00,963 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-23 11:55:00,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:00,963 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:00,972 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:55:01,153 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:55:01,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:01,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:01,404 INFO L256 TraceCheckUtils]: 0: Hoare triple {3075#true} call ULTIMATE.init(); {3075#true} is VALID [2018-11-23 11:55:01,404 INFO L273 TraceCheckUtils]: 1: Hoare triple {3075#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3075#true} is VALID [2018-11-23 11:55:01,405 INFO L273 TraceCheckUtils]: 2: Hoare triple {3075#true} assume true; {3075#true} is VALID [2018-11-23 11:55:01,405 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3075#true} {3075#true} #74#return; {3075#true} is VALID [2018-11-23 11:55:01,405 INFO L256 TraceCheckUtils]: 4: Hoare triple {3075#true} call #t~ret2 := main(); {3075#true} is VALID [2018-11-23 11:55:01,405 INFO L273 TraceCheckUtils]: 5: Hoare triple {3075#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3075#true} is VALID [2018-11-23 11:55:01,406 INFO L273 TraceCheckUtils]: 6: Hoare triple {3075#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3075#true} is VALID [2018-11-23 11:55:01,406 INFO L273 TraceCheckUtils]: 7: Hoare triple {3075#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3075#true} is VALID [2018-11-23 11:55:01,406 INFO L273 TraceCheckUtils]: 8: Hoare triple {3075#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3075#true} is VALID [2018-11-23 11:55:01,406 INFO L273 TraceCheckUtils]: 9: Hoare triple {3075#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3075#true} is VALID [2018-11-23 11:55:01,406 INFO L273 TraceCheckUtils]: 10: Hoare triple {3075#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3075#true} is VALID [2018-11-23 11:55:01,407 INFO L273 TraceCheckUtils]: 11: Hoare triple {3075#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3075#true} is VALID [2018-11-23 11:55:01,407 INFO L273 TraceCheckUtils]: 12: Hoare triple {3075#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3075#true} is VALID [2018-11-23 11:55:01,407 INFO L273 TraceCheckUtils]: 13: Hoare triple {3075#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3075#true} is VALID [2018-11-23 11:55:01,407 INFO L273 TraceCheckUtils]: 14: Hoare triple {3075#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3075#true} is VALID [2018-11-23 11:55:01,407 INFO L273 TraceCheckUtils]: 15: Hoare triple {3075#true} assume !(~i~0 < 100000); {3075#true} is VALID [2018-11-23 11:55:01,407 INFO L273 TraceCheckUtils]: 16: Hoare triple {3075#true} ~i~0 := 0; {3075#true} is VALID [2018-11-23 11:55:01,407 INFO L273 TraceCheckUtils]: 17: Hoare triple {3075#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3075#true} is VALID [2018-11-23 11:55:01,408 INFO L273 TraceCheckUtils]: 18: Hoare triple {3075#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3075#true} is VALID [2018-11-23 11:55:01,408 INFO L273 TraceCheckUtils]: 19: Hoare triple {3075#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3075#true} is VALID [2018-11-23 11:55:01,408 INFO L273 TraceCheckUtils]: 20: Hoare triple {3075#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3075#true} is VALID [2018-11-23 11:55:01,408 INFO L273 TraceCheckUtils]: 21: Hoare triple {3075#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3075#true} is VALID [2018-11-23 11:55:01,408 INFO L273 TraceCheckUtils]: 22: Hoare triple {3075#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3075#true} is VALID [2018-11-23 11:55:01,408 INFO L273 TraceCheckUtils]: 23: Hoare triple {3075#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3075#true} is VALID [2018-11-23 11:55:01,408 INFO L273 TraceCheckUtils]: 24: Hoare triple {3075#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3075#true} is VALID [2018-11-23 11:55:01,408 INFO L273 TraceCheckUtils]: 25: Hoare triple {3075#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3075#true} is VALID [2018-11-23 11:55:01,409 INFO L273 TraceCheckUtils]: 26: Hoare triple {3075#true} assume !(~i~0 < 100000); {3075#true} is VALID [2018-11-23 11:55:01,409 INFO L273 TraceCheckUtils]: 27: Hoare triple {3075#true} ~i~0 := 0; {3171#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:01,410 INFO L273 TraceCheckUtils]: 28: Hoare triple {3171#(<= 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; {3078#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:01,410 INFO L273 TraceCheckUtils]: 29: Hoare triple {3078#(<= 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; {3079#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:01,411 INFO L273 TraceCheckUtils]: 30: Hoare triple {3079#(<= 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; {3080#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:01,411 INFO L273 TraceCheckUtils]: 31: Hoare triple {3080#(<= 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; {3081#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:01,412 INFO L273 TraceCheckUtils]: 32: Hoare triple {3081#(<= 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; {3082#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:01,413 INFO L273 TraceCheckUtils]: 33: Hoare triple {3082#(<= 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; {3083#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:01,414 INFO L273 TraceCheckUtils]: 34: Hoare triple {3083#(<= 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; {3084#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:01,415 INFO L273 TraceCheckUtils]: 35: Hoare triple {3084#(<= 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; {3085#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:01,416 INFO L273 TraceCheckUtils]: 36: Hoare triple {3085#(<= 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; {3086#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:01,417 INFO L273 TraceCheckUtils]: 37: Hoare triple {3086#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3076#false} is VALID [2018-11-23 11:55:01,417 INFO L273 TraceCheckUtils]: 38: Hoare triple {3076#false} havoc ~x~0;~x~0 := 0; {3076#false} is VALID [2018-11-23 11:55:01,417 INFO L273 TraceCheckUtils]: 39: Hoare triple {3076#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3076#false} is VALID [2018-11-23 11:55:01,417 INFO L256 TraceCheckUtils]: 40: Hoare triple {3076#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {3076#false} is VALID [2018-11-23 11:55:01,418 INFO L273 TraceCheckUtils]: 41: Hoare triple {3076#false} ~cond := #in~cond; {3076#false} is VALID [2018-11-23 11:55:01,418 INFO L273 TraceCheckUtils]: 42: Hoare triple {3076#false} assume 0 == ~cond; {3076#false} is VALID [2018-11-23 11:55:01,418 INFO L273 TraceCheckUtils]: 43: Hoare triple {3076#false} assume !false; {3076#false} is VALID [2018-11-23 11:55:01,420 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-23 11:55:01,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:01,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 11:55:01,442 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-11-23 11:55:01,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:01,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:55:01,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:01,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:55:01,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:55:01,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:55:01,515 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 13 states. [2018-11-23 11:55:01,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:01,811 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-11-23 11:55:01,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:55:01,811 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-11-23 11:55:01,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:01,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:55:01,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2018-11-23 11:55:01,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:55:01,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2018-11-23 11:55:01,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 75 transitions. [2018-11-23 11:55:01,962 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:01,963 INFO L225 Difference]: With dead ends: 85 [2018-11-23 11:55:01,963 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 11:55:01,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:55:01,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 11:55:02,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-23 11:55:02,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:02,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2018-11-23 11:55:02,003 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 11:55:02,003 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 11:55:02,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:02,004 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-11-23 11:55:02,004 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-23 11:55:02,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:02,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:02,005 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 11:55:02,005 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 11:55:02,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:02,006 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-11-23 11:55:02,006 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-23 11:55:02,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:02,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:02,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:02,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:02,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 11:55:02,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-11-23 11:55:02,008 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 44 [2018-11-23 11:55:02,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:02,008 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-11-23 11:55:02,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:55:02,009 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-23 11:55:02,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 11:55:02,009 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:02,009 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:02,010 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:02,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:02,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1397676122, now seen corresponding path program 10 times [2018-11-23 11:55:02,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:02,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:02,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:02,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:02,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:02,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:02,257 INFO L256 TraceCheckUtils]: 0: Hoare triple {3563#true} call ULTIMATE.init(); {3563#true} is VALID [2018-11-23 11:55:02,257 INFO L273 TraceCheckUtils]: 1: Hoare triple {3563#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3563#true} is VALID [2018-11-23 11:55:02,257 INFO L273 TraceCheckUtils]: 2: Hoare triple {3563#true} assume true; {3563#true} is VALID [2018-11-23 11:55:02,257 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3563#true} {3563#true} #74#return; {3563#true} is VALID [2018-11-23 11:55:02,257 INFO L256 TraceCheckUtils]: 4: Hoare triple {3563#true} call #t~ret2 := main(); {3563#true} is VALID [2018-11-23 11:55:02,258 INFO L273 TraceCheckUtils]: 5: Hoare triple {3563#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3565#(= main_~i~0 0)} is VALID [2018-11-23 11:55:02,259 INFO L273 TraceCheckUtils]: 6: Hoare triple {3565#(= 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; {3566#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:02,259 INFO L273 TraceCheckUtils]: 7: Hoare triple {3566#(<= 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; {3567#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:02,264 INFO L273 TraceCheckUtils]: 8: Hoare triple {3567#(<= 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; {3568#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:02,265 INFO L273 TraceCheckUtils]: 9: Hoare triple {3568#(<= 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; {3569#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:02,266 INFO L273 TraceCheckUtils]: 10: Hoare triple {3569#(<= 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; {3570#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:02,266 INFO L273 TraceCheckUtils]: 11: Hoare triple {3570#(<= 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; {3571#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:02,268 INFO L273 TraceCheckUtils]: 12: Hoare triple {3571#(<= 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; {3572#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:02,268 INFO L273 TraceCheckUtils]: 13: Hoare triple {3572#(<= 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; {3573#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:02,270 INFO L273 TraceCheckUtils]: 14: Hoare triple {3573#(<= 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; {3574#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:02,271 INFO L273 TraceCheckUtils]: 15: Hoare triple {3574#(<= 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; {3575#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:02,273 INFO L273 TraceCheckUtils]: 16: Hoare triple {3575#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3564#false} is VALID [2018-11-23 11:55:02,273 INFO L273 TraceCheckUtils]: 17: Hoare triple {3564#false} ~i~0 := 0; {3564#false} is VALID [2018-11-23 11:55:02,273 INFO L273 TraceCheckUtils]: 18: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,273 INFO L273 TraceCheckUtils]: 19: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,273 INFO L273 TraceCheckUtils]: 20: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,273 INFO L273 TraceCheckUtils]: 21: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,273 INFO L273 TraceCheckUtils]: 22: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,274 INFO L273 TraceCheckUtils]: 23: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,274 INFO L273 TraceCheckUtils]: 24: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,274 INFO L273 TraceCheckUtils]: 25: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,274 INFO L273 TraceCheckUtils]: 26: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,274 INFO L273 TraceCheckUtils]: 27: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,274 INFO L273 TraceCheckUtils]: 28: Hoare triple {3564#false} assume !(~i~0 < 100000); {3564#false} is VALID [2018-11-23 11:55:02,274 INFO L273 TraceCheckUtils]: 29: Hoare triple {3564#false} ~i~0 := 0; {3564#false} is VALID [2018-11-23 11:55:02,275 INFO L273 TraceCheckUtils]: 30: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,275 INFO L273 TraceCheckUtils]: 31: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,275 INFO L273 TraceCheckUtils]: 32: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,276 INFO L273 TraceCheckUtils]: 33: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,276 INFO L273 TraceCheckUtils]: 34: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,276 INFO L273 TraceCheckUtils]: 35: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,276 INFO L273 TraceCheckUtils]: 36: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,277 INFO L273 TraceCheckUtils]: 37: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,277 INFO L273 TraceCheckUtils]: 38: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,277 INFO L273 TraceCheckUtils]: 39: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,277 INFO L273 TraceCheckUtils]: 40: Hoare triple {3564#false} assume !(~i~0 < 100000); {3564#false} is VALID [2018-11-23 11:55:02,277 INFO L273 TraceCheckUtils]: 41: Hoare triple {3564#false} havoc ~x~0;~x~0 := 0; {3564#false} is VALID [2018-11-23 11:55:02,277 INFO L273 TraceCheckUtils]: 42: Hoare triple {3564#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3564#false} is VALID [2018-11-23 11:55:02,278 INFO L256 TraceCheckUtils]: 43: Hoare triple {3564#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {3564#false} is VALID [2018-11-23 11:55:02,278 INFO L273 TraceCheckUtils]: 44: Hoare triple {3564#false} ~cond := #in~cond; {3564#false} is VALID [2018-11-23 11:55:02,278 INFO L273 TraceCheckUtils]: 45: Hoare triple {3564#false} assume 0 == ~cond; {3564#false} is VALID [2018-11-23 11:55:02,278 INFO L273 TraceCheckUtils]: 46: Hoare triple {3564#false} assume !false; {3564#false} is VALID [2018-11-23 11:55:02,280 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-23 11:55:02,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:02,280 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:02,289 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:55:02,322 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:55:02,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:02,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:02,550 INFO L256 TraceCheckUtils]: 0: Hoare triple {3563#true} call ULTIMATE.init(); {3563#true} is VALID [2018-11-23 11:55:02,550 INFO L273 TraceCheckUtils]: 1: Hoare triple {3563#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3563#true} is VALID [2018-11-23 11:55:02,551 INFO L273 TraceCheckUtils]: 2: Hoare triple {3563#true} assume true; {3563#true} is VALID [2018-11-23 11:55:02,551 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3563#true} {3563#true} #74#return; {3563#true} is VALID [2018-11-23 11:55:02,551 INFO L256 TraceCheckUtils]: 4: Hoare triple {3563#true} call #t~ret2 := main(); {3563#true} is VALID [2018-11-23 11:55:02,552 INFO L273 TraceCheckUtils]: 5: Hoare triple {3563#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3594#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:02,571 INFO L273 TraceCheckUtils]: 6: Hoare triple {3594#(<= 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; {3566#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:02,580 INFO L273 TraceCheckUtils]: 7: Hoare triple {3566#(<= 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; {3567#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:02,591 INFO L273 TraceCheckUtils]: 8: Hoare triple {3567#(<= 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; {3568#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:02,592 INFO L273 TraceCheckUtils]: 9: Hoare triple {3568#(<= 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; {3569#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:02,592 INFO L273 TraceCheckUtils]: 10: Hoare triple {3569#(<= 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; {3570#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:02,612 INFO L273 TraceCheckUtils]: 11: Hoare triple {3570#(<= 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; {3571#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:02,613 INFO L273 TraceCheckUtils]: 12: Hoare triple {3571#(<= 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; {3572#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:02,613 INFO L273 TraceCheckUtils]: 13: Hoare triple {3572#(<= 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; {3573#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:02,614 INFO L273 TraceCheckUtils]: 14: Hoare triple {3573#(<= 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; {3574#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:02,614 INFO L273 TraceCheckUtils]: 15: Hoare triple {3574#(<= 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; {3575#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:02,615 INFO L273 TraceCheckUtils]: 16: Hoare triple {3575#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3564#false} is VALID [2018-11-23 11:55:02,615 INFO L273 TraceCheckUtils]: 17: Hoare triple {3564#false} ~i~0 := 0; {3564#false} is VALID [2018-11-23 11:55:02,615 INFO L273 TraceCheckUtils]: 18: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,615 INFO L273 TraceCheckUtils]: 19: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,616 INFO L273 TraceCheckUtils]: 20: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,616 INFO L273 TraceCheckUtils]: 21: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,616 INFO L273 TraceCheckUtils]: 22: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,616 INFO L273 TraceCheckUtils]: 23: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,616 INFO L273 TraceCheckUtils]: 24: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,617 INFO L273 TraceCheckUtils]: 25: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,617 INFO L273 TraceCheckUtils]: 26: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,617 INFO L273 TraceCheckUtils]: 27: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,617 INFO L273 TraceCheckUtils]: 28: Hoare triple {3564#false} assume !(~i~0 < 100000); {3564#false} is VALID [2018-11-23 11:55:02,617 INFO L273 TraceCheckUtils]: 29: Hoare triple {3564#false} ~i~0 := 0; {3564#false} is VALID [2018-11-23 11:55:02,618 INFO L273 TraceCheckUtils]: 30: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,618 INFO L273 TraceCheckUtils]: 31: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,618 INFO L273 TraceCheckUtils]: 32: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,618 INFO L273 TraceCheckUtils]: 33: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,618 INFO L273 TraceCheckUtils]: 34: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,619 INFO L273 TraceCheckUtils]: 35: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,619 INFO L273 TraceCheckUtils]: 36: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,619 INFO L273 TraceCheckUtils]: 37: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,619 INFO L273 TraceCheckUtils]: 38: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,619 INFO L273 TraceCheckUtils]: 39: Hoare triple {3564#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3564#false} is VALID [2018-11-23 11:55:02,620 INFO L273 TraceCheckUtils]: 40: Hoare triple {3564#false} assume !(~i~0 < 100000); {3564#false} is VALID [2018-11-23 11:55:02,620 INFO L273 TraceCheckUtils]: 41: Hoare triple {3564#false} havoc ~x~0;~x~0 := 0; {3564#false} is VALID [2018-11-23 11:55:02,620 INFO L273 TraceCheckUtils]: 42: Hoare triple {3564#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3564#false} is VALID [2018-11-23 11:55:02,620 INFO L256 TraceCheckUtils]: 43: Hoare triple {3564#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {3564#false} is VALID [2018-11-23 11:55:02,620 INFO L273 TraceCheckUtils]: 44: Hoare triple {3564#false} ~cond := #in~cond; {3564#false} is VALID [2018-11-23 11:55:02,620 INFO L273 TraceCheckUtils]: 45: Hoare triple {3564#false} assume 0 == ~cond; {3564#false} is VALID [2018-11-23 11:55:02,620 INFO L273 TraceCheckUtils]: 46: Hoare triple {3564#false} assume !false; {3564#false} is VALID [2018-11-23 11:55:02,622 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-23 11:55:02,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:02,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 11:55:02,642 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2018-11-23 11:55:02,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:02,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:55:02,664 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:02,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:55:02,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:55:02,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:55:02,665 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 14 states. [2018-11-23 11:55:03,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:03,052 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2018-11-23 11:55:03,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:55:03,052 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2018-11-23 11:55:03,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:03,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:55:03,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2018-11-23 11:55:03,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:55:03,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2018-11-23 11:55:03,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 78 transitions. [2018-11-23 11:55:03,148 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:03,150 INFO L225 Difference]: With dead ends: 90 [2018-11-23 11:55:03,150 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 11:55:03,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 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 11:55:03,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 11:55:03,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-23 11:55:03,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:03,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2018-11-23 11:55:03,215 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2018-11-23 11:55:03,215 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2018-11-23 11:55:03,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:03,216 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-11-23 11:55:03,216 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-11-23 11:55:03,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:03,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:03,218 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2018-11-23 11:55:03,218 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2018-11-23 11:55:03,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:03,220 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-11-23 11:55:03,220 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-11-23 11:55:03,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:03,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:03,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:03,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:03,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 11:55:03,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-11-23 11:55:03,222 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 47 [2018-11-23 11:55:03,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:03,222 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-11-23 11:55:03,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:55:03,223 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-11-23 11:55:03,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 11:55:03,223 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:03,223 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:03,224 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:03,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:03,224 INFO L82 PathProgramCache]: Analyzing trace with hash -110123167, now seen corresponding path program 11 times [2018-11-23 11:55:03,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:03,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:03,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:03,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:03,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:03,999 INFO L256 TraceCheckUtils]: 0: Hoare triple {4083#true} call ULTIMATE.init(); {4083#true} is VALID [2018-11-23 11:55:03,999 INFO L273 TraceCheckUtils]: 1: Hoare triple {4083#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4083#true} is VALID [2018-11-23 11:55:04,000 INFO L273 TraceCheckUtils]: 2: Hoare triple {4083#true} assume true; {4083#true} is VALID [2018-11-23 11:55:04,000 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4083#true} {4083#true} #74#return; {4083#true} is VALID [2018-11-23 11:55:04,000 INFO L256 TraceCheckUtils]: 4: Hoare triple {4083#true} call #t~ret2 := main(); {4083#true} is VALID [2018-11-23 11:55:04,001 INFO L273 TraceCheckUtils]: 5: Hoare triple {4083#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4085#(= main_~i~0 0)} is VALID [2018-11-23 11:55:04,002 INFO L273 TraceCheckUtils]: 6: Hoare triple {4085#(= 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; {4086#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:04,002 INFO L273 TraceCheckUtils]: 7: Hoare triple {4086#(<= 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; {4087#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:04,003 INFO L273 TraceCheckUtils]: 8: Hoare triple {4087#(<= 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; {4088#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:04,004 INFO L273 TraceCheckUtils]: 9: Hoare triple {4088#(<= 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; {4089#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:04,004 INFO L273 TraceCheckUtils]: 10: Hoare triple {4089#(<= 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; {4090#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:04,005 INFO L273 TraceCheckUtils]: 11: Hoare triple {4090#(<= 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; {4091#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:04,006 INFO L273 TraceCheckUtils]: 12: Hoare triple {4091#(<= 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; {4092#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:04,007 INFO L273 TraceCheckUtils]: 13: Hoare triple {4092#(<= 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; {4093#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:04,008 INFO L273 TraceCheckUtils]: 14: Hoare triple {4093#(<= 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; {4094#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:04,009 INFO L273 TraceCheckUtils]: 15: Hoare triple {4094#(<= 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; {4095#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:04,010 INFO L273 TraceCheckUtils]: 16: Hoare triple {4095#(<= 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; {4096#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:04,011 INFO L273 TraceCheckUtils]: 17: Hoare triple {4096#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4084#false} is VALID [2018-11-23 11:55:04,012 INFO L273 TraceCheckUtils]: 18: Hoare triple {4084#false} ~i~0 := 0; {4084#false} is VALID [2018-11-23 11:55:04,012 INFO L273 TraceCheckUtils]: 19: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:04,012 INFO L273 TraceCheckUtils]: 20: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:04,012 INFO L273 TraceCheckUtils]: 21: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:04,013 INFO L273 TraceCheckUtils]: 22: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:04,013 INFO L273 TraceCheckUtils]: 23: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:04,013 INFO L273 TraceCheckUtils]: 24: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:04,013 INFO L273 TraceCheckUtils]: 25: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:04,014 INFO L273 TraceCheckUtils]: 26: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:04,014 INFO L273 TraceCheckUtils]: 27: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:04,014 INFO L273 TraceCheckUtils]: 28: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:04,014 INFO L273 TraceCheckUtils]: 29: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:04,014 INFO L273 TraceCheckUtils]: 30: Hoare triple {4084#false} assume !(~i~0 < 100000); {4084#false} is VALID [2018-11-23 11:55:04,014 INFO L273 TraceCheckUtils]: 31: Hoare triple {4084#false} ~i~0 := 0; {4084#false} is VALID [2018-11-23 11:55:04,015 INFO L273 TraceCheckUtils]: 32: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:04,015 INFO L273 TraceCheckUtils]: 33: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:04,015 INFO L273 TraceCheckUtils]: 34: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:04,015 INFO L273 TraceCheckUtils]: 35: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:04,015 INFO L273 TraceCheckUtils]: 36: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:04,015 INFO L273 TraceCheckUtils]: 37: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:04,016 INFO L273 TraceCheckUtils]: 38: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:04,016 INFO L273 TraceCheckUtils]: 39: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:04,016 INFO L273 TraceCheckUtils]: 40: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:04,016 INFO L273 TraceCheckUtils]: 41: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:04,016 INFO L273 TraceCheckUtils]: 42: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:04,016 INFO L273 TraceCheckUtils]: 43: Hoare triple {4084#false} assume !(~i~0 < 100000); {4084#false} is VALID [2018-11-23 11:55:04,016 INFO L273 TraceCheckUtils]: 44: Hoare triple {4084#false} havoc ~x~0;~x~0 := 0; {4084#false} is VALID [2018-11-23 11:55:04,017 INFO L273 TraceCheckUtils]: 45: Hoare triple {4084#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4084#false} is VALID [2018-11-23 11:55:04,017 INFO L256 TraceCheckUtils]: 46: Hoare triple {4084#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {4084#false} is VALID [2018-11-23 11:55:04,017 INFO L273 TraceCheckUtils]: 47: Hoare triple {4084#false} ~cond := #in~cond; {4084#false} is VALID [2018-11-23 11:55:04,017 INFO L273 TraceCheckUtils]: 48: Hoare triple {4084#false} assume 0 == ~cond; {4084#false} is VALID [2018-11-23 11:55:04,017 INFO L273 TraceCheckUtils]: 49: Hoare triple {4084#false} assume !false; {4084#false} is VALID [2018-11-23 11:55:04,020 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-11-23 11:55:04,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:04,020 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:04,030 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:55:10,100 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 11:55:10,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:10,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:10,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:10,263 INFO L256 TraceCheckUtils]: 0: Hoare triple {4083#true} call ULTIMATE.init(); {4083#true} is VALID [2018-11-23 11:55:10,264 INFO L273 TraceCheckUtils]: 1: Hoare triple {4083#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4083#true} is VALID [2018-11-23 11:55:10,264 INFO L273 TraceCheckUtils]: 2: Hoare triple {4083#true} assume true; {4083#true} is VALID [2018-11-23 11:55:10,264 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4083#true} {4083#true} #74#return; {4083#true} is VALID [2018-11-23 11:55:10,265 INFO L256 TraceCheckUtils]: 4: Hoare triple {4083#true} call #t~ret2 := main(); {4083#true} is VALID [2018-11-23 11:55:10,265 INFO L273 TraceCheckUtils]: 5: Hoare triple {4083#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4115#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:10,266 INFO L273 TraceCheckUtils]: 6: Hoare triple {4115#(<= 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; {4086#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:10,267 INFO L273 TraceCheckUtils]: 7: Hoare triple {4086#(<= 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; {4087#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:10,267 INFO L273 TraceCheckUtils]: 8: Hoare triple {4087#(<= 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; {4088#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:10,268 INFO L273 TraceCheckUtils]: 9: Hoare triple {4088#(<= 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; {4089#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:10,269 INFO L273 TraceCheckUtils]: 10: Hoare triple {4089#(<= 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; {4090#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:10,270 INFO L273 TraceCheckUtils]: 11: Hoare triple {4090#(<= 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; {4091#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:10,271 INFO L273 TraceCheckUtils]: 12: Hoare triple {4091#(<= 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; {4092#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:10,272 INFO L273 TraceCheckUtils]: 13: Hoare triple {4092#(<= 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; {4093#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:10,273 INFO L273 TraceCheckUtils]: 14: Hoare triple {4093#(<= 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; {4094#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:10,274 INFO L273 TraceCheckUtils]: 15: Hoare triple {4094#(<= 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; {4095#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:10,275 INFO L273 TraceCheckUtils]: 16: Hoare triple {4095#(<= 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; {4096#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:10,276 INFO L273 TraceCheckUtils]: 17: Hoare triple {4096#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4084#false} is VALID [2018-11-23 11:55:10,276 INFO L273 TraceCheckUtils]: 18: Hoare triple {4084#false} ~i~0 := 0; {4084#false} is VALID [2018-11-23 11:55:10,277 INFO L273 TraceCheckUtils]: 19: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:10,277 INFO L273 TraceCheckUtils]: 20: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:10,277 INFO L273 TraceCheckUtils]: 21: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:10,277 INFO L273 TraceCheckUtils]: 22: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:10,278 INFO L273 TraceCheckUtils]: 23: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:10,278 INFO L273 TraceCheckUtils]: 24: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:10,278 INFO L273 TraceCheckUtils]: 25: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:10,278 INFO L273 TraceCheckUtils]: 26: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:10,279 INFO L273 TraceCheckUtils]: 27: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:10,279 INFO L273 TraceCheckUtils]: 28: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:10,279 INFO L273 TraceCheckUtils]: 29: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:10,279 INFO L273 TraceCheckUtils]: 30: Hoare triple {4084#false} assume !(~i~0 < 100000); {4084#false} is VALID [2018-11-23 11:55:10,280 INFO L273 TraceCheckUtils]: 31: Hoare triple {4084#false} ~i~0 := 0; {4084#false} is VALID [2018-11-23 11:55:10,280 INFO L273 TraceCheckUtils]: 32: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:10,280 INFO L273 TraceCheckUtils]: 33: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:10,280 INFO L273 TraceCheckUtils]: 34: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:10,280 INFO L273 TraceCheckUtils]: 35: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:10,281 INFO L273 TraceCheckUtils]: 36: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:10,281 INFO L273 TraceCheckUtils]: 37: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:10,281 INFO L273 TraceCheckUtils]: 38: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:10,281 INFO L273 TraceCheckUtils]: 39: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:10,281 INFO L273 TraceCheckUtils]: 40: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:10,282 INFO L273 TraceCheckUtils]: 41: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:10,282 INFO L273 TraceCheckUtils]: 42: Hoare triple {4084#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4084#false} is VALID [2018-11-23 11:55:10,282 INFO L273 TraceCheckUtils]: 43: Hoare triple {4084#false} assume !(~i~0 < 100000); {4084#false} is VALID [2018-11-23 11:55:10,282 INFO L273 TraceCheckUtils]: 44: Hoare triple {4084#false} havoc ~x~0;~x~0 := 0; {4084#false} is VALID [2018-11-23 11:55:10,283 INFO L273 TraceCheckUtils]: 45: Hoare triple {4084#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4084#false} is VALID [2018-11-23 11:55:10,283 INFO L256 TraceCheckUtils]: 46: Hoare triple {4084#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {4084#false} is VALID [2018-11-23 11:55:10,283 INFO L273 TraceCheckUtils]: 47: Hoare triple {4084#false} ~cond := #in~cond; {4084#false} is VALID [2018-11-23 11:55:10,283 INFO L273 TraceCheckUtils]: 48: Hoare triple {4084#false} assume 0 == ~cond; {4084#false} is VALID [2018-11-23 11:55:10,283 INFO L273 TraceCheckUtils]: 49: Hoare triple {4084#false} assume !false; {4084#false} is VALID [2018-11-23 11:55:10,287 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-11-23 11:55:10,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:10,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 11:55:10,319 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2018-11-23 11:55:10,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:10,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:55:10,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:10,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:55:10,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:55:10,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:55:10,414 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 15 states. [2018-11-23 11:55:10,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:10,772 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2018-11-23 11:55:10,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:55:10,772 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2018-11-23 11:55:10,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:10,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:55:10,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 81 transitions. [2018-11-23 11:55:10,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:55:10,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 81 transitions. [2018-11-23 11:55:10,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 81 transitions. [2018-11-23 11:55:10,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:10,869 INFO L225 Difference]: With dead ends: 95 [2018-11-23 11:55:10,869 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 11:55:10,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:55:10,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 11:55:10,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-23 11:55:10,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:10,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-23 11:55:10,932 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 11:55:10,932 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 11:55:10,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:10,934 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-11-23 11:55:10,934 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-11-23 11:55:10,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:10,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:10,934 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 11:55:10,935 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 11:55:10,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:10,936 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-11-23 11:55:10,936 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-11-23 11:55:10,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:10,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:10,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:10,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:10,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 11:55:10,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-11-23 11:55:10,938 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 50 [2018-11-23 11:55:10,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:10,939 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-11-23 11:55:10,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:55:10,939 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-11-23 11:55:10,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 11:55:10,940 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:10,940 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:10,940 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:10,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:10,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1531998470, now seen corresponding path program 12 times [2018-11-23 11:55:10,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:10,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:10,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:10,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:10,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:11,558 INFO L256 TraceCheckUtils]: 0: Hoare triple {4635#true} call ULTIMATE.init(); {4635#true} is VALID [2018-11-23 11:55:11,559 INFO L273 TraceCheckUtils]: 1: Hoare triple {4635#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4635#true} is VALID [2018-11-23 11:55:11,559 INFO L273 TraceCheckUtils]: 2: Hoare triple {4635#true} assume true; {4635#true} is VALID [2018-11-23 11:55:11,559 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4635#true} {4635#true} #74#return; {4635#true} is VALID [2018-11-23 11:55:11,559 INFO L256 TraceCheckUtils]: 4: Hoare triple {4635#true} call #t~ret2 := main(); {4635#true} is VALID [2018-11-23 11:55:11,560 INFO L273 TraceCheckUtils]: 5: Hoare triple {4635#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4637#(= main_~i~0 0)} is VALID [2018-11-23 11:55:11,561 INFO L273 TraceCheckUtils]: 6: Hoare triple {4637#(= 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; {4638#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:11,561 INFO L273 TraceCheckUtils]: 7: Hoare triple {4638#(<= 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; {4639#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:11,562 INFO L273 TraceCheckUtils]: 8: Hoare triple {4639#(<= 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; {4640#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:11,563 INFO L273 TraceCheckUtils]: 9: Hoare triple {4640#(<= 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; {4641#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:11,563 INFO L273 TraceCheckUtils]: 10: Hoare triple {4641#(<= 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; {4642#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:11,564 INFO L273 TraceCheckUtils]: 11: Hoare triple {4642#(<= 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; {4643#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:11,565 INFO L273 TraceCheckUtils]: 12: Hoare triple {4643#(<= 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; {4644#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:11,566 INFO L273 TraceCheckUtils]: 13: Hoare triple {4644#(<= 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; {4645#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:11,567 INFO L273 TraceCheckUtils]: 14: Hoare triple {4645#(<= 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; {4646#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:11,568 INFO L273 TraceCheckUtils]: 15: Hoare triple {4646#(<= 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; {4647#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:11,569 INFO L273 TraceCheckUtils]: 16: Hoare triple {4647#(<= 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; {4648#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:11,570 INFO L273 TraceCheckUtils]: 17: Hoare triple {4648#(<= 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; {4649#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:11,571 INFO L273 TraceCheckUtils]: 18: Hoare triple {4649#(<= main_~i~0 12)} assume !(~i~0 < 100000); {4636#false} is VALID [2018-11-23 11:55:11,571 INFO L273 TraceCheckUtils]: 19: Hoare triple {4636#false} ~i~0 := 0; {4636#false} is VALID [2018-11-23 11:55:11,571 INFO L273 TraceCheckUtils]: 20: Hoare triple {4636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#false} is VALID [2018-11-23 11:55:11,571 INFO L273 TraceCheckUtils]: 21: Hoare triple {4636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#false} is VALID [2018-11-23 11:55:11,571 INFO L273 TraceCheckUtils]: 22: Hoare triple {4636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#false} is VALID [2018-11-23 11:55:11,572 INFO L273 TraceCheckUtils]: 23: Hoare triple {4636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#false} is VALID [2018-11-23 11:55:11,572 INFO L273 TraceCheckUtils]: 24: Hoare triple {4636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#false} is VALID [2018-11-23 11:55:11,572 INFO L273 TraceCheckUtils]: 25: Hoare triple {4636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#false} is VALID [2018-11-23 11:55:11,572 INFO L273 TraceCheckUtils]: 26: Hoare triple {4636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#false} is VALID [2018-11-23 11:55:11,573 INFO L273 TraceCheckUtils]: 27: Hoare triple {4636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#false} is VALID [2018-11-23 11:55:11,573 INFO L273 TraceCheckUtils]: 28: Hoare triple {4636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#false} is VALID [2018-11-23 11:55:11,573 INFO L273 TraceCheckUtils]: 29: Hoare triple {4636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#false} is VALID [2018-11-23 11:55:11,573 INFO L273 TraceCheckUtils]: 30: Hoare triple {4636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#false} is VALID [2018-11-23 11:55:11,573 INFO L273 TraceCheckUtils]: 31: Hoare triple {4636#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#false} is VALID [2018-11-23 11:55:11,574 INFO L273 TraceCheckUtils]: 32: Hoare triple {4636#false} assume !(~i~0 < 100000); {4636#false} is VALID [2018-11-23 11:55:11,574 INFO L273 TraceCheckUtils]: 33: Hoare triple {4636#false} ~i~0 := 0; {4636#false} is VALID [2018-11-23 11:55:11,574 INFO L273 TraceCheckUtils]: 34: Hoare triple {4636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#false} is VALID [2018-11-23 11:55:11,574 INFO L273 TraceCheckUtils]: 35: Hoare triple {4636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#false} is VALID [2018-11-23 11:55:11,574 INFO L273 TraceCheckUtils]: 36: Hoare triple {4636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#false} is VALID [2018-11-23 11:55:11,574 INFO L273 TraceCheckUtils]: 37: Hoare triple {4636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#false} is VALID [2018-11-23 11:55:11,574 INFO L273 TraceCheckUtils]: 38: Hoare triple {4636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#false} is VALID [2018-11-23 11:55:11,574 INFO L273 TraceCheckUtils]: 39: Hoare triple {4636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#false} is VALID [2018-11-23 11:55:11,575 INFO L273 TraceCheckUtils]: 40: Hoare triple {4636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#false} is VALID [2018-11-23 11:55:11,575 INFO L273 TraceCheckUtils]: 41: Hoare triple {4636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#false} is VALID [2018-11-23 11:55:11,575 INFO L273 TraceCheckUtils]: 42: Hoare triple {4636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#false} is VALID [2018-11-23 11:55:11,575 INFO L273 TraceCheckUtils]: 43: Hoare triple {4636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#false} is VALID [2018-11-23 11:55:11,575 INFO L273 TraceCheckUtils]: 44: Hoare triple {4636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#false} is VALID [2018-11-23 11:55:11,575 INFO L273 TraceCheckUtils]: 45: Hoare triple {4636#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#false} is VALID [2018-11-23 11:55:11,575 INFO L273 TraceCheckUtils]: 46: Hoare triple {4636#false} assume !(~i~0 < 100000); {4636#false} is VALID [2018-11-23 11:55:11,575 INFO L273 TraceCheckUtils]: 47: Hoare triple {4636#false} havoc ~x~0;~x~0 := 0; {4636#false} is VALID [2018-11-23 11:55:11,576 INFO L273 TraceCheckUtils]: 48: Hoare triple {4636#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4636#false} is VALID [2018-11-23 11:55:11,576 INFO L256 TraceCheckUtils]: 49: Hoare triple {4636#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {4636#false} is VALID [2018-11-23 11:55:11,576 INFO L273 TraceCheckUtils]: 50: Hoare triple {4636#false} ~cond := #in~cond; {4636#false} is VALID [2018-11-23 11:55:11,576 INFO L273 TraceCheckUtils]: 51: Hoare triple {4636#false} assume 0 == ~cond; {4636#false} is VALID [2018-11-23 11:55:11,576 INFO L273 TraceCheckUtils]: 52: Hoare triple {4636#false} assume !false; {4636#false} is VALID [2018-11-23 11:55:11,577 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-11-23 11:55:11,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:11,578 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:11,587 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:55:17,943 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 11:55:17,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:17,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:18,168 INFO L256 TraceCheckUtils]: 0: Hoare triple {4635#true} call ULTIMATE.init(); {4635#true} is VALID [2018-11-23 11:55:18,169 INFO L273 TraceCheckUtils]: 1: Hoare triple {4635#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4635#true} is VALID [2018-11-23 11:55:18,169 INFO L273 TraceCheckUtils]: 2: Hoare triple {4635#true} assume true; {4635#true} is VALID [2018-11-23 11:55:18,169 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4635#true} {4635#true} #74#return; {4635#true} is VALID [2018-11-23 11:55:18,169 INFO L256 TraceCheckUtils]: 4: Hoare triple {4635#true} call #t~ret2 := main(); {4635#true} is VALID [2018-11-23 11:55:18,170 INFO L273 TraceCheckUtils]: 5: Hoare triple {4635#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4635#true} is VALID [2018-11-23 11:55:18,170 INFO L273 TraceCheckUtils]: 6: Hoare triple {4635#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4635#true} is VALID [2018-11-23 11:55:18,170 INFO L273 TraceCheckUtils]: 7: Hoare triple {4635#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4635#true} is VALID [2018-11-23 11:55:18,170 INFO L273 TraceCheckUtils]: 8: Hoare triple {4635#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4635#true} is VALID [2018-11-23 11:55:18,170 INFO L273 TraceCheckUtils]: 9: Hoare triple {4635#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4635#true} is VALID [2018-11-23 11:55:18,171 INFO L273 TraceCheckUtils]: 10: Hoare triple {4635#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4635#true} is VALID [2018-11-23 11:55:18,171 INFO L273 TraceCheckUtils]: 11: Hoare triple {4635#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4635#true} is VALID [2018-11-23 11:55:18,171 INFO L273 TraceCheckUtils]: 12: Hoare triple {4635#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4635#true} is VALID [2018-11-23 11:55:18,171 INFO L273 TraceCheckUtils]: 13: Hoare triple {4635#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4635#true} is VALID [2018-11-23 11:55:18,171 INFO L273 TraceCheckUtils]: 14: Hoare triple {4635#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4635#true} is VALID [2018-11-23 11:55:18,172 INFO L273 TraceCheckUtils]: 15: Hoare triple {4635#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4635#true} is VALID [2018-11-23 11:55:18,172 INFO L273 TraceCheckUtils]: 16: Hoare triple {4635#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4635#true} is VALID [2018-11-23 11:55:18,173 INFO L273 TraceCheckUtils]: 17: Hoare triple {4635#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4704#(<= main_~i~0 100000)} is VALID [2018-11-23 11:55:18,173 INFO L273 TraceCheckUtils]: 18: Hoare triple {4704#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {4635#true} is VALID [2018-11-23 11:55:18,173 INFO L273 TraceCheckUtils]: 19: Hoare triple {4635#true} ~i~0 := 0; {4635#true} is VALID [2018-11-23 11:55:18,173 INFO L273 TraceCheckUtils]: 20: Hoare triple {4635#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4635#true} is VALID [2018-11-23 11:55:18,173 INFO L273 TraceCheckUtils]: 21: Hoare triple {4635#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4635#true} is VALID [2018-11-23 11:55:18,173 INFO L273 TraceCheckUtils]: 22: Hoare triple {4635#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4635#true} is VALID [2018-11-23 11:55:18,174 INFO L273 TraceCheckUtils]: 23: Hoare triple {4635#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4635#true} is VALID [2018-11-23 11:55:18,174 INFO L273 TraceCheckUtils]: 24: Hoare triple {4635#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4635#true} is VALID [2018-11-23 11:55:18,174 INFO L273 TraceCheckUtils]: 25: Hoare triple {4635#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4635#true} is VALID [2018-11-23 11:55:18,174 INFO L273 TraceCheckUtils]: 26: Hoare triple {4635#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4635#true} is VALID [2018-11-23 11:55:18,174 INFO L273 TraceCheckUtils]: 27: Hoare triple {4635#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4635#true} is VALID [2018-11-23 11:55:18,174 INFO L273 TraceCheckUtils]: 28: Hoare triple {4635#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4635#true} is VALID [2018-11-23 11:55:18,174 INFO L273 TraceCheckUtils]: 29: Hoare triple {4635#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4635#true} is VALID [2018-11-23 11:55:18,174 INFO L273 TraceCheckUtils]: 30: Hoare triple {4635#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4635#true} is VALID [2018-11-23 11:55:18,175 INFO L273 TraceCheckUtils]: 31: Hoare triple {4635#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4704#(<= main_~i~0 100000)} is VALID [2018-11-23 11:55:18,175 INFO L273 TraceCheckUtils]: 32: Hoare triple {4704#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {4635#true} is VALID [2018-11-23 11:55:18,176 INFO L273 TraceCheckUtils]: 33: Hoare triple {4635#true} ~i~0 := 0; {4753#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:18,176 INFO L273 TraceCheckUtils]: 34: Hoare triple {4753#(<= 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; {4638#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:18,177 INFO L273 TraceCheckUtils]: 35: Hoare triple {4638#(<= 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; {4639#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:18,178 INFO L273 TraceCheckUtils]: 36: Hoare triple {4639#(<= 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; {4640#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:18,179 INFO L273 TraceCheckUtils]: 37: Hoare triple {4640#(<= 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; {4641#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:18,180 INFO L273 TraceCheckUtils]: 38: Hoare triple {4641#(<= 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; {4642#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:18,181 INFO L273 TraceCheckUtils]: 39: Hoare triple {4642#(<= 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; {4643#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:18,182 INFO L273 TraceCheckUtils]: 40: Hoare triple {4643#(<= 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; {4644#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:18,183 INFO L273 TraceCheckUtils]: 41: Hoare triple {4644#(<= 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; {4645#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:18,184 INFO L273 TraceCheckUtils]: 42: Hoare triple {4645#(<= 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; {4646#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:18,185 INFO L273 TraceCheckUtils]: 43: Hoare triple {4646#(<= 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; {4647#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:18,186 INFO L273 TraceCheckUtils]: 44: Hoare triple {4647#(<= 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; {4648#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:18,187 INFO L273 TraceCheckUtils]: 45: Hoare triple {4648#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4649#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:18,187 INFO L273 TraceCheckUtils]: 46: Hoare triple {4649#(<= main_~i~0 12)} assume !(~i~0 < 100000); {4636#false} is VALID [2018-11-23 11:55:18,187 INFO L273 TraceCheckUtils]: 47: Hoare triple {4636#false} havoc ~x~0;~x~0 := 0; {4636#false} is VALID [2018-11-23 11:55:18,188 INFO L273 TraceCheckUtils]: 48: Hoare triple {4636#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4636#false} is VALID [2018-11-23 11:55:18,188 INFO L256 TraceCheckUtils]: 49: Hoare triple {4636#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {4636#false} is VALID [2018-11-23 11:55:18,188 INFO L273 TraceCheckUtils]: 50: Hoare triple {4636#false} ~cond := #in~cond; {4636#false} is VALID [2018-11-23 11:55:18,188 INFO L273 TraceCheckUtils]: 51: Hoare triple {4636#false} assume 0 == ~cond; {4636#false} is VALID [2018-11-23 11:55:18,189 INFO L273 TraceCheckUtils]: 52: Hoare triple {4636#false} assume !false; {4636#false} is VALID [2018-11-23 11:55:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 24 proven. 78 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-11-23 11:55:18,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:18,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 17 [2018-11-23 11:55:18,214 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-11-23 11:55:18,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:18,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:55:18,266 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:18,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:55:18,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:55:18,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:55:18,267 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 17 states. [2018-11-23 11:55:18,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:18,693 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2018-11-23 11:55:18,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:55:18,694 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-11-23 11:55:18,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:18,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:55:18,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 84 transitions. [2018-11-23 11:55:18,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:55:18,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 84 transitions. [2018-11-23 11:55:18,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 84 transitions. [2018-11-23 11:55:19,161 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:19,163 INFO L225 Difference]: With dead ends: 100 [2018-11-23 11:55:19,163 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 11:55:19,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:55:19,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 11:55:20,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-23 11:55:20,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:20,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 61 states. [2018-11-23 11:55:20,246 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-23 11:55:20,247 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-23 11:55:20,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:20,248 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-11-23 11:55:20,248 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-11-23 11:55:20,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:20,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:20,249 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-23 11:55:20,249 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-23 11:55:20,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:20,250 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-11-23 11:55:20,250 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-11-23 11:55:20,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:20,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:20,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:20,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:20,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 11:55:20,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-11-23 11:55:20,252 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 53 [2018-11-23 11:55:20,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:20,253 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-11-23 11:55:20,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:55:20,253 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-11-23 11:55:20,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 11:55:20,253 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:20,253 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:20,254 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:20,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:20,254 INFO L82 PathProgramCache]: Analyzing trace with hash -420881343, now seen corresponding path program 13 times [2018-11-23 11:55:20,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:20,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:20,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:20,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:20,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:20,994 INFO L256 TraceCheckUtils]: 0: Hoare triple {5220#true} call ULTIMATE.init(); {5220#true} is VALID [2018-11-23 11:55:20,995 INFO L273 TraceCheckUtils]: 1: Hoare triple {5220#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5220#true} is VALID [2018-11-23 11:55:20,995 INFO L273 TraceCheckUtils]: 2: Hoare triple {5220#true} assume true; {5220#true} is VALID [2018-11-23 11:55:20,995 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5220#true} {5220#true} #74#return; {5220#true} is VALID [2018-11-23 11:55:20,995 INFO L256 TraceCheckUtils]: 4: Hoare triple {5220#true} call #t~ret2 := main(); {5220#true} is VALID [2018-11-23 11:55:20,996 INFO L273 TraceCheckUtils]: 5: Hoare triple {5220#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5222#(= main_~i~0 0)} is VALID [2018-11-23 11:55:20,997 INFO L273 TraceCheckUtils]: 6: Hoare triple {5222#(= 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; {5223#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:20,997 INFO L273 TraceCheckUtils]: 7: Hoare triple {5223#(<= 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; {5224#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:20,998 INFO L273 TraceCheckUtils]: 8: Hoare triple {5224#(<= 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; {5225#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:20,999 INFO L273 TraceCheckUtils]: 9: Hoare triple {5225#(<= 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; {5226#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:20,999 INFO L273 TraceCheckUtils]: 10: Hoare triple {5226#(<= 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; {5227#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:21,000 INFO L273 TraceCheckUtils]: 11: Hoare triple {5227#(<= 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; {5228#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:21,001 INFO L273 TraceCheckUtils]: 12: Hoare triple {5228#(<= 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; {5229#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:21,002 INFO L273 TraceCheckUtils]: 13: Hoare triple {5229#(<= 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; {5230#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:21,003 INFO L273 TraceCheckUtils]: 14: Hoare triple {5230#(<= 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; {5231#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:21,004 INFO L273 TraceCheckUtils]: 15: Hoare triple {5231#(<= 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; {5232#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:21,005 INFO L273 TraceCheckUtils]: 16: Hoare triple {5232#(<= 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; {5233#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:21,006 INFO L273 TraceCheckUtils]: 17: Hoare triple {5233#(<= 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; {5234#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:21,007 INFO L273 TraceCheckUtils]: 18: Hoare triple {5234#(<= 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; {5235#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:21,007 INFO L273 TraceCheckUtils]: 19: Hoare triple {5235#(<= main_~i~0 13)} assume !(~i~0 < 100000); {5221#false} is VALID [2018-11-23 11:55:21,007 INFO L273 TraceCheckUtils]: 20: Hoare triple {5221#false} ~i~0 := 0; {5221#false} is VALID [2018-11-23 11:55:21,008 INFO L273 TraceCheckUtils]: 21: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,008 INFO L273 TraceCheckUtils]: 22: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,008 INFO L273 TraceCheckUtils]: 23: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,008 INFO L273 TraceCheckUtils]: 24: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,009 INFO L273 TraceCheckUtils]: 25: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,009 INFO L273 TraceCheckUtils]: 26: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,009 INFO L273 TraceCheckUtils]: 27: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,009 INFO L273 TraceCheckUtils]: 28: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,009 INFO L273 TraceCheckUtils]: 29: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,010 INFO L273 TraceCheckUtils]: 30: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,010 INFO L273 TraceCheckUtils]: 31: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,010 INFO L273 TraceCheckUtils]: 32: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,010 INFO L273 TraceCheckUtils]: 33: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,010 INFO L273 TraceCheckUtils]: 34: Hoare triple {5221#false} assume !(~i~0 < 100000); {5221#false} is VALID [2018-11-23 11:55:21,011 INFO L273 TraceCheckUtils]: 35: Hoare triple {5221#false} ~i~0 := 0; {5221#false} is VALID [2018-11-23 11:55:21,011 INFO L273 TraceCheckUtils]: 36: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,011 INFO L273 TraceCheckUtils]: 37: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,011 INFO L273 TraceCheckUtils]: 38: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,012 INFO L273 TraceCheckUtils]: 39: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,012 INFO L273 TraceCheckUtils]: 40: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,012 INFO L273 TraceCheckUtils]: 41: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,012 INFO L273 TraceCheckUtils]: 42: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,012 INFO L273 TraceCheckUtils]: 43: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,012 INFO L273 TraceCheckUtils]: 44: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,012 INFO L273 TraceCheckUtils]: 45: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,013 INFO L273 TraceCheckUtils]: 46: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,013 INFO L273 TraceCheckUtils]: 47: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,013 INFO L273 TraceCheckUtils]: 48: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,013 INFO L273 TraceCheckUtils]: 49: Hoare triple {5221#false} assume !(~i~0 < 100000); {5221#false} is VALID [2018-11-23 11:55:21,013 INFO L273 TraceCheckUtils]: 50: Hoare triple {5221#false} havoc ~x~0;~x~0 := 0; {5221#false} is VALID [2018-11-23 11:55:21,013 INFO L273 TraceCheckUtils]: 51: Hoare triple {5221#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5221#false} is VALID [2018-11-23 11:55:21,013 INFO L256 TraceCheckUtils]: 52: Hoare triple {5221#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {5221#false} is VALID [2018-11-23 11:55:21,013 INFO L273 TraceCheckUtils]: 53: Hoare triple {5221#false} ~cond := #in~cond; {5221#false} is VALID [2018-11-23 11:55:21,014 INFO L273 TraceCheckUtils]: 54: Hoare triple {5221#false} assume 0 == ~cond; {5221#false} is VALID [2018-11-23 11:55:21,014 INFO L273 TraceCheckUtils]: 55: Hoare triple {5221#false} assume !false; {5221#false} is VALID [2018-11-23 11:55:21,016 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-11-23 11:55:21,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:21,016 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:21,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:21,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:21,201 INFO L256 TraceCheckUtils]: 0: Hoare triple {5220#true} call ULTIMATE.init(); {5220#true} is VALID [2018-11-23 11:55:21,202 INFO L273 TraceCheckUtils]: 1: Hoare triple {5220#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5220#true} is VALID [2018-11-23 11:55:21,202 INFO L273 TraceCheckUtils]: 2: Hoare triple {5220#true} assume true; {5220#true} is VALID [2018-11-23 11:55:21,202 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5220#true} {5220#true} #74#return; {5220#true} is VALID [2018-11-23 11:55:21,203 INFO L256 TraceCheckUtils]: 4: Hoare triple {5220#true} call #t~ret2 := main(); {5220#true} is VALID [2018-11-23 11:55:21,203 INFO L273 TraceCheckUtils]: 5: Hoare triple {5220#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5254#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:21,204 INFO L273 TraceCheckUtils]: 6: Hoare triple {5254#(<= 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; {5223#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:21,205 INFO L273 TraceCheckUtils]: 7: Hoare triple {5223#(<= 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; {5224#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:21,205 INFO L273 TraceCheckUtils]: 8: Hoare triple {5224#(<= 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; {5225#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:21,206 INFO L273 TraceCheckUtils]: 9: Hoare triple {5225#(<= 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; {5226#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:21,207 INFO L273 TraceCheckUtils]: 10: Hoare triple {5226#(<= 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; {5227#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:21,208 INFO L273 TraceCheckUtils]: 11: Hoare triple {5227#(<= 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; {5228#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:21,209 INFO L273 TraceCheckUtils]: 12: Hoare triple {5228#(<= 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; {5229#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:21,210 INFO L273 TraceCheckUtils]: 13: Hoare triple {5229#(<= 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; {5230#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:21,211 INFO L273 TraceCheckUtils]: 14: Hoare triple {5230#(<= 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; {5231#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:21,212 INFO L273 TraceCheckUtils]: 15: Hoare triple {5231#(<= 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; {5232#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:21,213 INFO L273 TraceCheckUtils]: 16: Hoare triple {5232#(<= 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; {5233#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:21,213 INFO L273 TraceCheckUtils]: 17: Hoare triple {5233#(<= 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; {5234#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:21,214 INFO L273 TraceCheckUtils]: 18: Hoare triple {5234#(<= 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; {5235#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:21,215 INFO L273 TraceCheckUtils]: 19: Hoare triple {5235#(<= main_~i~0 13)} assume !(~i~0 < 100000); {5221#false} is VALID [2018-11-23 11:55:21,215 INFO L273 TraceCheckUtils]: 20: Hoare triple {5221#false} ~i~0 := 0; {5221#false} is VALID [2018-11-23 11:55:21,216 INFO L273 TraceCheckUtils]: 21: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,216 INFO L273 TraceCheckUtils]: 22: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,216 INFO L273 TraceCheckUtils]: 23: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,216 INFO L273 TraceCheckUtils]: 24: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,216 INFO L273 TraceCheckUtils]: 25: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,217 INFO L273 TraceCheckUtils]: 26: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,217 INFO L273 TraceCheckUtils]: 27: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,217 INFO L273 TraceCheckUtils]: 28: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,217 INFO L273 TraceCheckUtils]: 29: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,217 INFO L273 TraceCheckUtils]: 30: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,218 INFO L273 TraceCheckUtils]: 31: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,218 INFO L273 TraceCheckUtils]: 32: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,218 INFO L273 TraceCheckUtils]: 33: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,218 INFO L273 TraceCheckUtils]: 34: Hoare triple {5221#false} assume !(~i~0 < 100000); {5221#false} is VALID [2018-11-23 11:55:21,219 INFO L273 TraceCheckUtils]: 35: Hoare triple {5221#false} ~i~0 := 0; {5221#false} is VALID [2018-11-23 11:55:21,219 INFO L273 TraceCheckUtils]: 36: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,219 INFO L273 TraceCheckUtils]: 37: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,219 INFO L273 TraceCheckUtils]: 38: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,219 INFO L273 TraceCheckUtils]: 39: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,220 INFO L273 TraceCheckUtils]: 40: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,220 INFO L273 TraceCheckUtils]: 41: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,220 INFO L273 TraceCheckUtils]: 42: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,220 INFO L273 TraceCheckUtils]: 43: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,220 INFO L273 TraceCheckUtils]: 44: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,220 INFO L273 TraceCheckUtils]: 45: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,220 INFO L273 TraceCheckUtils]: 46: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,221 INFO L273 TraceCheckUtils]: 47: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,221 INFO L273 TraceCheckUtils]: 48: Hoare triple {5221#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5221#false} is VALID [2018-11-23 11:55:21,221 INFO L273 TraceCheckUtils]: 49: Hoare triple {5221#false} assume !(~i~0 < 100000); {5221#false} is VALID [2018-11-23 11:55:21,221 INFO L273 TraceCheckUtils]: 50: Hoare triple {5221#false} havoc ~x~0;~x~0 := 0; {5221#false} is VALID [2018-11-23 11:55:21,221 INFO L273 TraceCheckUtils]: 51: Hoare triple {5221#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5221#false} is VALID [2018-11-23 11:55:21,221 INFO L256 TraceCheckUtils]: 52: Hoare triple {5221#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {5221#false} is VALID [2018-11-23 11:55:21,221 INFO L273 TraceCheckUtils]: 53: Hoare triple {5221#false} ~cond := #in~cond; {5221#false} is VALID [2018-11-23 11:55:21,221 INFO L273 TraceCheckUtils]: 54: Hoare triple {5221#false} assume 0 == ~cond; {5221#false} is VALID [2018-11-23 11:55:21,222 INFO L273 TraceCheckUtils]: 55: Hoare triple {5221#false} assume !false; {5221#false} is VALID [2018-11-23 11:55:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-11-23 11:55:21,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:21,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 11:55:21,243 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-11-23 11:55:21,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:21,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:55:21,270 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 11:55:21,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:55:21,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:55:21,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:55:21,272 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 17 states. [2018-11-23 11:55:22,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:22,033 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2018-11-23 11:55:22,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:55:22,034 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-11-23 11:55:22,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:22,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:55:22,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 87 transitions. [2018-11-23 11:55:22,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:55:22,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 87 transitions. [2018-11-23 11:55:22,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 87 transitions. [2018-11-23 11:55:22,179 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:22,181 INFO L225 Difference]: With dead ends: 105 [2018-11-23 11:55:22,182 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 11:55:22,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:55:22,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 11:55:22,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-23 11:55:22,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:22,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 64 states. [2018-11-23 11:55:22,225 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 11:55:22,225 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 11:55:22,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:22,227 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-11-23 11:55:22,227 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-11-23 11:55:22,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:22,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:22,227 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 11:55:22,228 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 11:55:22,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:22,229 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-11-23 11:55:22,229 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-11-23 11:55:22,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:22,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:22,230 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:22,230 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:22,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 11:55:22,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-11-23 11:55:22,231 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 56 [2018-11-23 11:55:22,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:22,232 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2018-11-23 11:55:22,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:55:22,232 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-11-23 11:55:22,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 11:55:22,233 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:22,233 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:22,233 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:22,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:22,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1004884582, now seen corresponding path program 14 times [2018-11-23 11:55:22,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:22,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:22,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:22,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:22,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:22,987 INFO L256 TraceCheckUtils]: 0: Hoare triple {5836#true} call ULTIMATE.init(); {5836#true} is VALID [2018-11-23 11:55:22,988 INFO L273 TraceCheckUtils]: 1: Hoare triple {5836#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5836#true} is VALID [2018-11-23 11:55:22,988 INFO L273 TraceCheckUtils]: 2: Hoare triple {5836#true} assume true; {5836#true} is VALID [2018-11-23 11:55:22,988 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5836#true} {5836#true} #74#return; {5836#true} is VALID [2018-11-23 11:55:22,988 INFO L256 TraceCheckUtils]: 4: Hoare triple {5836#true} call #t~ret2 := main(); {5836#true} is VALID [2018-11-23 11:55:22,988 INFO L273 TraceCheckUtils]: 5: Hoare triple {5836#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5838#(= main_~i~0 0)} is VALID [2018-11-23 11:55:22,989 INFO L273 TraceCheckUtils]: 6: Hoare triple {5838#(= 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; {5839#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:22,990 INFO L273 TraceCheckUtils]: 7: Hoare triple {5839#(<= 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; {5840#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:22,990 INFO L273 TraceCheckUtils]: 8: Hoare triple {5840#(<= 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; {5841#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:22,991 INFO L273 TraceCheckUtils]: 9: Hoare triple {5841#(<= 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; {5842#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:22,992 INFO L273 TraceCheckUtils]: 10: Hoare triple {5842#(<= 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; {5843#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:22,993 INFO L273 TraceCheckUtils]: 11: Hoare triple {5843#(<= 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; {5844#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:22,994 INFO L273 TraceCheckUtils]: 12: Hoare triple {5844#(<= 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; {5845#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:22,995 INFO L273 TraceCheckUtils]: 13: Hoare triple {5845#(<= 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; {5846#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:22,996 INFO L273 TraceCheckUtils]: 14: Hoare triple {5846#(<= 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; {5847#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:22,997 INFO L273 TraceCheckUtils]: 15: Hoare triple {5847#(<= 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; {5848#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:22,998 INFO L273 TraceCheckUtils]: 16: Hoare triple {5848#(<= 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; {5849#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:22,999 INFO L273 TraceCheckUtils]: 17: Hoare triple {5849#(<= 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; {5850#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:23,000 INFO L273 TraceCheckUtils]: 18: Hoare triple {5850#(<= 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; {5851#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:23,001 INFO L273 TraceCheckUtils]: 19: Hoare triple {5851#(<= 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; {5852#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:23,001 INFO L273 TraceCheckUtils]: 20: Hoare triple {5852#(<= main_~i~0 14)} assume !(~i~0 < 100000); {5837#false} is VALID [2018-11-23 11:55:23,002 INFO L273 TraceCheckUtils]: 21: Hoare triple {5837#false} ~i~0 := 0; {5837#false} is VALID [2018-11-23 11:55:23,002 INFO L273 TraceCheckUtils]: 22: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,002 INFO L273 TraceCheckUtils]: 23: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,002 INFO L273 TraceCheckUtils]: 24: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,002 INFO L273 TraceCheckUtils]: 25: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,003 INFO L273 TraceCheckUtils]: 26: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,003 INFO L273 TraceCheckUtils]: 27: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,003 INFO L273 TraceCheckUtils]: 28: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,003 INFO L273 TraceCheckUtils]: 29: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,003 INFO L273 TraceCheckUtils]: 30: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,004 INFO L273 TraceCheckUtils]: 31: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,004 INFO L273 TraceCheckUtils]: 32: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,004 INFO L273 TraceCheckUtils]: 33: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,004 INFO L273 TraceCheckUtils]: 34: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,004 INFO L273 TraceCheckUtils]: 35: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,004 INFO L273 TraceCheckUtils]: 36: Hoare triple {5837#false} assume !(~i~0 < 100000); {5837#false} is VALID [2018-11-23 11:55:23,004 INFO L273 TraceCheckUtils]: 37: Hoare triple {5837#false} ~i~0 := 0; {5837#false} is VALID [2018-11-23 11:55:23,004 INFO L273 TraceCheckUtils]: 38: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,005 INFO L273 TraceCheckUtils]: 39: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,005 INFO L273 TraceCheckUtils]: 40: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,005 INFO L273 TraceCheckUtils]: 41: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,005 INFO L273 TraceCheckUtils]: 42: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,005 INFO L273 TraceCheckUtils]: 43: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,005 INFO L273 TraceCheckUtils]: 44: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,005 INFO L273 TraceCheckUtils]: 45: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,005 INFO L273 TraceCheckUtils]: 46: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,006 INFO L273 TraceCheckUtils]: 47: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,006 INFO L273 TraceCheckUtils]: 48: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,006 INFO L273 TraceCheckUtils]: 49: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,006 INFO L273 TraceCheckUtils]: 50: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,006 INFO L273 TraceCheckUtils]: 51: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,006 INFO L273 TraceCheckUtils]: 52: Hoare triple {5837#false} assume !(~i~0 < 100000); {5837#false} is VALID [2018-11-23 11:55:23,006 INFO L273 TraceCheckUtils]: 53: Hoare triple {5837#false} havoc ~x~0;~x~0 := 0; {5837#false} is VALID [2018-11-23 11:55:23,006 INFO L273 TraceCheckUtils]: 54: Hoare triple {5837#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5837#false} is VALID [2018-11-23 11:55:23,006 INFO L256 TraceCheckUtils]: 55: Hoare triple {5837#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {5837#false} is VALID [2018-11-23 11:55:23,007 INFO L273 TraceCheckUtils]: 56: Hoare triple {5837#false} ~cond := #in~cond; {5837#false} is VALID [2018-11-23 11:55:23,007 INFO L273 TraceCheckUtils]: 57: Hoare triple {5837#false} assume 0 == ~cond; {5837#false} is VALID [2018-11-23 11:55:23,007 INFO L273 TraceCheckUtils]: 58: Hoare triple {5837#false} assume !false; {5837#false} is VALID [2018-11-23 11:55:23,009 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-23 11:55:23,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:23,009 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:23,020 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:55:23,056 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:55:23,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:23,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:23,200 INFO L256 TraceCheckUtils]: 0: Hoare triple {5836#true} call ULTIMATE.init(); {5836#true} is VALID [2018-11-23 11:55:23,200 INFO L273 TraceCheckUtils]: 1: Hoare triple {5836#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5836#true} is VALID [2018-11-23 11:55:23,200 INFO L273 TraceCheckUtils]: 2: Hoare triple {5836#true} assume true; {5836#true} is VALID [2018-11-23 11:55:23,201 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5836#true} {5836#true} #74#return; {5836#true} is VALID [2018-11-23 11:55:23,201 INFO L256 TraceCheckUtils]: 4: Hoare triple {5836#true} call #t~ret2 := main(); {5836#true} is VALID [2018-11-23 11:55:23,202 INFO L273 TraceCheckUtils]: 5: Hoare triple {5836#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5871#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:23,202 INFO L273 TraceCheckUtils]: 6: Hoare triple {5871#(<= 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; {5839#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:23,203 INFO L273 TraceCheckUtils]: 7: Hoare triple {5839#(<= 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; {5840#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:23,204 INFO L273 TraceCheckUtils]: 8: Hoare triple {5840#(<= 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; {5841#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:23,204 INFO L273 TraceCheckUtils]: 9: Hoare triple {5841#(<= 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; {5842#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:23,205 INFO L273 TraceCheckUtils]: 10: Hoare triple {5842#(<= 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; {5843#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:23,206 INFO L273 TraceCheckUtils]: 11: Hoare triple {5843#(<= 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; {5844#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:23,207 INFO L273 TraceCheckUtils]: 12: Hoare triple {5844#(<= 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; {5845#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:23,208 INFO L273 TraceCheckUtils]: 13: Hoare triple {5845#(<= 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; {5846#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:23,209 INFO L273 TraceCheckUtils]: 14: Hoare triple {5846#(<= 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; {5847#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:23,210 INFO L273 TraceCheckUtils]: 15: Hoare triple {5847#(<= 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; {5848#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:23,211 INFO L273 TraceCheckUtils]: 16: Hoare triple {5848#(<= 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; {5849#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:23,212 INFO L273 TraceCheckUtils]: 17: Hoare triple {5849#(<= 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; {5850#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:23,213 INFO L273 TraceCheckUtils]: 18: Hoare triple {5850#(<= 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; {5851#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:23,214 INFO L273 TraceCheckUtils]: 19: Hoare triple {5851#(<= 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; {5852#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:23,214 INFO L273 TraceCheckUtils]: 20: Hoare triple {5852#(<= main_~i~0 14)} assume !(~i~0 < 100000); {5837#false} is VALID [2018-11-23 11:55:23,215 INFO L273 TraceCheckUtils]: 21: Hoare triple {5837#false} ~i~0 := 0; {5837#false} is VALID [2018-11-23 11:55:23,215 INFO L273 TraceCheckUtils]: 22: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,215 INFO L273 TraceCheckUtils]: 23: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,215 INFO L273 TraceCheckUtils]: 24: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,216 INFO L273 TraceCheckUtils]: 25: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,216 INFO L273 TraceCheckUtils]: 26: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,216 INFO L273 TraceCheckUtils]: 27: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,216 INFO L273 TraceCheckUtils]: 28: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,216 INFO L273 TraceCheckUtils]: 29: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,217 INFO L273 TraceCheckUtils]: 30: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,217 INFO L273 TraceCheckUtils]: 31: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,217 INFO L273 TraceCheckUtils]: 32: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,217 INFO L273 TraceCheckUtils]: 33: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,217 INFO L273 TraceCheckUtils]: 34: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,218 INFO L273 TraceCheckUtils]: 35: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,218 INFO L273 TraceCheckUtils]: 36: Hoare triple {5837#false} assume !(~i~0 < 100000); {5837#false} is VALID [2018-11-23 11:55:23,218 INFO L273 TraceCheckUtils]: 37: Hoare triple {5837#false} ~i~0 := 0; {5837#false} is VALID [2018-11-23 11:55:23,218 INFO L273 TraceCheckUtils]: 38: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,219 INFO L273 TraceCheckUtils]: 39: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,219 INFO L273 TraceCheckUtils]: 40: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,219 INFO L273 TraceCheckUtils]: 41: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,219 INFO L273 TraceCheckUtils]: 42: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,219 INFO L273 TraceCheckUtils]: 43: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,220 INFO L273 TraceCheckUtils]: 44: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,220 INFO L273 TraceCheckUtils]: 45: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,220 INFO L273 TraceCheckUtils]: 46: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,220 INFO L273 TraceCheckUtils]: 47: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,220 INFO L273 TraceCheckUtils]: 48: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,220 INFO L273 TraceCheckUtils]: 49: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,220 INFO L273 TraceCheckUtils]: 50: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,221 INFO L273 TraceCheckUtils]: 51: Hoare triple {5837#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5837#false} is VALID [2018-11-23 11:55:23,221 INFO L273 TraceCheckUtils]: 52: Hoare triple {5837#false} assume !(~i~0 < 100000); {5837#false} is VALID [2018-11-23 11:55:23,221 INFO L273 TraceCheckUtils]: 53: Hoare triple {5837#false} havoc ~x~0;~x~0 := 0; {5837#false} is VALID [2018-11-23 11:55:23,221 INFO L273 TraceCheckUtils]: 54: Hoare triple {5837#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5837#false} is VALID [2018-11-23 11:55:23,221 INFO L256 TraceCheckUtils]: 55: Hoare triple {5837#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {5837#false} is VALID [2018-11-23 11:55:23,221 INFO L273 TraceCheckUtils]: 56: Hoare triple {5837#false} ~cond := #in~cond; {5837#false} is VALID [2018-11-23 11:55:23,221 INFO L273 TraceCheckUtils]: 57: Hoare triple {5837#false} assume 0 == ~cond; {5837#false} is VALID [2018-11-23 11:55:23,221 INFO L273 TraceCheckUtils]: 58: Hoare triple {5837#false} assume !false; {5837#false} is VALID [2018-11-23 11:55:23,223 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-23 11:55:23,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:23,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 11:55:23,243 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 59 [2018-11-23 11:55:23,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:23,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:55:23,269 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 11:55:23,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:55:23,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:55:23,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:55:23,271 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 18 states. [2018-11-23 11:55:23,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:23,808 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2018-11-23 11:55:23,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:55:23,808 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 59 [2018-11-23 11:55:23,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:23,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:55:23,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 90 transitions. [2018-11-23 11:55:23,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:55:23,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 90 transitions. [2018-11-23 11:55:23,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 90 transitions. [2018-11-23 11:55:24,442 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:24,444 INFO L225 Difference]: With dead ends: 110 [2018-11-23 11:55:24,444 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 11:55:24,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:55:24,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 11:55:24,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-23 11:55:24,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:24,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 67 states. [2018-11-23 11:55:24,500 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-23 11:55:24,500 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-23 11:55:24,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:24,502 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-11-23 11:55:24,502 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-11-23 11:55:24,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:24,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:24,502 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-23 11:55:24,502 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-23 11:55:24,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:24,504 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-11-23 11:55:24,504 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-11-23 11:55:24,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:24,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:24,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:24,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:24,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 11:55:24,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2018-11-23 11:55:24,506 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 59 [2018-11-23 11:55:24,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:24,506 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-11-23 11:55:24,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:55:24,507 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-11-23 11:55:24,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 11:55:24,507 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:24,508 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:24,508 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:24,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:24,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1390483167, now seen corresponding path program 15 times [2018-11-23 11:55:24,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:24,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:24,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:24,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:24,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:25,144 INFO L256 TraceCheckUtils]: 0: Hoare triple {6484#true} call ULTIMATE.init(); {6484#true} is VALID [2018-11-23 11:55:25,145 INFO L273 TraceCheckUtils]: 1: Hoare triple {6484#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6484#true} is VALID [2018-11-23 11:55:25,145 INFO L273 TraceCheckUtils]: 2: Hoare triple {6484#true} assume true; {6484#true} is VALID [2018-11-23 11:55:25,145 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6484#true} {6484#true} #74#return; {6484#true} is VALID [2018-11-23 11:55:25,146 INFO L256 TraceCheckUtils]: 4: Hoare triple {6484#true} call #t~ret2 := main(); {6484#true} is VALID [2018-11-23 11:55:25,146 INFO L273 TraceCheckUtils]: 5: Hoare triple {6484#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6486#(= main_~i~0 0)} is VALID [2018-11-23 11:55:25,147 INFO L273 TraceCheckUtils]: 6: Hoare triple {6486#(= 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; {6487#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:25,147 INFO L273 TraceCheckUtils]: 7: Hoare triple {6487#(<= 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; {6488#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:25,148 INFO L273 TraceCheckUtils]: 8: Hoare triple {6488#(<= 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; {6489#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:25,149 INFO L273 TraceCheckUtils]: 9: Hoare triple {6489#(<= 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; {6490#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:25,149 INFO L273 TraceCheckUtils]: 10: Hoare triple {6490#(<= 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; {6491#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:25,150 INFO L273 TraceCheckUtils]: 11: Hoare triple {6491#(<= 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; {6492#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:25,151 INFO L273 TraceCheckUtils]: 12: Hoare triple {6492#(<= 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; {6493#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:25,152 INFO L273 TraceCheckUtils]: 13: Hoare triple {6493#(<= 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; {6494#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:25,152 INFO L273 TraceCheckUtils]: 14: Hoare triple {6494#(<= 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; {6495#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:25,153 INFO L273 TraceCheckUtils]: 15: Hoare triple {6495#(<= 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; {6496#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:25,154 INFO L273 TraceCheckUtils]: 16: Hoare triple {6496#(<= 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; {6497#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:25,155 INFO L273 TraceCheckUtils]: 17: Hoare triple {6497#(<= 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; {6498#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:25,156 INFO L273 TraceCheckUtils]: 18: Hoare triple {6498#(<= 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; {6499#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:25,157 INFO L273 TraceCheckUtils]: 19: Hoare triple {6499#(<= 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; {6500#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:25,158 INFO L273 TraceCheckUtils]: 20: Hoare triple {6500#(<= 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; {6501#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:25,158 INFO L273 TraceCheckUtils]: 21: Hoare triple {6501#(<= main_~i~0 15)} assume !(~i~0 < 100000); {6485#false} is VALID [2018-11-23 11:55:25,159 INFO L273 TraceCheckUtils]: 22: Hoare triple {6485#false} ~i~0 := 0; {6485#false} is VALID [2018-11-23 11:55:25,159 INFO L273 TraceCheckUtils]: 23: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:25,159 INFO L273 TraceCheckUtils]: 24: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:25,159 INFO L273 TraceCheckUtils]: 25: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:25,159 INFO L273 TraceCheckUtils]: 26: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:25,160 INFO L273 TraceCheckUtils]: 27: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:25,160 INFO L273 TraceCheckUtils]: 28: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:25,160 INFO L273 TraceCheckUtils]: 29: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:25,160 INFO L273 TraceCheckUtils]: 30: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:25,160 INFO L273 TraceCheckUtils]: 31: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:25,161 INFO L273 TraceCheckUtils]: 32: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:25,161 INFO L273 TraceCheckUtils]: 33: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:25,161 INFO L273 TraceCheckUtils]: 34: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:25,161 INFO L273 TraceCheckUtils]: 35: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:25,161 INFO L273 TraceCheckUtils]: 36: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:25,162 INFO L273 TraceCheckUtils]: 37: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:25,162 INFO L273 TraceCheckUtils]: 38: Hoare triple {6485#false} assume !(~i~0 < 100000); {6485#false} is VALID [2018-11-23 11:55:25,162 INFO L273 TraceCheckUtils]: 39: Hoare triple {6485#false} ~i~0 := 0; {6485#false} is VALID [2018-11-23 11:55:25,162 INFO L273 TraceCheckUtils]: 40: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:25,162 INFO L273 TraceCheckUtils]: 41: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:25,163 INFO L273 TraceCheckUtils]: 42: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:25,163 INFO L273 TraceCheckUtils]: 43: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:25,163 INFO L273 TraceCheckUtils]: 44: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:25,163 INFO L273 TraceCheckUtils]: 45: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:25,163 INFO L273 TraceCheckUtils]: 46: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:25,163 INFO L273 TraceCheckUtils]: 47: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:25,164 INFO L273 TraceCheckUtils]: 48: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:25,164 INFO L273 TraceCheckUtils]: 49: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:25,164 INFO L273 TraceCheckUtils]: 50: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:25,164 INFO L273 TraceCheckUtils]: 51: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:25,164 INFO L273 TraceCheckUtils]: 52: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:25,164 INFO L273 TraceCheckUtils]: 53: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:25,164 INFO L273 TraceCheckUtils]: 54: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:25,164 INFO L273 TraceCheckUtils]: 55: Hoare triple {6485#false} assume !(~i~0 < 100000); {6485#false} is VALID [2018-11-23 11:55:25,165 INFO L273 TraceCheckUtils]: 56: Hoare triple {6485#false} havoc ~x~0;~x~0 := 0; {6485#false} is VALID [2018-11-23 11:55:25,165 INFO L273 TraceCheckUtils]: 57: Hoare triple {6485#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6485#false} is VALID [2018-11-23 11:55:25,165 INFO L256 TraceCheckUtils]: 58: Hoare triple {6485#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {6485#false} is VALID [2018-11-23 11:55:25,165 INFO L273 TraceCheckUtils]: 59: Hoare triple {6485#false} ~cond := #in~cond; {6485#false} is VALID [2018-11-23 11:55:25,165 INFO L273 TraceCheckUtils]: 60: Hoare triple {6485#false} assume 0 == ~cond; {6485#false} is VALID [2018-11-23 11:55:25,165 INFO L273 TraceCheckUtils]: 61: Hoare triple {6485#false} assume !false; {6485#false} is VALID [2018-11-23 11:55:25,167 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-11-23 11:55:25,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:25,167 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:25,176 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:55:27,358 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 11:55:27,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:27,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:27,703 INFO L256 TraceCheckUtils]: 0: Hoare triple {6484#true} call ULTIMATE.init(); {6484#true} is VALID [2018-11-23 11:55:27,704 INFO L273 TraceCheckUtils]: 1: Hoare triple {6484#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6484#true} is VALID [2018-11-23 11:55:27,704 INFO L273 TraceCheckUtils]: 2: Hoare triple {6484#true} assume true; {6484#true} is VALID [2018-11-23 11:55:27,704 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6484#true} {6484#true} #74#return; {6484#true} is VALID [2018-11-23 11:55:27,704 INFO L256 TraceCheckUtils]: 4: Hoare triple {6484#true} call #t~ret2 := main(); {6484#true} is VALID [2018-11-23 11:55:27,705 INFO L273 TraceCheckUtils]: 5: Hoare triple {6484#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6520#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:27,706 INFO L273 TraceCheckUtils]: 6: Hoare triple {6520#(<= 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; {6487#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:27,706 INFO L273 TraceCheckUtils]: 7: Hoare triple {6487#(<= 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; {6488#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:27,707 INFO L273 TraceCheckUtils]: 8: Hoare triple {6488#(<= 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; {6489#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:27,708 INFO L273 TraceCheckUtils]: 9: Hoare triple {6489#(<= 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; {6490#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:27,708 INFO L273 TraceCheckUtils]: 10: Hoare triple {6490#(<= 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; {6491#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:27,709 INFO L273 TraceCheckUtils]: 11: Hoare triple {6491#(<= 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; {6492#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:27,710 INFO L273 TraceCheckUtils]: 12: Hoare triple {6492#(<= 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; {6493#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:27,711 INFO L273 TraceCheckUtils]: 13: Hoare triple {6493#(<= 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; {6494#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:27,712 INFO L273 TraceCheckUtils]: 14: Hoare triple {6494#(<= 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; {6495#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:27,730 INFO L273 TraceCheckUtils]: 15: Hoare triple {6495#(<= 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; {6496#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:27,737 INFO L273 TraceCheckUtils]: 16: Hoare triple {6496#(<= 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; {6497#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:27,738 INFO L273 TraceCheckUtils]: 17: Hoare triple {6497#(<= 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; {6498#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:27,739 INFO L273 TraceCheckUtils]: 18: Hoare triple {6498#(<= 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; {6499#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:27,741 INFO L273 TraceCheckUtils]: 19: Hoare triple {6499#(<= 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; {6500#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:27,742 INFO L273 TraceCheckUtils]: 20: Hoare triple {6500#(<= 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; {6501#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:27,742 INFO L273 TraceCheckUtils]: 21: Hoare triple {6501#(<= main_~i~0 15)} assume !(~i~0 < 100000); {6485#false} is VALID [2018-11-23 11:55:27,743 INFO L273 TraceCheckUtils]: 22: Hoare triple {6485#false} ~i~0 := 0; {6485#false} is VALID [2018-11-23 11:55:27,743 INFO L273 TraceCheckUtils]: 23: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:27,743 INFO L273 TraceCheckUtils]: 24: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:27,743 INFO L273 TraceCheckUtils]: 25: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:27,743 INFO L273 TraceCheckUtils]: 26: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:27,743 INFO L273 TraceCheckUtils]: 27: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:27,743 INFO L273 TraceCheckUtils]: 28: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:27,743 INFO L273 TraceCheckUtils]: 29: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:27,744 INFO L273 TraceCheckUtils]: 30: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:27,744 INFO L273 TraceCheckUtils]: 31: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:27,744 INFO L273 TraceCheckUtils]: 32: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:27,744 INFO L273 TraceCheckUtils]: 33: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:27,744 INFO L273 TraceCheckUtils]: 34: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:27,744 INFO L273 TraceCheckUtils]: 35: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:27,744 INFO L273 TraceCheckUtils]: 36: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:27,744 INFO L273 TraceCheckUtils]: 37: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:27,745 INFO L273 TraceCheckUtils]: 38: Hoare triple {6485#false} assume !(~i~0 < 100000); {6485#false} is VALID [2018-11-23 11:55:27,745 INFO L273 TraceCheckUtils]: 39: Hoare triple {6485#false} ~i~0 := 0; {6485#false} is VALID [2018-11-23 11:55:27,745 INFO L273 TraceCheckUtils]: 40: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:27,745 INFO L273 TraceCheckUtils]: 41: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:27,745 INFO L273 TraceCheckUtils]: 42: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:27,745 INFO L273 TraceCheckUtils]: 43: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:27,745 INFO L273 TraceCheckUtils]: 44: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:27,745 INFO L273 TraceCheckUtils]: 45: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:27,746 INFO L273 TraceCheckUtils]: 46: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:27,746 INFO L273 TraceCheckUtils]: 47: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:27,746 INFO L273 TraceCheckUtils]: 48: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:27,746 INFO L273 TraceCheckUtils]: 49: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:27,746 INFO L273 TraceCheckUtils]: 50: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:27,747 INFO L273 TraceCheckUtils]: 51: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:27,747 INFO L273 TraceCheckUtils]: 52: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:27,747 INFO L273 TraceCheckUtils]: 53: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:27,747 INFO L273 TraceCheckUtils]: 54: Hoare triple {6485#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#false} is VALID [2018-11-23 11:55:27,747 INFO L273 TraceCheckUtils]: 55: Hoare triple {6485#false} assume !(~i~0 < 100000); {6485#false} is VALID [2018-11-23 11:55:27,747 INFO L273 TraceCheckUtils]: 56: Hoare triple {6485#false} havoc ~x~0;~x~0 := 0; {6485#false} is VALID [2018-11-23 11:55:27,747 INFO L273 TraceCheckUtils]: 57: Hoare triple {6485#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6485#false} is VALID [2018-11-23 11:55:27,747 INFO L256 TraceCheckUtils]: 58: Hoare triple {6485#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {6485#false} is VALID [2018-11-23 11:55:27,747 INFO L273 TraceCheckUtils]: 59: Hoare triple {6485#false} ~cond := #in~cond; {6485#false} is VALID [2018-11-23 11:55:27,748 INFO L273 TraceCheckUtils]: 60: Hoare triple {6485#false} assume 0 == ~cond; {6485#false} is VALID [2018-11-23 11:55:27,748 INFO L273 TraceCheckUtils]: 61: Hoare triple {6485#false} assume !false; {6485#false} is VALID [2018-11-23 11:55:27,750 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-11-23 11:55:27,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:27,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 11:55:27,772 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 62 [2018-11-23 11:55:27,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:27,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 11:55:27,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:27,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 11:55:27,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 11:55:27,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:55:27,839 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 19 states. [2018-11-23 11:55:28,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:28,379 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2018-11-23 11:55:28,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:55:28,379 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 62 [2018-11-23 11:55:28,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:28,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:55:28,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 93 transitions. [2018-11-23 11:55:28,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:55:28,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 93 transitions. [2018-11-23 11:55:28,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 93 transitions. [2018-11-23 11:55:28,869 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:28,871 INFO L225 Difference]: With dead ends: 115 [2018-11-23 11:55:28,871 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 11:55:28,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:55:28,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 11:55:28,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-23 11:55:28,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:28,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2018-11-23 11:55:28,972 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2018-11-23 11:55:28,972 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2018-11-23 11:55:28,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:28,973 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-11-23 11:55:28,973 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-11-23 11:55:28,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:28,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:28,974 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2018-11-23 11:55:28,974 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2018-11-23 11:55:28,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:28,976 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-11-23 11:55:28,976 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-11-23 11:55:28,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:28,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:28,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:28,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:28,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 11:55:28,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-11-23 11:55:28,979 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 62 [2018-11-23 11:55:28,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:28,979 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-11-23 11:55:28,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 11:55:28,979 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-11-23 11:55:28,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 11:55:28,980 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:28,980 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:28,980 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:28,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:28,981 INFO L82 PathProgramCache]: Analyzing trace with hash 2125345850, now seen corresponding path program 16 times [2018-11-23 11:55:28,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:28,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:28,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:28,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:28,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:29,935 INFO L256 TraceCheckUtils]: 0: Hoare triple {7164#true} call ULTIMATE.init(); {7164#true} is VALID [2018-11-23 11:55:29,936 INFO L273 TraceCheckUtils]: 1: Hoare triple {7164#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7164#true} is VALID [2018-11-23 11:55:29,936 INFO L273 TraceCheckUtils]: 2: Hoare triple {7164#true} assume true; {7164#true} is VALID [2018-11-23 11:55:29,936 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7164#true} {7164#true} #74#return; {7164#true} is VALID [2018-11-23 11:55:29,936 INFO L256 TraceCheckUtils]: 4: Hoare triple {7164#true} call #t~ret2 := main(); {7164#true} is VALID [2018-11-23 11:55:29,937 INFO L273 TraceCheckUtils]: 5: Hoare triple {7164#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7166#(= main_~i~0 0)} is VALID [2018-11-23 11:55:29,938 INFO L273 TraceCheckUtils]: 6: Hoare triple {7166#(= 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; {7167#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:29,939 INFO L273 TraceCheckUtils]: 7: Hoare triple {7167#(<= 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; {7168#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:29,939 INFO L273 TraceCheckUtils]: 8: Hoare triple {7168#(<= 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; {7169#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:29,940 INFO L273 TraceCheckUtils]: 9: Hoare triple {7169#(<= 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; {7170#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:29,940 INFO L273 TraceCheckUtils]: 10: Hoare triple {7170#(<= 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; {7171#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:29,941 INFO L273 TraceCheckUtils]: 11: Hoare triple {7171#(<= 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; {7172#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:29,942 INFO L273 TraceCheckUtils]: 12: Hoare triple {7172#(<= 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; {7173#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:29,943 INFO L273 TraceCheckUtils]: 13: Hoare triple {7173#(<= 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; {7174#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:29,943 INFO L273 TraceCheckUtils]: 14: Hoare triple {7174#(<= 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; {7175#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:29,944 INFO L273 TraceCheckUtils]: 15: Hoare triple {7175#(<= 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; {7176#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:29,945 INFO L273 TraceCheckUtils]: 16: Hoare triple {7176#(<= 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; {7177#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:29,946 INFO L273 TraceCheckUtils]: 17: Hoare triple {7177#(<= 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; {7178#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:29,947 INFO L273 TraceCheckUtils]: 18: Hoare triple {7178#(<= 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; {7179#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:29,948 INFO L273 TraceCheckUtils]: 19: Hoare triple {7179#(<= 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; {7180#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:29,949 INFO L273 TraceCheckUtils]: 20: Hoare triple {7180#(<= 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; {7181#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:29,950 INFO L273 TraceCheckUtils]: 21: Hoare triple {7181#(<= 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; {7182#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:29,951 INFO L273 TraceCheckUtils]: 22: Hoare triple {7182#(<= main_~i~0 16)} assume !(~i~0 < 100000); {7165#false} is VALID [2018-11-23 11:55:29,951 INFO L273 TraceCheckUtils]: 23: Hoare triple {7165#false} ~i~0 := 0; {7165#false} is VALID [2018-11-23 11:55:29,951 INFO L273 TraceCheckUtils]: 24: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,951 INFO L273 TraceCheckUtils]: 25: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,952 INFO L273 TraceCheckUtils]: 26: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,952 INFO L273 TraceCheckUtils]: 27: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,952 INFO L273 TraceCheckUtils]: 28: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,952 INFO L273 TraceCheckUtils]: 29: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,953 INFO L273 TraceCheckUtils]: 30: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,953 INFO L273 TraceCheckUtils]: 31: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,953 INFO L273 TraceCheckUtils]: 32: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,953 INFO L273 TraceCheckUtils]: 33: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,954 INFO L273 TraceCheckUtils]: 34: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,954 INFO L273 TraceCheckUtils]: 35: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,954 INFO L273 TraceCheckUtils]: 36: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,955 INFO L273 TraceCheckUtils]: 37: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,955 INFO L273 TraceCheckUtils]: 38: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,955 INFO L273 TraceCheckUtils]: 39: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,955 INFO L273 TraceCheckUtils]: 40: Hoare triple {7165#false} assume !(~i~0 < 100000); {7165#false} is VALID [2018-11-23 11:55:29,955 INFO L273 TraceCheckUtils]: 41: Hoare triple {7165#false} ~i~0 := 0; {7165#false} is VALID [2018-11-23 11:55:29,955 INFO L273 TraceCheckUtils]: 42: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,956 INFO L273 TraceCheckUtils]: 43: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,956 INFO L273 TraceCheckUtils]: 44: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,956 INFO L273 TraceCheckUtils]: 45: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,956 INFO L273 TraceCheckUtils]: 46: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,956 INFO L273 TraceCheckUtils]: 47: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,957 INFO L273 TraceCheckUtils]: 48: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,957 INFO L273 TraceCheckUtils]: 49: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,957 INFO L273 TraceCheckUtils]: 50: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,957 INFO L273 TraceCheckUtils]: 51: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,957 INFO L273 TraceCheckUtils]: 52: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,957 INFO L273 TraceCheckUtils]: 53: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,958 INFO L273 TraceCheckUtils]: 54: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,958 INFO L273 TraceCheckUtils]: 55: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,958 INFO L273 TraceCheckUtils]: 56: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,958 INFO L273 TraceCheckUtils]: 57: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:29,958 INFO L273 TraceCheckUtils]: 58: Hoare triple {7165#false} assume !(~i~0 < 100000); {7165#false} is VALID [2018-11-23 11:55:29,959 INFO L273 TraceCheckUtils]: 59: Hoare triple {7165#false} havoc ~x~0;~x~0 := 0; {7165#false} is VALID [2018-11-23 11:55:29,959 INFO L273 TraceCheckUtils]: 60: Hoare triple {7165#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7165#false} is VALID [2018-11-23 11:55:29,959 INFO L256 TraceCheckUtils]: 61: Hoare triple {7165#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {7165#false} is VALID [2018-11-23 11:55:29,959 INFO L273 TraceCheckUtils]: 62: Hoare triple {7165#false} ~cond := #in~cond; {7165#false} is VALID [2018-11-23 11:55:29,959 INFO L273 TraceCheckUtils]: 63: Hoare triple {7165#false} assume 0 == ~cond; {7165#false} is VALID [2018-11-23 11:55:29,959 INFO L273 TraceCheckUtils]: 64: Hoare triple {7165#false} assume !false; {7165#false} is VALID [2018-11-23 11:55:29,962 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-11-23 11:55:29,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:29,963 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:29,979 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:55:30,027 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:55:30,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:30,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:30,314 INFO L256 TraceCheckUtils]: 0: Hoare triple {7164#true} call ULTIMATE.init(); {7164#true} is VALID [2018-11-23 11:55:30,314 INFO L273 TraceCheckUtils]: 1: Hoare triple {7164#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7164#true} is VALID [2018-11-23 11:55:30,314 INFO L273 TraceCheckUtils]: 2: Hoare triple {7164#true} assume true; {7164#true} is VALID [2018-11-23 11:55:30,315 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7164#true} {7164#true} #74#return; {7164#true} is VALID [2018-11-23 11:55:30,315 INFO L256 TraceCheckUtils]: 4: Hoare triple {7164#true} call #t~ret2 := main(); {7164#true} is VALID [2018-11-23 11:55:30,315 INFO L273 TraceCheckUtils]: 5: Hoare triple {7164#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7201#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:30,316 INFO L273 TraceCheckUtils]: 6: Hoare triple {7201#(<= 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; {7167#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:30,316 INFO L273 TraceCheckUtils]: 7: Hoare triple {7167#(<= 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; {7168#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:30,317 INFO L273 TraceCheckUtils]: 8: Hoare triple {7168#(<= 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; {7169#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:30,317 INFO L273 TraceCheckUtils]: 9: Hoare triple {7169#(<= 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; {7170#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:30,318 INFO L273 TraceCheckUtils]: 10: Hoare triple {7170#(<= 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; {7171#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:30,319 INFO L273 TraceCheckUtils]: 11: Hoare triple {7171#(<= 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; {7172#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:30,320 INFO L273 TraceCheckUtils]: 12: Hoare triple {7172#(<= 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; {7173#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:30,340 INFO L273 TraceCheckUtils]: 13: Hoare triple {7173#(<= 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; {7174#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:30,341 INFO L273 TraceCheckUtils]: 14: Hoare triple {7174#(<= 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; {7175#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:30,342 INFO L273 TraceCheckUtils]: 15: Hoare triple {7175#(<= 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; {7176#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:30,343 INFO L273 TraceCheckUtils]: 16: Hoare triple {7176#(<= 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; {7177#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:30,343 INFO L273 TraceCheckUtils]: 17: Hoare triple {7177#(<= 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; {7178#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:30,344 INFO L273 TraceCheckUtils]: 18: Hoare triple {7178#(<= 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; {7179#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:30,344 INFO L273 TraceCheckUtils]: 19: Hoare triple {7179#(<= 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; {7180#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:30,345 INFO L273 TraceCheckUtils]: 20: Hoare triple {7180#(<= 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; {7181#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:30,346 INFO L273 TraceCheckUtils]: 21: Hoare triple {7181#(<= 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; {7182#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:30,347 INFO L273 TraceCheckUtils]: 22: Hoare triple {7182#(<= main_~i~0 16)} assume !(~i~0 < 100000); {7165#false} is VALID [2018-11-23 11:55:30,347 INFO L273 TraceCheckUtils]: 23: Hoare triple {7165#false} ~i~0 := 0; {7165#false} is VALID [2018-11-23 11:55:30,347 INFO L273 TraceCheckUtils]: 24: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,347 INFO L273 TraceCheckUtils]: 25: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,348 INFO L273 TraceCheckUtils]: 26: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,348 INFO L273 TraceCheckUtils]: 27: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,348 INFO L273 TraceCheckUtils]: 28: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,348 INFO L273 TraceCheckUtils]: 29: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,348 INFO L273 TraceCheckUtils]: 30: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,349 INFO L273 TraceCheckUtils]: 31: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,349 INFO L273 TraceCheckUtils]: 32: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,349 INFO L273 TraceCheckUtils]: 33: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,349 INFO L273 TraceCheckUtils]: 34: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,349 INFO L273 TraceCheckUtils]: 35: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,350 INFO L273 TraceCheckUtils]: 36: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,350 INFO L273 TraceCheckUtils]: 37: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,350 INFO L273 TraceCheckUtils]: 38: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,350 INFO L273 TraceCheckUtils]: 39: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,350 INFO L273 TraceCheckUtils]: 40: Hoare triple {7165#false} assume !(~i~0 < 100000); {7165#false} is VALID [2018-11-23 11:55:30,350 INFO L273 TraceCheckUtils]: 41: Hoare triple {7165#false} ~i~0 := 0; {7165#false} is VALID [2018-11-23 11:55:30,351 INFO L273 TraceCheckUtils]: 42: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,351 INFO L273 TraceCheckUtils]: 43: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,351 INFO L273 TraceCheckUtils]: 44: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,351 INFO L273 TraceCheckUtils]: 45: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,351 INFO L273 TraceCheckUtils]: 46: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,351 INFO L273 TraceCheckUtils]: 47: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,351 INFO L273 TraceCheckUtils]: 48: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,351 INFO L273 TraceCheckUtils]: 49: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,351 INFO L273 TraceCheckUtils]: 50: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,352 INFO L273 TraceCheckUtils]: 51: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,352 INFO L273 TraceCheckUtils]: 52: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,352 INFO L273 TraceCheckUtils]: 53: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,352 INFO L273 TraceCheckUtils]: 54: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,352 INFO L273 TraceCheckUtils]: 55: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,352 INFO L273 TraceCheckUtils]: 56: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,352 INFO L273 TraceCheckUtils]: 57: Hoare triple {7165#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7165#false} is VALID [2018-11-23 11:55:30,352 INFO L273 TraceCheckUtils]: 58: Hoare triple {7165#false} assume !(~i~0 < 100000); {7165#false} is VALID [2018-11-23 11:55:30,352 INFO L273 TraceCheckUtils]: 59: Hoare triple {7165#false} havoc ~x~0;~x~0 := 0; {7165#false} is VALID [2018-11-23 11:55:30,353 INFO L273 TraceCheckUtils]: 60: Hoare triple {7165#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7165#false} is VALID [2018-11-23 11:55:30,353 INFO L256 TraceCheckUtils]: 61: Hoare triple {7165#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {7165#false} is VALID [2018-11-23 11:55:30,353 INFO L273 TraceCheckUtils]: 62: Hoare triple {7165#false} ~cond := #in~cond; {7165#false} is VALID [2018-11-23 11:55:30,353 INFO L273 TraceCheckUtils]: 63: Hoare triple {7165#false} assume 0 == ~cond; {7165#false} is VALID [2018-11-23 11:55:30,353 INFO L273 TraceCheckUtils]: 64: Hoare triple {7165#false} assume !false; {7165#false} is VALID [2018-11-23 11:55:30,355 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-11-23 11:55:30,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:30,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 11:55:30,374 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 65 [2018-11-23 11:55:30,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:30,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:55:30,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:30,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:55:30,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:55:30,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:55:30,405 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 20 states. [2018-11-23 11:55:31,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:31,141 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-11-23 11:55:31,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:55:31,142 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 65 [2018-11-23 11:55:31,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:31,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:55:31,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 96 transitions. [2018-11-23 11:55:31,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:55:31,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 96 transitions. [2018-11-23 11:55:31,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 96 transitions. [2018-11-23 11:55:31,722 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:31,724 INFO L225 Difference]: With dead ends: 120 [2018-11-23 11:55:31,724 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 11:55:31,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:55:31,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 11:55:31,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-11-23 11:55:31,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:31,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 73 states. [2018-11-23 11:55:31,816 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 73 states. [2018-11-23 11:55:31,816 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 73 states. [2018-11-23 11:55:31,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:31,819 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-11-23 11:55:31,819 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-11-23 11:55:31,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:31,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:31,820 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 73 states. [2018-11-23 11:55:31,820 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 73 states. [2018-11-23 11:55:31,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:31,821 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-11-23 11:55:31,821 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-11-23 11:55:31,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:31,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:31,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:31,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:31,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 11:55:31,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-11-23 11:55:31,823 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 65 [2018-11-23 11:55:31,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:31,823 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-11-23 11:55:31,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:55:31,823 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-11-23 11:55:31,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 11:55:31,824 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:31,824 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:31,824 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:31,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:31,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1332687359, now seen corresponding path program 17 times [2018-11-23 11:55:31,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:31,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:31,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:31,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:31,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:32,550 INFO L256 TraceCheckUtils]: 0: Hoare triple {7876#true} call ULTIMATE.init(); {7876#true} is VALID [2018-11-23 11:55:32,551 INFO L273 TraceCheckUtils]: 1: Hoare triple {7876#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7876#true} is VALID [2018-11-23 11:55:32,551 INFO L273 TraceCheckUtils]: 2: Hoare triple {7876#true} assume true; {7876#true} is VALID [2018-11-23 11:55:32,551 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7876#true} {7876#true} #74#return; {7876#true} is VALID [2018-11-23 11:55:32,551 INFO L256 TraceCheckUtils]: 4: Hoare triple {7876#true} call #t~ret2 := main(); {7876#true} is VALID [2018-11-23 11:55:32,552 INFO L273 TraceCheckUtils]: 5: Hoare triple {7876#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7878#(= main_~i~0 0)} is VALID [2018-11-23 11:55:32,552 INFO L273 TraceCheckUtils]: 6: Hoare triple {7878#(= 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; {7879#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:32,555 INFO L273 TraceCheckUtils]: 7: Hoare triple {7879#(<= 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; {7880#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:32,556 INFO L273 TraceCheckUtils]: 8: Hoare triple {7880#(<= 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; {7881#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:32,556 INFO L273 TraceCheckUtils]: 9: Hoare triple {7881#(<= 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; {7882#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:32,557 INFO L273 TraceCheckUtils]: 10: Hoare triple {7882#(<= 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; {7883#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:32,557 INFO L273 TraceCheckUtils]: 11: Hoare triple {7883#(<= 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; {7884#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:32,558 INFO L273 TraceCheckUtils]: 12: Hoare triple {7884#(<= 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; {7885#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:32,559 INFO L273 TraceCheckUtils]: 13: Hoare triple {7885#(<= 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; {7886#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:32,560 INFO L273 TraceCheckUtils]: 14: Hoare triple {7886#(<= 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; {7887#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:32,561 INFO L273 TraceCheckUtils]: 15: Hoare triple {7887#(<= 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; {7888#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:32,562 INFO L273 TraceCheckUtils]: 16: Hoare triple {7888#(<= 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; {7889#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:32,563 INFO L273 TraceCheckUtils]: 17: Hoare triple {7889#(<= 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; {7890#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:32,564 INFO L273 TraceCheckUtils]: 18: Hoare triple {7890#(<= 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; {7891#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:32,565 INFO L273 TraceCheckUtils]: 19: Hoare triple {7891#(<= 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; {7892#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:32,566 INFO L273 TraceCheckUtils]: 20: Hoare triple {7892#(<= 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; {7893#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:32,567 INFO L273 TraceCheckUtils]: 21: Hoare triple {7893#(<= 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; {7894#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:32,568 INFO L273 TraceCheckUtils]: 22: Hoare triple {7894#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7895#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:32,568 INFO L273 TraceCheckUtils]: 23: Hoare triple {7895#(<= main_~i~0 17)} assume !(~i~0 < 100000); {7877#false} is VALID [2018-11-23 11:55:32,569 INFO L273 TraceCheckUtils]: 24: Hoare triple {7877#false} ~i~0 := 0; {7877#false} is VALID [2018-11-23 11:55:32,569 INFO L273 TraceCheckUtils]: 25: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,569 INFO L273 TraceCheckUtils]: 26: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,569 INFO L273 TraceCheckUtils]: 27: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,569 INFO L273 TraceCheckUtils]: 28: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,570 INFO L273 TraceCheckUtils]: 29: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,570 INFO L273 TraceCheckUtils]: 30: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,570 INFO L273 TraceCheckUtils]: 31: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,570 INFO L273 TraceCheckUtils]: 32: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,570 INFO L273 TraceCheckUtils]: 33: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,571 INFO L273 TraceCheckUtils]: 34: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,571 INFO L273 TraceCheckUtils]: 35: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,571 INFO L273 TraceCheckUtils]: 36: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,571 INFO L273 TraceCheckUtils]: 37: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,571 INFO L273 TraceCheckUtils]: 38: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,572 INFO L273 TraceCheckUtils]: 39: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,572 INFO L273 TraceCheckUtils]: 40: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,572 INFO L273 TraceCheckUtils]: 41: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,572 INFO L273 TraceCheckUtils]: 42: Hoare triple {7877#false} assume !(~i~0 < 100000); {7877#false} is VALID [2018-11-23 11:55:32,572 INFO L273 TraceCheckUtils]: 43: Hoare triple {7877#false} ~i~0 := 0; {7877#false} is VALID [2018-11-23 11:55:32,572 INFO L273 TraceCheckUtils]: 44: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,572 INFO L273 TraceCheckUtils]: 45: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,572 INFO L273 TraceCheckUtils]: 46: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,573 INFO L273 TraceCheckUtils]: 47: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,573 INFO L273 TraceCheckUtils]: 48: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,573 INFO L273 TraceCheckUtils]: 49: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,573 INFO L273 TraceCheckUtils]: 50: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,573 INFO L273 TraceCheckUtils]: 51: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,573 INFO L273 TraceCheckUtils]: 52: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,573 INFO L273 TraceCheckUtils]: 53: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,573 INFO L273 TraceCheckUtils]: 54: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,573 INFO L273 TraceCheckUtils]: 55: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,574 INFO L273 TraceCheckUtils]: 56: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,574 INFO L273 TraceCheckUtils]: 57: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,574 INFO L273 TraceCheckUtils]: 58: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,574 INFO L273 TraceCheckUtils]: 59: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,574 INFO L273 TraceCheckUtils]: 60: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:55:32,574 INFO L273 TraceCheckUtils]: 61: Hoare triple {7877#false} assume !(~i~0 < 100000); {7877#false} is VALID [2018-11-23 11:55:32,574 INFO L273 TraceCheckUtils]: 62: Hoare triple {7877#false} havoc ~x~0;~x~0 := 0; {7877#false} is VALID [2018-11-23 11:55:32,574 INFO L273 TraceCheckUtils]: 63: Hoare triple {7877#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7877#false} is VALID [2018-11-23 11:55:32,575 INFO L256 TraceCheckUtils]: 64: Hoare triple {7877#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {7877#false} is VALID [2018-11-23 11:55:32,575 INFO L273 TraceCheckUtils]: 65: Hoare triple {7877#false} ~cond := #in~cond; {7877#false} is VALID [2018-11-23 11:55:32,575 INFO L273 TraceCheckUtils]: 66: Hoare triple {7877#false} assume 0 == ~cond; {7877#false} is VALID [2018-11-23 11:55:32,575 INFO L273 TraceCheckUtils]: 67: Hoare triple {7877#false} assume !false; {7877#false} is VALID [2018-11-23 11:55:32,577 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-11-23 11:55:32,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:32,577 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:32,586 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:56:23,296 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-23 11:56:23,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:23,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:23,518 INFO L256 TraceCheckUtils]: 0: Hoare triple {7876#true} call ULTIMATE.init(); {7876#true} is VALID [2018-11-23 11:56:23,518 INFO L273 TraceCheckUtils]: 1: Hoare triple {7876#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7876#true} is VALID [2018-11-23 11:56:23,518 INFO L273 TraceCheckUtils]: 2: Hoare triple {7876#true} assume true; {7876#true} is VALID [2018-11-23 11:56:23,519 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7876#true} {7876#true} #74#return; {7876#true} is VALID [2018-11-23 11:56:23,519 INFO L256 TraceCheckUtils]: 4: Hoare triple {7876#true} call #t~ret2 := main(); {7876#true} is VALID [2018-11-23 11:56:23,520 INFO L273 TraceCheckUtils]: 5: Hoare triple {7876#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7914#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:23,520 INFO L273 TraceCheckUtils]: 6: Hoare triple {7914#(<= 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; {7879#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:23,521 INFO L273 TraceCheckUtils]: 7: Hoare triple {7879#(<= 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; {7880#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:23,522 INFO L273 TraceCheckUtils]: 8: Hoare triple {7880#(<= 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; {7881#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:23,522 INFO L273 TraceCheckUtils]: 9: Hoare triple {7881#(<= 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; {7882#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:23,523 INFO L273 TraceCheckUtils]: 10: Hoare triple {7882#(<= 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; {7883#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:23,524 INFO L273 TraceCheckUtils]: 11: Hoare triple {7883#(<= 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; {7884#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:23,525 INFO L273 TraceCheckUtils]: 12: Hoare triple {7884#(<= 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; {7885#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:23,526 INFO L273 TraceCheckUtils]: 13: Hoare triple {7885#(<= 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; {7886#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:23,527 INFO L273 TraceCheckUtils]: 14: Hoare triple {7886#(<= 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; {7887#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:23,528 INFO L273 TraceCheckUtils]: 15: Hoare triple {7887#(<= 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; {7888#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:23,529 INFO L273 TraceCheckUtils]: 16: Hoare triple {7888#(<= 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; {7889#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:23,530 INFO L273 TraceCheckUtils]: 17: Hoare triple {7889#(<= 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; {7890#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:23,531 INFO L273 TraceCheckUtils]: 18: Hoare triple {7890#(<= 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; {7891#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:23,532 INFO L273 TraceCheckUtils]: 19: Hoare triple {7891#(<= 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; {7892#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:23,533 INFO L273 TraceCheckUtils]: 20: Hoare triple {7892#(<= 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; {7893#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:23,534 INFO L273 TraceCheckUtils]: 21: Hoare triple {7893#(<= 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; {7894#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:23,535 INFO L273 TraceCheckUtils]: 22: Hoare triple {7894#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7895#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:23,535 INFO L273 TraceCheckUtils]: 23: Hoare triple {7895#(<= main_~i~0 17)} assume !(~i~0 < 100000); {7877#false} is VALID [2018-11-23 11:56:23,535 INFO L273 TraceCheckUtils]: 24: Hoare triple {7877#false} ~i~0 := 0; {7877#false} is VALID [2018-11-23 11:56:23,536 INFO L273 TraceCheckUtils]: 25: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,536 INFO L273 TraceCheckUtils]: 26: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,536 INFO L273 TraceCheckUtils]: 27: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,536 INFO L273 TraceCheckUtils]: 28: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,536 INFO L273 TraceCheckUtils]: 29: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,537 INFO L273 TraceCheckUtils]: 30: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,537 INFO L273 TraceCheckUtils]: 31: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,537 INFO L273 TraceCheckUtils]: 32: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,537 INFO L273 TraceCheckUtils]: 33: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,537 INFO L273 TraceCheckUtils]: 34: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,538 INFO L273 TraceCheckUtils]: 35: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,538 INFO L273 TraceCheckUtils]: 36: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,538 INFO L273 TraceCheckUtils]: 37: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,538 INFO L273 TraceCheckUtils]: 38: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,538 INFO L273 TraceCheckUtils]: 39: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,539 INFO L273 TraceCheckUtils]: 40: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,539 INFO L273 TraceCheckUtils]: 41: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,539 INFO L273 TraceCheckUtils]: 42: Hoare triple {7877#false} assume !(~i~0 < 100000); {7877#false} is VALID [2018-11-23 11:56:23,539 INFO L273 TraceCheckUtils]: 43: Hoare triple {7877#false} ~i~0 := 0; {7877#false} is VALID [2018-11-23 11:56:23,539 INFO L273 TraceCheckUtils]: 44: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,539 INFO L273 TraceCheckUtils]: 45: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,539 INFO L273 TraceCheckUtils]: 46: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,540 INFO L273 TraceCheckUtils]: 47: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,540 INFO L273 TraceCheckUtils]: 48: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,540 INFO L273 TraceCheckUtils]: 49: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,540 INFO L273 TraceCheckUtils]: 50: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,540 INFO L273 TraceCheckUtils]: 51: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,540 INFO L273 TraceCheckUtils]: 52: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,540 INFO L273 TraceCheckUtils]: 53: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,540 INFO L273 TraceCheckUtils]: 54: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,540 INFO L273 TraceCheckUtils]: 55: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,541 INFO L273 TraceCheckUtils]: 56: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,541 INFO L273 TraceCheckUtils]: 57: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,541 INFO L273 TraceCheckUtils]: 58: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,541 INFO L273 TraceCheckUtils]: 59: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,541 INFO L273 TraceCheckUtils]: 60: Hoare triple {7877#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7877#false} is VALID [2018-11-23 11:56:23,541 INFO L273 TraceCheckUtils]: 61: Hoare triple {7877#false} assume !(~i~0 < 100000); {7877#false} is VALID [2018-11-23 11:56:23,541 INFO L273 TraceCheckUtils]: 62: Hoare triple {7877#false} havoc ~x~0;~x~0 := 0; {7877#false} is VALID [2018-11-23 11:56:23,541 INFO L273 TraceCheckUtils]: 63: Hoare triple {7877#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7877#false} is VALID [2018-11-23 11:56:23,542 INFO L256 TraceCheckUtils]: 64: Hoare triple {7877#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {7877#false} is VALID [2018-11-23 11:56:23,542 INFO L273 TraceCheckUtils]: 65: Hoare triple {7877#false} ~cond := #in~cond; {7877#false} is VALID [2018-11-23 11:56:23,542 INFO L273 TraceCheckUtils]: 66: Hoare triple {7877#false} assume 0 == ~cond; {7877#false} is VALID [2018-11-23 11:56:23,542 INFO L273 TraceCheckUtils]: 67: Hoare triple {7877#false} assume !false; {7877#false} is VALID [2018-11-23 11:56:23,544 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-11-23 11:56:23,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:23,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 11:56:23,576 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2018-11-23 11:56:23,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:23,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 11:56:23,606 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:23,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 11:56:23,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 11:56:23,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:56:23,607 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 21 states. [2018-11-23 11:56:24,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:24,286 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-11-23 11:56:24,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:56:24,286 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2018-11-23 11:56:24,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:24,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:56:24,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 99 transitions. [2018-11-23 11:56:24,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:56:24,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 99 transitions. [2018-11-23 11:56:24,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 99 transitions. [2018-11-23 11:56:24,429 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:24,430 INFO L225 Difference]: With dead ends: 125 [2018-11-23 11:56:24,430 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 11:56:24,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:56:24,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 11:56:24,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-23 11:56:24,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:24,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 76 states. [2018-11-23 11:56:24,624 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-23 11:56:24,624 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-23 11:56:24,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:24,626 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-11-23 11:56:24,626 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-11-23 11:56:24,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:24,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:24,627 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-23 11:56:24,627 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-23 11:56:24,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:24,628 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-11-23 11:56:24,628 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-11-23 11:56:24,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:24,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:24,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:24,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 11:56:24,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-11-23 11:56:24,630 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 68 [2018-11-23 11:56:24,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:24,630 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-11-23 11:56:24,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 11:56:24,630 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-11-23 11:56:24,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 11:56:24,631 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:24,631 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:24,632 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:24,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:24,632 INFO L82 PathProgramCache]: Analyzing trace with hash -33021222, now seen corresponding path program 18 times [2018-11-23 11:56:24,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:24,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:24,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:24,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:24,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:25,566 INFO L256 TraceCheckUtils]: 0: Hoare triple {8620#true} call ULTIMATE.init(); {8620#true} is VALID [2018-11-23 11:56:25,567 INFO L273 TraceCheckUtils]: 1: Hoare triple {8620#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8620#true} is VALID [2018-11-23 11:56:25,567 INFO L273 TraceCheckUtils]: 2: Hoare triple {8620#true} assume true; {8620#true} is VALID [2018-11-23 11:56:25,567 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8620#true} {8620#true} #74#return; {8620#true} is VALID [2018-11-23 11:56:25,568 INFO L256 TraceCheckUtils]: 4: Hoare triple {8620#true} call #t~ret2 := main(); {8620#true} is VALID [2018-11-23 11:56:25,575 INFO L273 TraceCheckUtils]: 5: Hoare triple {8620#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8622#(= main_~i~0 0)} is VALID [2018-11-23 11:56:25,576 INFO L273 TraceCheckUtils]: 6: Hoare triple {8622#(= 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; {8623#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:25,576 INFO L273 TraceCheckUtils]: 7: Hoare triple {8623#(<= 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; {8624#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:25,577 INFO L273 TraceCheckUtils]: 8: Hoare triple {8624#(<= 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; {8625#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:25,578 INFO L273 TraceCheckUtils]: 9: Hoare triple {8625#(<= 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; {8626#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:25,578 INFO L273 TraceCheckUtils]: 10: Hoare triple {8626#(<= 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; {8627#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:25,579 INFO L273 TraceCheckUtils]: 11: Hoare triple {8627#(<= 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; {8628#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:25,580 INFO L273 TraceCheckUtils]: 12: Hoare triple {8628#(<= 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; {8629#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:25,581 INFO L273 TraceCheckUtils]: 13: Hoare triple {8629#(<= 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; {8630#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:25,582 INFO L273 TraceCheckUtils]: 14: Hoare triple {8630#(<= 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; {8631#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:25,583 INFO L273 TraceCheckUtils]: 15: Hoare triple {8631#(<= 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; {8632#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:25,584 INFO L273 TraceCheckUtils]: 16: Hoare triple {8632#(<= 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; {8633#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:25,585 INFO L273 TraceCheckUtils]: 17: Hoare triple {8633#(<= 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; {8634#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:25,586 INFO L273 TraceCheckUtils]: 18: Hoare triple {8634#(<= 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; {8635#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:25,587 INFO L273 TraceCheckUtils]: 19: Hoare triple {8635#(<= 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; {8636#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:25,588 INFO L273 TraceCheckUtils]: 20: Hoare triple {8636#(<= 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; {8637#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:25,589 INFO L273 TraceCheckUtils]: 21: Hoare triple {8637#(<= 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; {8638#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:25,590 INFO L273 TraceCheckUtils]: 22: Hoare triple {8638#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8639#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:25,591 INFO L273 TraceCheckUtils]: 23: Hoare triple {8639#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8640#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:25,591 INFO L273 TraceCheckUtils]: 24: Hoare triple {8640#(<= main_~i~0 18)} assume !(~i~0 < 100000); {8621#false} is VALID [2018-11-23 11:56:25,592 INFO L273 TraceCheckUtils]: 25: Hoare triple {8621#false} ~i~0 := 0; {8621#false} is VALID [2018-11-23 11:56:25,592 INFO L273 TraceCheckUtils]: 26: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,592 INFO L273 TraceCheckUtils]: 27: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,592 INFO L273 TraceCheckUtils]: 28: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,592 INFO L273 TraceCheckUtils]: 29: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,593 INFO L273 TraceCheckUtils]: 30: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,593 INFO L273 TraceCheckUtils]: 31: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,593 INFO L273 TraceCheckUtils]: 32: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,593 INFO L273 TraceCheckUtils]: 33: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,594 INFO L273 TraceCheckUtils]: 34: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,594 INFO L273 TraceCheckUtils]: 35: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,594 INFO L273 TraceCheckUtils]: 36: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,594 INFO L273 TraceCheckUtils]: 37: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,594 INFO L273 TraceCheckUtils]: 38: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,595 INFO L273 TraceCheckUtils]: 39: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,595 INFO L273 TraceCheckUtils]: 40: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,595 INFO L273 TraceCheckUtils]: 41: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,595 INFO L273 TraceCheckUtils]: 42: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,595 INFO L273 TraceCheckUtils]: 43: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,595 INFO L273 TraceCheckUtils]: 44: Hoare triple {8621#false} assume !(~i~0 < 100000); {8621#false} is VALID [2018-11-23 11:56:25,596 INFO L273 TraceCheckUtils]: 45: Hoare triple {8621#false} ~i~0 := 0; {8621#false} is VALID [2018-11-23 11:56:25,596 INFO L273 TraceCheckUtils]: 46: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,596 INFO L273 TraceCheckUtils]: 47: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,596 INFO L273 TraceCheckUtils]: 48: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,596 INFO L273 TraceCheckUtils]: 49: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,597 INFO L273 TraceCheckUtils]: 50: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,597 INFO L273 TraceCheckUtils]: 51: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,597 INFO L273 TraceCheckUtils]: 52: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,597 INFO L273 TraceCheckUtils]: 53: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,597 INFO L273 TraceCheckUtils]: 54: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,598 INFO L273 TraceCheckUtils]: 55: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,598 INFO L273 TraceCheckUtils]: 56: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,598 INFO L273 TraceCheckUtils]: 57: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,598 INFO L273 TraceCheckUtils]: 58: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,598 INFO L273 TraceCheckUtils]: 59: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,598 INFO L273 TraceCheckUtils]: 60: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,598 INFO L273 TraceCheckUtils]: 61: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,599 INFO L273 TraceCheckUtils]: 62: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,599 INFO L273 TraceCheckUtils]: 63: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:25,599 INFO L273 TraceCheckUtils]: 64: Hoare triple {8621#false} assume !(~i~0 < 100000); {8621#false} is VALID [2018-11-23 11:56:25,599 INFO L273 TraceCheckUtils]: 65: Hoare triple {8621#false} havoc ~x~0;~x~0 := 0; {8621#false} is VALID [2018-11-23 11:56:25,599 INFO L273 TraceCheckUtils]: 66: Hoare triple {8621#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8621#false} is VALID [2018-11-23 11:56:25,599 INFO L256 TraceCheckUtils]: 67: Hoare triple {8621#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {8621#false} is VALID [2018-11-23 11:56:25,599 INFO L273 TraceCheckUtils]: 68: Hoare triple {8621#false} ~cond := #in~cond; {8621#false} is VALID [2018-11-23 11:56:25,599 INFO L273 TraceCheckUtils]: 69: Hoare triple {8621#false} assume 0 == ~cond; {8621#false} is VALID [2018-11-23 11:56:25,599 INFO L273 TraceCheckUtils]: 70: Hoare triple {8621#false} assume !false; {8621#false} is VALID [2018-11-23 11:56:25,602 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-11-23 11:56:25,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:25,602 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:25,611 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:56:56,067 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-11-23 11:56:56,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:56,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:56,252 INFO L256 TraceCheckUtils]: 0: Hoare triple {8620#true} call ULTIMATE.init(); {8620#true} is VALID [2018-11-23 11:56:56,253 INFO L273 TraceCheckUtils]: 1: Hoare triple {8620#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8620#true} is VALID [2018-11-23 11:56:56,253 INFO L273 TraceCheckUtils]: 2: Hoare triple {8620#true} assume true; {8620#true} is VALID [2018-11-23 11:56:56,253 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8620#true} {8620#true} #74#return; {8620#true} is VALID [2018-11-23 11:56:56,253 INFO L256 TraceCheckUtils]: 4: Hoare triple {8620#true} call #t~ret2 := main(); {8620#true} is VALID [2018-11-23 11:56:56,254 INFO L273 TraceCheckUtils]: 5: Hoare triple {8620#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8659#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:56,255 INFO L273 TraceCheckUtils]: 6: Hoare triple {8659#(<= 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; {8623#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:56,255 INFO L273 TraceCheckUtils]: 7: Hoare triple {8623#(<= 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; {8624#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:56,256 INFO L273 TraceCheckUtils]: 8: Hoare triple {8624#(<= 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; {8625#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:56,257 INFO L273 TraceCheckUtils]: 9: Hoare triple {8625#(<= 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; {8626#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:56,257 INFO L273 TraceCheckUtils]: 10: Hoare triple {8626#(<= 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; {8627#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:56,258 INFO L273 TraceCheckUtils]: 11: Hoare triple {8627#(<= 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; {8628#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:56,259 INFO L273 TraceCheckUtils]: 12: Hoare triple {8628#(<= 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; {8629#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:56,260 INFO L273 TraceCheckUtils]: 13: Hoare triple {8629#(<= 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; {8630#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:56,261 INFO L273 TraceCheckUtils]: 14: Hoare triple {8630#(<= 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; {8631#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:56,262 INFO L273 TraceCheckUtils]: 15: Hoare triple {8631#(<= 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; {8632#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:56,263 INFO L273 TraceCheckUtils]: 16: Hoare triple {8632#(<= 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; {8633#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:56,264 INFO L273 TraceCheckUtils]: 17: Hoare triple {8633#(<= 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; {8634#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:56,265 INFO L273 TraceCheckUtils]: 18: Hoare triple {8634#(<= 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; {8635#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:56,266 INFO L273 TraceCheckUtils]: 19: Hoare triple {8635#(<= 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; {8636#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:56,267 INFO L273 TraceCheckUtils]: 20: Hoare triple {8636#(<= 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; {8637#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:56,268 INFO L273 TraceCheckUtils]: 21: Hoare triple {8637#(<= 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; {8638#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:56,269 INFO L273 TraceCheckUtils]: 22: Hoare triple {8638#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8639#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:56,270 INFO L273 TraceCheckUtils]: 23: Hoare triple {8639#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8640#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:56,270 INFO L273 TraceCheckUtils]: 24: Hoare triple {8640#(<= main_~i~0 18)} assume !(~i~0 < 100000); {8621#false} is VALID [2018-11-23 11:56:56,271 INFO L273 TraceCheckUtils]: 25: Hoare triple {8621#false} ~i~0 := 0; {8621#false} is VALID [2018-11-23 11:56:56,271 INFO L273 TraceCheckUtils]: 26: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,271 INFO L273 TraceCheckUtils]: 27: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,271 INFO L273 TraceCheckUtils]: 28: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,271 INFO L273 TraceCheckUtils]: 29: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,272 INFO L273 TraceCheckUtils]: 30: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,272 INFO L273 TraceCheckUtils]: 31: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,272 INFO L273 TraceCheckUtils]: 32: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,272 INFO L273 TraceCheckUtils]: 33: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,272 INFO L273 TraceCheckUtils]: 34: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,273 INFO L273 TraceCheckUtils]: 35: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,273 INFO L273 TraceCheckUtils]: 36: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,273 INFO L273 TraceCheckUtils]: 37: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,273 INFO L273 TraceCheckUtils]: 38: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,273 INFO L273 TraceCheckUtils]: 39: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,274 INFO L273 TraceCheckUtils]: 40: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,274 INFO L273 TraceCheckUtils]: 41: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,274 INFO L273 TraceCheckUtils]: 42: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,274 INFO L273 TraceCheckUtils]: 43: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,274 INFO L273 TraceCheckUtils]: 44: Hoare triple {8621#false} assume !(~i~0 < 100000); {8621#false} is VALID [2018-11-23 11:56:56,275 INFO L273 TraceCheckUtils]: 45: Hoare triple {8621#false} ~i~0 := 0; {8621#false} is VALID [2018-11-23 11:56:56,275 INFO L273 TraceCheckUtils]: 46: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,275 INFO L273 TraceCheckUtils]: 47: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,275 INFO L273 TraceCheckUtils]: 48: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,275 INFO L273 TraceCheckUtils]: 49: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,276 INFO L273 TraceCheckUtils]: 50: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,276 INFO L273 TraceCheckUtils]: 51: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,276 INFO L273 TraceCheckUtils]: 52: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,276 INFO L273 TraceCheckUtils]: 53: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,276 INFO L273 TraceCheckUtils]: 54: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,276 INFO L273 TraceCheckUtils]: 55: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,276 INFO L273 TraceCheckUtils]: 56: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,276 INFO L273 TraceCheckUtils]: 57: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,277 INFO L273 TraceCheckUtils]: 58: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,277 INFO L273 TraceCheckUtils]: 59: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,277 INFO L273 TraceCheckUtils]: 60: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,277 INFO L273 TraceCheckUtils]: 61: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,277 INFO L273 TraceCheckUtils]: 62: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,277 INFO L273 TraceCheckUtils]: 63: Hoare triple {8621#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8621#false} is VALID [2018-11-23 11:56:56,277 INFO L273 TraceCheckUtils]: 64: Hoare triple {8621#false} assume !(~i~0 < 100000); {8621#false} is VALID [2018-11-23 11:56:56,277 INFO L273 TraceCheckUtils]: 65: Hoare triple {8621#false} havoc ~x~0;~x~0 := 0; {8621#false} is VALID [2018-11-23 11:56:56,277 INFO L273 TraceCheckUtils]: 66: Hoare triple {8621#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8621#false} is VALID [2018-11-23 11:56:56,278 INFO L256 TraceCheckUtils]: 67: Hoare triple {8621#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {8621#false} is VALID [2018-11-23 11:56:56,278 INFO L273 TraceCheckUtils]: 68: Hoare triple {8621#false} ~cond := #in~cond; {8621#false} is VALID [2018-11-23 11:56:56,278 INFO L273 TraceCheckUtils]: 69: Hoare triple {8621#false} assume 0 == ~cond; {8621#false} is VALID [2018-11-23 11:56:56,278 INFO L273 TraceCheckUtils]: 70: Hoare triple {8621#false} assume !false; {8621#false} is VALID [2018-11-23 11:56:56,280 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-11-23 11:56:56,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:56,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 11:56:56,307 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 71 [2018-11-23 11:56:56,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:56,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:56:56,338 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 11:56:56,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:56:56,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:56:56,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:56:56,339 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 22 states. [2018-11-23 11:56:56,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:56,780 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-11-23 11:56:56,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 11:56:56,781 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 71 [2018-11-23 11:56:56,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:56,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:56:56,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 102 transitions. [2018-11-23 11:56:56,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:56:56,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 102 transitions. [2018-11-23 11:56:56,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 102 transitions. [2018-11-23 11:56:56,912 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:56,913 INFO L225 Difference]: With dead ends: 130 [2018-11-23 11:56:56,913 INFO L226 Difference]: Without dead ends: 79 [2018-11-23 11:56:56,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:56:56,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-23 11:56:56,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-11-23 11:56:56,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:56,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 79 states. [2018-11-23 11:56:56,969 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2018-11-23 11:56:56,969 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2018-11-23 11:56:56,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:56,971 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-11-23 11:56:56,971 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2018-11-23 11:56:56,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:56,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:56,971 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2018-11-23 11:56:56,971 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2018-11-23 11:56:56,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:56,973 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-11-23 11:56:56,973 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2018-11-23 11:56:56,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:56,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:56,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:56,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:56,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 11:56:56,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2018-11-23 11:56:56,975 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 71 [2018-11-23 11:56:56,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:56,975 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2018-11-23 11:56:56,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:56:56,976 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2018-11-23 11:56:56,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-23 11:56:56,976 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:56,976 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:56,977 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:56,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:56,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1723757855, now seen corresponding path program 19 times [2018-11-23 11:56:56,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:56,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:56,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:56,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:56,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:57,364 INFO L256 TraceCheckUtils]: 0: Hoare triple {9396#true} call ULTIMATE.init(); {9396#true} is VALID [2018-11-23 11:56:57,364 INFO L273 TraceCheckUtils]: 1: Hoare triple {9396#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9396#true} is VALID [2018-11-23 11:56:57,364 INFO L273 TraceCheckUtils]: 2: Hoare triple {9396#true} assume true; {9396#true} is VALID [2018-11-23 11:56:57,364 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9396#true} {9396#true} #74#return; {9396#true} is VALID [2018-11-23 11:56:57,364 INFO L256 TraceCheckUtils]: 4: Hoare triple {9396#true} call #t~ret2 := main(); {9396#true} is VALID [2018-11-23 11:56:57,365 INFO L273 TraceCheckUtils]: 5: Hoare triple {9396#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9398#(= main_~i~0 0)} is VALID [2018-11-23 11:56:57,366 INFO L273 TraceCheckUtils]: 6: Hoare triple {9398#(= 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; {9399#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:57,367 INFO L273 TraceCheckUtils]: 7: Hoare triple {9399#(<= 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; {9400#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:57,368 INFO L273 TraceCheckUtils]: 8: Hoare triple {9400#(<= 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; {9401#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:57,369 INFO L273 TraceCheckUtils]: 9: Hoare triple {9401#(<= 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; {9402#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:57,369 INFO L273 TraceCheckUtils]: 10: Hoare triple {9402#(<= 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; {9403#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:57,370 INFO L273 TraceCheckUtils]: 11: Hoare triple {9403#(<= 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; {9404#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:57,371 INFO L273 TraceCheckUtils]: 12: Hoare triple {9404#(<= 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; {9405#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:57,372 INFO L273 TraceCheckUtils]: 13: Hoare triple {9405#(<= 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; {9406#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:57,373 INFO L273 TraceCheckUtils]: 14: Hoare triple {9406#(<= 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; {9407#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:57,374 INFO L273 TraceCheckUtils]: 15: Hoare triple {9407#(<= 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; {9408#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:57,375 INFO L273 TraceCheckUtils]: 16: Hoare triple {9408#(<= 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; {9409#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:57,376 INFO L273 TraceCheckUtils]: 17: Hoare triple {9409#(<= 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; {9410#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:57,377 INFO L273 TraceCheckUtils]: 18: Hoare triple {9410#(<= 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; {9411#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:57,378 INFO L273 TraceCheckUtils]: 19: Hoare triple {9411#(<= 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; {9412#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:57,379 INFO L273 TraceCheckUtils]: 20: Hoare triple {9412#(<= 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; {9413#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:57,380 INFO L273 TraceCheckUtils]: 21: Hoare triple {9413#(<= 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; {9414#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:57,381 INFO L273 TraceCheckUtils]: 22: Hoare triple {9414#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9415#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:57,382 INFO L273 TraceCheckUtils]: 23: Hoare triple {9415#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9416#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:57,383 INFO L273 TraceCheckUtils]: 24: Hoare triple {9416#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9417#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:57,383 INFO L273 TraceCheckUtils]: 25: Hoare triple {9417#(<= main_~i~0 19)} assume !(~i~0 < 100000); {9397#false} is VALID [2018-11-23 11:56:57,384 INFO L273 TraceCheckUtils]: 26: Hoare triple {9397#false} ~i~0 := 0; {9397#false} is VALID [2018-11-23 11:56:57,384 INFO L273 TraceCheckUtils]: 27: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,384 INFO L273 TraceCheckUtils]: 28: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,384 INFO L273 TraceCheckUtils]: 29: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,384 INFO L273 TraceCheckUtils]: 30: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,385 INFO L273 TraceCheckUtils]: 31: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,385 INFO L273 TraceCheckUtils]: 32: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,385 INFO L273 TraceCheckUtils]: 33: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,385 INFO L273 TraceCheckUtils]: 34: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,385 INFO L273 TraceCheckUtils]: 35: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,386 INFO L273 TraceCheckUtils]: 36: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,386 INFO L273 TraceCheckUtils]: 37: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,386 INFO L273 TraceCheckUtils]: 38: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,386 INFO L273 TraceCheckUtils]: 39: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,386 INFO L273 TraceCheckUtils]: 40: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,387 INFO L273 TraceCheckUtils]: 41: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,387 INFO L273 TraceCheckUtils]: 42: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,387 INFO L273 TraceCheckUtils]: 43: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,387 INFO L273 TraceCheckUtils]: 44: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,387 INFO L273 TraceCheckUtils]: 45: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,387 INFO L273 TraceCheckUtils]: 46: Hoare triple {9397#false} assume !(~i~0 < 100000); {9397#false} is VALID [2018-11-23 11:56:57,387 INFO L273 TraceCheckUtils]: 47: Hoare triple {9397#false} ~i~0 := 0; {9397#false} is VALID [2018-11-23 11:56:57,387 INFO L273 TraceCheckUtils]: 48: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,388 INFO L273 TraceCheckUtils]: 49: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,388 INFO L273 TraceCheckUtils]: 50: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,388 INFO L273 TraceCheckUtils]: 51: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,388 INFO L273 TraceCheckUtils]: 52: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,388 INFO L273 TraceCheckUtils]: 53: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,388 INFO L273 TraceCheckUtils]: 54: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,388 INFO L273 TraceCheckUtils]: 55: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,388 INFO L273 TraceCheckUtils]: 56: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,389 INFO L273 TraceCheckUtils]: 57: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,389 INFO L273 TraceCheckUtils]: 58: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,389 INFO L273 TraceCheckUtils]: 59: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,389 INFO L273 TraceCheckUtils]: 60: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,389 INFO L273 TraceCheckUtils]: 61: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,389 INFO L273 TraceCheckUtils]: 62: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,389 INFO L273 TraceCheckUtils]: 63: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,389 INFO L273 TraceCheckUtils]: 64: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,389 INFO L273 TraceCheckUtils]: 65: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,390 INFO L273 TraceCheckUtils]: 66: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,390 INFO L273 TraceCheckUtils]: 67: Hoare triple {9397#false} assume !(~i~0 < 100000); {9397#false} is VALID [2018-11-23 11:56:57,390 INFO L273 TraceCheckUtils]: 68: Hoare triple {9397#false} havoc ~x~0;~x~0 := 0; {9397#false} is VALID [2018-11-23 11:56:57,390 INFO L273 TraceCheckUtils]: 69: Hoare triple {9397#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9397#false} is VALID [2018-11-23 11:56:57,390 INFO L256 TraceCheckUtils]: 70: Hoare triple {9397#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {9397#false} is VALID [2018-11-23 11:56:57,390 INFO L273 TraceCheckUtils]: 71: Hoare triple {9397#false} ~cond := #in~cond; {9397#false} is VALID [2018-11-23 11:56:57,390 INFO L273 TraceCheckUtils]: 72: Hoare triple {9397#false} assume 0 == ~cond; {9397#false} is VALID [2018-11-23 11:56:57,390 INFO L273 TraceCheckUtils]: 73: Hoare triple {9397#false} assume !false; {9397#false} is VALID [2018-11-23 11:56:57,393 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-11-23 11:56:57,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:57,393 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:57,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:56:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:57,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:57,692 INFO L256 TraceCheckUtils]: 0: Hoare triple {9396#true} call ULTIMATE.init(); {9396#true} is VALID [2018-11-23 11:56:57,692 INFO L273 TraceCheckUtils]: 1: Hoare triple {9396#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9396#true} is VALID [2018-11-23 11:56:57,692 INFO L273 TraceCheckUtils]: 2: Hoare triple {9396#true} assume true; {9396#true} is VALID [2018-11-23 11:56:57,692 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9396#true} {9396#true} #74#return; {9396#true} is VALID [2018-11-23 11:56:57,692 INFO L256 TraceCheckUtils]: 4: Hoare triple {9396#true} call #t~ret2 := main(); {9396#true} is VALID [2018-11-23 11:56:57,693 INFO L273 TraceCheckUtils]: 5: Hoare triple {9396#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9436#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:57,693 INFO L273 TraceCheckUtils]: 6: Hoare triple {9436#(<= 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; {9399#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:57,694 INFO L273 TraceCheckUtils]: 7: Hoare triple {9399#(<= 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; {9400#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:57,695 INFO L273 TraceCheckUtils]: 8: Hoare triple {9400#(<= 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; {9401#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:57,695 INFO L273 TraceCheckUtils]: 9: Hoare triple {9401#(<= 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; {9402#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:57,696 INFO L273 TraceCheckUtils]: 10: Hoare triple {9402#(<= 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; {9403#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:57,697 INFO L273 TraceCheckUtils]: 11: Hoare triple {9403#(<= 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; {9404#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:57,698 INFO L273 TraceCheckUtils]: 12: Hoare triple {9404#(<= 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; {9405#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:57,699 INFO L273 TraceCheckUtils]: 13: Hoare triple {9405#(<= 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; {9406#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:57,700 INFO L273 TraceCheckUtils]: 14: Hoare triple {9406#(<= 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; {9407#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:57,701 INFO L273 TraceCheckUtils]: 15: Hoare triple {9407#(<= 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; {9408#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:57,702 INFO L273 TraceCheckUtils]: 16: Hoare triple {9408#(<= 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; {9409#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:57,703 INFO L273 TraceCheckUtils]: 17: Hoare triple {9409#(<= 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; {9410#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:57,703 INFO L273 TraceCheckUtils]: 18: Hoare triple {9410#(<= 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; {9411#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:57,704 INFO L273 TraceCheckUtils]: 19: Hoare triple {9411#(<= 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; {9412#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:57,705 INFO L273 TraceCheckUtils]: 20: Hoare triple {9412#(<= 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; {9413#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:57,706 INFO L273 TraceCheckUtils]: 21: Hoare triple {9413#(<= 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; {9414#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:57,707 INFO L273 TraceCheckUtils]: 22: Hoare triple {9414#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9415#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:57,708 INFO L273 TraceCheckUtils]: 23: Hoare triple {9415#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9416#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:57,709 INFO L273 TraceCheckUtils]: 24: Hoare triple {9416#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9417#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:57,710 INFO L273 TraceCheckUtils]: 25: Hoare triple {9417#(<= main_~i~0 19)} assume !(~i~0 < 100000); {9397#false} is VALID [2018-11-23 11:56:57,710 INFO L273 TraceCheckUtils]: 26: Hoare triple {9397#false} ~i~0 := 0; {9397#false} is VALID [2018-11-23 11:56:57,710 INFO L273 TraceCheckUtils]: 27: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,710 INFO L273 TraceCheckUtils]: 28: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,711 INFO L273 TraceCheckUtils]: 29: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,711 INFO L273 TraceCheckUtils]: 30: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,711 INFO L273 TraceCheckUtils]: 31: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,711 INFO L273 TraceCheckUtils]: 32: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,711 INFO L273 TraceCheckUtils]: 33: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,712 INFO L273 TraceCheckUtils]: 34: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,712 INFO L273 TraceCheckUtils]: 35: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,712 INFO L273 TraceCheckUtils]: 36: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,712 INFO L273 TraceCheckUtils]: 37: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,712 INFO L273 TraceCheckUtils]: 38: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,713 INFO L273 TraceCheckUtils]: 39: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,713 INFO L273 TraceCheckUtils]: 40: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,713 INFO L273 TraceCheckUtils]: 41: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,713 INFO L273 TraceCheckUtils]: 42: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,713 INFO L273 TraceCheckUtils]: 43: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,714 INFO L273 TraceCheckUtils]: 44: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,714 INFO L273 TraceCheckUtils]: 45: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,714 INFO L273 TraceCheckUtils]: 46: Hoare triple {9397#false} assume !(~i~0 < 100000); {9397#false} is VALID [2018-11-23 11:56:57,714 INFO L273 TraceCheckUtils]: 47: Hoare triple {9397#false} ~i~0 := 0; {9397#false} is VALID [2018-11-23 11:56:57,714 INFO L273 TraceCheckUtils]: 48: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,715 INFO L273 TraceCheckUtils]: 49: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,715 INFO L273 TraceCheckUtils]: 50: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,715 INFO L273 TraceCheckUtils]: 51: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,715 INFO L273 TraceCheckUtils]: 52: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,715 INFO L273 TraceCheckUtils]: 53: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,715 INFO L273 TraceCheckUtils]: 54: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,715 INFO L273 TraceCheckUtils]: 55: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,715 INFO L273 TraceCheckUtils]: 56: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,715 INFO L273 TraceCheckUtils]: 57: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,716 INFO L273 TraceCheckUtils]: 58: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,716 INFO L273 TraceCheckUtils]: 59: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,716 INFO L273 TraceCheckUtils]: 60: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,716 INFO L273 TraceCheckUtils]: 61: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,716 INFO L273 TraceCheckUtils]: 62: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,716 INFO L273 TraceCheckUtils]: 63: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,716 INFO L273 TraceCheckUtils]: 64: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,716 INFO L273 TraceCheckUtils]: 65: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,716 INFO L273 TraceCheckUtils]: 66: Hoare triple {9397#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9397#false} is VALID [2018-11-23 11:56:57,717 INFO L273 TraceCheckUtils]: 67: Hoare triple {9397#false} assume !(~i~0 < 100000); {9397#false} is VALID [2018-11-23 11:56:57,717 INFO L273 TraceCheckUtils]: 68: Hoare triple {9397#false} havoc ~x~0;~x~0 := 0; {9397#false} is VALID [2018-11-23 11:56:57,717 INFO L273 TraceCheckUtils]: 69: Hoare triple {9397#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9397#false} is VALID [2018-11-23 11:56:57,717 INFO L256 TraceCheckUtils]: 70: Hoare triple {9397#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {9397#false} is VALID [2018-11-23 11:56:57,717 INFO L273 TraceCheckUtils]: 71: Hoare triple {9397#false} ~cond := #in~cond; {9397#false} is VALID [2018-11-23 11:56:57,717 INFO L273 TraceCheckUtils]: 72: Hoare triple {9397#false} assume 0 == ~cond; {9397#false} is VALID [2018-11-23 11:56:57,717 INFO L273 TraceCheckUtils]: 73: Hoare triple {9397#false} assume !false; {9397#false} is VALID [2018-11-23 11:56:57,720 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-11-23 11:56:57,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:57,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 11:56:57,740 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 74 [2018-11-23 11:56:57,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:57,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 11:56:57,772 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:57,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 11:56:57,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 11:56:57,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:56:57,773 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 23 states. [2018-11-23 11:56:58,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:58,483 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2018-11-23 11:56:58,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 11:56:58,483 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 74 [2018-11-23 11:56:58,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:58,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:56:58,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 105 transitions. [2018-11-23 11:56:58,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:56:58,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 105 transitions. [2018-11-23 11:56:58,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 105 transitions. [2018-11-23 11:56:58,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:58,604 INFO L225 Difference]: With dead ends: 135 [2018-11-23 11:56:58,604 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 11:56:58,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:56:58,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 11:56:58,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-23 11:56:58,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:58,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 82 states. [2018-11-23 11:56:58,669 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2018-11-23 11:56:58,669 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2018-11-23 11:56:58,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:58,672 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2018-11-23 11:56:58,672 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-11-23 11:56:58,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:58,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:58,673 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2018-11-23 11:56:58,673 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2018-11-23 11:56:58,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:58,674 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2018-11-23 11:56:58,674 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-11-23 11:56:58,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:58,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:58,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:58,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:58,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 11:56:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-11-23 11:56:58,677 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 74 [2018-11-23 11:56:58,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:58,677 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-11-23 11:56:58,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 11:56:58,677 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-11-23 11:56:58,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 11:56:58,678 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:58,678 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:58,678 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:58,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:58,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1471776390, now seen corresponding path program 20 times [2018-11-23 11:56:58,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:58,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:58,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:58,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:56:58,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:59,172 INFO L256 TraceCheckUtils]: 0: Hoare triple {10204#true} call ULTIMATE.init(); {10204#true} is VALID [2018-11-23 11:56:59,173 INFO L273 TraceCheckUtils]: 1: Hoare triple {10204#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10204#true} is VALID [2018-11-23 11:56:59,173 INFO L273 TraceCheckUtils]: 2: Hoare triple {10204#true} assume true; {10204#true} is VALID [2018-11-23 11:56:59,173 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10204#true} {10204#true} #74#return; {10204#true} is VALID [2018-11-23 11:56:59,173 INFO L256 TraceCheckUtils]: 4: Hoare triple {10204#true} call #t~ret2 := main(); {10204#true} is VALID [2018-11-23 11:56:59,174 INFO L273 TraceCheckUtils]: 5: Hoare triple {10204#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10206#(= main_~i~0 0)} is VALID [2018-11-23 11:56:59,175 INFO L273 TraceCheckUtils]: 6: Hoare triple {10206#(= 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; {10207#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:59,176 INFO L273 TraceCheckUtils]: 7: Hoare triple {10207#(<= 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; {10208#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:59,177 INFO L273 TraceCheckUtils]: 8: Hoare triple {10208#(<= 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; {10209#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:59,177 INFO L273 TraceCheckUtils]: 9: Hoare triple {10209#(<= 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; {10210#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:59,178 INFO L273 TraceCheckUtils]: 10: Hoare triple {10210#(<= 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; {10211#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:59,178 INFO L273 TraceCheckUtils]: 11: Hoare triple {10211#(<= 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; {10212#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:59,179 INFO L273 TraceCheckUtils]: 12: Hoare triple {10212#(<= 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; {10213#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:59,179 INFO L273 TraceCheckUtils]: 13: Hoare triple {10213#(<= 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; {10214#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:59,180 INFO L273 TraceCheckUtils]: 14: Hoare triple {10214#(<= 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; {10215#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:59,181 INFO L273 TraceCheckUtils]: 15: Hoare triple {10215#(<= 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; {10216#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:59,182 INFO L273 TraceCheckUtils]: 16: Hoare triple {10216#(<= 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; {10217#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:59,183 INFO L273 TraceCheckUtils]: 17: Hoare triple {10217#(<= 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; {10218#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:59,184 INFO L273 TraceCheckUtils]: 18: Hoare triple {10218#(<= 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; {10219#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:59,185 INFO L273 TraceCheckUtils]: 19: Hoare triple {10219#(<= 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; {10220#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:59,186 INFO L273 TraceCheckUtils]: 20: Hoare triple {10220#(<= 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; {10221#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:59,187 INFO L273 TraceCheckUtils]: 21: Hoare triple {10221#(<= 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; {10222#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:59,188 INFO L273 TraceCheckUtils]: 22: Hoare triple {10222#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10223#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:59,189 INFO L273 TraceCheckUtils]: 23: Hoare triple {10223#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10224#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:59,190 INFO L273 TraceCheckUtils]: 24: Hoare triple {10224#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10225#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:59,191 INFO L273 TraceCheckUtils]: 25: Hoare triple {10225#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10226#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:59,192 INFO L273 TraceCheckUtils]: 26: Hoare triple {10226#(<= main_~i~0 20)} assume !(~i~0 < 100000); {10205#false} is VALID [2018-11-23 11:56:59,192 INFO L273 TraceCheckUtils]: 27: Hoare triple {10205#false} ~i~0 := 0; {10205#false} is VALID [2018-11-23 11:56:59,192 INFO L273 TraceCheckUtils]: 28: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,192 INFO L273 TraceCheckUtils]: 29: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,192 INFO L273 TraceCheckUtils]: 30: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,193 INFO L273 TraceCheckUtils]: 31: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,193 INFO L273 TraceCheckUtils]: 32: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,193 INFO L273 TraceCheckUtils]: 33: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,193 INFO L273 TraceCheckUtils]: 34: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,193 INFO L273 TraceCheckUtils]: 35: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,194 INFO L273 TraceCheckUtils]: 36: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,194 INFO L273 TraceCheckUtils]: 37: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,194 INFO L273 TraceCheckUtils]: 38: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,194 INFO L273 TraceCheckUtils]: 39: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,194 INFO L273 TraceCheckUtils]: 40: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,195 INFO L273 TraceCheckUtils]: 41: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,195 INFO L273 TraceCheckUtils]: 42: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,195 INFO L273 TraceCheckUtils]: 43: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,195 INFO L273 TraceCheckUtils]: 44: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,195 INFO L273 TraceCheckUtils]: 45: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,196 INFO L273 TraceCheckUtils]: 46: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,196 INFO L273 TraceCheckUtils]: 47: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,196 INFO L273 TraceCheckUtils]: 48: Hoare triple {10205#false} assume !(~i~0 < 100000); {10205#false} is VALID [2018-11-23 11:56:59,196 INFO L273 TraceCheckUtils]: 49: Hoare triple {10205#false} ~i~0 := 0; {10205#false} is VALID [2018-11-23 11:56:59,196 INFO L273 TraceCheckUtils]: 50: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,196 INFO L273 TraceCheckUtils]: 51: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,197 INFO L273 TraceCheckUtils]: 52: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,197 INFO L273 TraceCheckUtils]: 53: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,197 INFO L273 TraceCheckUtils]: 54: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,197 INFO L273 TraceCheckUtils]: 55: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,197 INFO L273 TraceCheckUtils]: 56: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,197 INFO L273 TraceCheckUtils]: 57: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,197 INFO L273 TraceCheckUtils]: 58: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,197 INFO L273 TraceCheckUtils]: 59: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,197 INFO L273 TraceCheckUtils]: 60: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,198 INFO L273 TraceCheckUtils]: 61: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,198 INFO L273 TraceCheckUtils]: 62: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,198 INFO L273 TraceCheckUtils]: 63: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,198 INFO L273 TraceCheckUtils]: 64: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,198 INFO L273 TraceCheckUtils]: 65: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,198 INFO L273 TraceCheckUtils]: 66: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,198 INFO L273 TraceCheckUtils]: 67: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,198 INFO L273 TraceCheckUtils]: 68: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,199 INFO L273 TraceCheckUtils]: 69: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,199 INFO L273 TraceCheckUtils]: 70: Hoare triple {10205#false} assume !(~i~0 < 100000); {10205#false} is VALID [2018-11-23 11:56:59,199 INFO L273 TraceCheckUtils]: 71: Hoare triple {10205#false} havoc ~x~0;~x~0 := 0; {10205#false} is VALID [2018-11-23 11:56:59,199 INFO L273 TraceCheckUtils]: 72: Hoare triple {10205#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10205#false} is VALID [2018-11-23 11:56:59,199 INFO L256 TraceCheckUtils]: 73: Hoare triple {10205#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {10205#false} is VALID [2018-11-23 11:56:59,199 INFO L273 TraceCheckUtils]: 74: Hoare triple {10205#false} ~cond := #in~cond; {10205#false} is VALID [2018-11-23 11:56:59,199 INFO L273 TraceCheckUtils]: 75: Hoare triple {10205#false} assume 0 == ~cond; {10205#false} is VALID [2018-11-23 11:56:59,199 INFO L273 TraceCheckUtils]: 76: Hoare triple {10205#false} assume !false; {10205#false} is VALID [2018-11-23 11:56:59,202 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-23 11:56:59,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:59,202 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:59,211 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:56:59,259 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:56:59,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:59,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:59,433 INFO L256 TraceCheckUtils]: 0: Hoare triple {10204#true} call ULTIMATE.init(); {10204#true} is VALID [2018-11-23 11:56:59,434 INFO L273 TraceCheckUtils]: 1: Hoare triple {10204#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10204#true} is VALID [2018-11-23 11:56:59,434 INFO L273 TraceCheckUtils]: 2: Hoare triple {10204#true} assume true; {10204#true} is VALID [2018-11-23 11:56:59,434 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10204#true} {10204#true} #74#return; {10204#true} is VALID [2018-11-23 11:56:59,434 INFO L256 TraceCheckUtils]: 4: Hoare triple {10204#true} call #t~ret2 := main(); {10204#true} is VALID [2018-11-23 11:56:59,435 INFO L273 TraceCheckUtils]: 5: Hoare triple {10204#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10245#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:59,436 INFO L273 TraceCheckUtils]: 6: Hoare triple {10245#(<= 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; {10207#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:59,437 INFO L273 TraceCheckUtils]: 7: Hoare triple {10207#(<= 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; {10208#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:59,437 INFO L273 TraceCheckUtils]: 8: Hoare triple {10208#(<= 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; {10209#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:59,438 INFO L273 TraceCheckUtils]: 9: Hoare triple {10209#(<= 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; {10210#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:59,438 INFO L273 TraceCheckUtils]: 10: Hoare triple {10210#(<= 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; {10211#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:59,439 INFO L273 TraceCheckUtils]: 11: Hoare triple {10211#(<= 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; {10212#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:59,440 INFO L273 TraceCheckUtils]: 12: Hoare triple {10212#(<= 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; {10213#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:59,441 INFO L273 TraceCheckUtils]: 13: Hoare triple {10213#(<= 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; {10214#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:59,442 INFO L273 TraceCheckUtils]: 14: Hoare triple {10214#(<= 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; {10215#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:59,443 INFO L273 TraceCheckUtils]: 15: Hoare triple {10215#(<= 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; {10216#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:59,444 INFO L273 TraceCheckUtils]: 16: Hoare triple {10216#(<= 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; {10217#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:59,445 INFO L273 TraceCheckUtils]: 17: Hoare triple {10217#(<= 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; {10218#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:59,446 INFO L273 TraceCheckUtils]: 18: Hoare triple {10218#(<= 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; {10219#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:59,446 INFO L273 TraceCheckUtils]: 19: Hoare triple {10219#(<= 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; {10220#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:59,447 INFO L273 TraceCheckUtils]: 20: Hoare triple {10220#(<= 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; {10221#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:59,448 INFO L273 TraceCheckUtils]: 21: Hoare triple {10221#(<= 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; {10222#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:59,449 INFO L273 TraceCheckUtils]: 22: Hoare triple {10222#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10223#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:59,450 INFO L273 TraceCheckUtils]: 23: Hoare triple {10223#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10224#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:59,451 INFO L273 TraceCheckUtils]: 24: Hoare triple {10224#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10225#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:59,452 INFO L273 TraceCheckUtils]: 25: Hoare triple {10225#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10226#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:59,453 INFO L273 TraceCheckUtils]: 26: Hoare triple {10226#(<= main_~i~0 20)} assume !(~i~0 < 100000); {10205#false} is VALID [2018-11-23 11:56:59,453 INFO L273 TraceCheckUtils]: 27: Hoare triple {10205#false} ~i~0 := 0; {10205#false} is VALID [2018-11-23 11:56:59,453 INFO L273 TraceCheckUtils]: 28: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,453 INFO L273 TraceCheckUtils]: 29: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,454 INFO L273 TraceCheckUtils]: 30: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,454 INFO L273 TraceCheckUtils]: 31: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,454 INFO L273 TraceCheckUtils]: 32: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,454 INFO L273 TraceCheckUtils]: 33: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,454 INFO L273 TraceCheckUtils]: 34: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,455 INFO L273 TraceCheckUtils]: 35: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,455 INFO L273 TraceCheckUtils]: 36: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,455 INFO L273 TraceCheckUtils]: 37: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,455 INFO L273 TraceCheckUtils]: 38: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,455 INFO L273 TraceCheckUtils]: 39: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,456 INFO L273 TraceCheckUtils]: 40: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,456 INFO L273 TraceCheckUtils]: 41: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,456 INFO L273 TraceCheckUtils]: 42: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,456 INFO L273 TraceCheckUtils]: 43: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,456 INFO L273 TraceCheckUtils]: 44: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,457 INFO L273 TraceCheckUtils]: 45: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,457 INFO L273 TraceCheckUtils]: 46: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,457 INFO L273 TraceCheckUtils]: 47: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,457 INFO L273 TraceCheckUtils]: 48: Hoare triple {10205#false} assume !(~i~0 < 100000); {10205#false} is VALID [2018-11-23 11:56:59,457 INFO L273 TraceCheckUtils]: 49: Hoare triple {10205#false} ~i~0 := 0; {10205#false} is VALID [2018-11-23 11:56:59,458 INFO L273 TraceCheckUtils]: 50: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,458 INFO L273 TraceCheckUtils]: 51: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,458 INFO L273 TraceCheckUtils]: 52: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,458 INFO L273 TraceCheckUtils]: 53: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,458 INFO L273 TraceCheckUtils]: 54: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,458 INFO L273 TraceCheckUtils]: 55: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,458 INFO L273 TraceCheckUtils]: 56: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,458 INFO L273 TraceCheckUtils]: 57: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,459 INFO L273 TraceCheckUtils]: 58: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,459 INFO L273 TraceCheckUtils]: 59: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,459 INFO L273 TraceCheckUtils]: 60: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,459 INFO L273 TraceCheckUtils]: 61: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,459 INFO L273 TraceCheckUtils]: 62: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,459 INFO L273 TraceCheckUtils]: 63: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,459 INFO L273 TraceCheckUtils]: 64: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,459 INFO L273 TraceCheckUtils]: 65: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,459 INFO L273 TraceCheckUtils]: 66: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,460 INFO L273 TraceCheckUtils]: 67: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,460 INFO L273 TraceCheckUtils]: 68: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,460 INFO L273 TraceCheckUtils]: 69: Hoare triple {10205#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10205#false} is VALID [2018-11-23 11:56:59,460 INFO L273 TraceCheckUtils]: 70: Hoare triple {10205#false} assume !(~i~0 < 100000); {10205#false} is VALID [2018-11-23 11:56:59,460 INFO L273 TraceCheckUtils]: 71: Hoare triple {10205#false} havoc ~x~0;~x~0 := 0; {10205#false} is VALID [2018-11-23 11:56:59,460 INFO L273 TraceCheckUtils]: 72: Hoare triple {10205#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10205#false} is VALID [2018-11-23 11:56:59,460 INFO L256 TraceCheckUtils]: 73: Hoare triple {10205#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {10205#false} is VALID [2018-11-23 11:56:59,460 INFO L273 TraceCheckUtils]: 74: Hoare triple {10205#false} ~cond := #in~cond; {10205#false} is VALID [2018-11-23 11:56:59,460 INFO L273 TraceCheckUtils]: 75: Hoare triple {10205#false} assume 0 == ~cond; {10205#false} is VALID [2018-11-23 11:56:59,461 INFO L273 TraceCheckUtils]: 76: Hoare triple {10205#false} assume !false; {10205#false} is VALID [2018-11-23 11:56:59,463 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-23 11:56:59,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:59,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 11:56:59,485 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 77 [2018-11-23 11:56:59,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:59,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:56:59,516 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:59,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:56:59,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:56:59,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:56:59,517 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 24 states. [2018-11-23 11:57:00,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:00,707 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-11-23 11:57:00,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 11:57:00,708 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 77 [2018-11-23 11:57:00,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:00,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:57:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 108 transitions. [2018-11-23 11:57:00,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:57:00,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 108 transitions. [2018-11-23 11:57:00,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 108 transitions. [2018-11-23 11:57:00,824 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:00,826 INFO L225 Difference]: With dead ends: 140 [2018-11-23 11:57:00,826 INFO L226 Difference]: Without dead ends: 85 [2018-11-23 11:57:00,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:57:00,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-23 11:57:00,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-11-23 11:57:00,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:00,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 85 states. [2018-11-23 11:57:00,888 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 85 states. [2018-11-23 11:57:00,888 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 85 states. [2018-11-23 11:57:00,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:00,889 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-11-23 11:57:00,889 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2018-11-23 11:57:00,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:00,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:00,889 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 85 states. [2018-11-23 11:57:00,889 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 85 states. [2018-11-23 11:57:00,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:00,891 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-11-23 11:57:00,891 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2018-11-23 11:57:00,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:00,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:00,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:00,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:00,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 11:57:00,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2018-11-23 11:57:00,893 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 77 [2018-11-23 11:57:00,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:00,893 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2018-11-23 11:57:00,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 11:57:00,893 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2018-11-23 11:57:00,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 11:57:00,894 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:00,894 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:00,894 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:00,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:00,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1924341697, now seen corresponding path program 21 times [2018-11-23 11:57:00,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:00,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:00,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:00,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:00,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:01,298 INFO L256 TraceCheckUtils]: 0: Hoare triple {11044#true} call ULTIMATE.init(); {11044#true} is VALID [2018-11-23 11:57:01,298 INFO L273 TraceCheckUtils]: 1: Hoare triple {11044#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11044#true} is VALID [2018-11-23 11:57:01,299 INFO L273 TraceCheckUtils]: 2: Hoare triple {11044#true} assume true; {11044#true} is VALID [2018-11-23 11:57:01,299 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11044#true} {11044#true} #74#return; {11044#true} is VALID [2018-11-23 11:57:01,299 INFO L256 TraceCheckUtils]: 4: Hoare triple {11044#true} call #t~ret2 := main(); {11044#true} is VALID [2018-11-23 11:57:01,299 INFO L273 TraceCheckUtils]: 5: Hoare triple {11044#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11046#(= main_~i~0 0)} is VALID [2018-11-23 11:57:01,300 INFO L273 TraceCheckUtils]: 6: Hoare triple {11046#(= 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; {11047#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:01,301 INFO L273 TraceCheckUtils]: 7: Hoare triple {11047#(<= 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; {11048#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:01,302 INFO L273 TraceCheckUtils]: 8: Hoare triple {11048#(<= 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; {11049#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:01,302 INFO L273 TraceCheckUtils]: 9: Hoare triple {11049#(<= 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; {11050#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:01,303 INFO L273 TraceCheckUtils]: 10: Hoare triple {11050#(<= 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; {11051#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:01,304 INFO L273 TraceCheckUtils]: 11: Hoare triple {11051#(<= 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; {11052#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:01,305 INFO L273 TraceCheckUtils]: 12: Hoare triple {11052#(<= 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; {11053#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:01,305 INFO L273 TraceCheckUtils]: 13: Hoare triple {11053#(<= 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; {11054#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:01,306 INFO L273 TraceCheckUtils]: 14: Hoare triple {11054#(<= 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; {11055#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:01,307 INFO L273 TraceCheckUtils]: 15: Hoare triple {11055#(<= 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; {11056#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:01,308 INFO L273 TraceCheckUtils]: 16: Hoare triple {11056#(<= 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; {11057#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:01,309 INFO L273 TraceCheckUtils]: 17: Hoare triple {11057#(<= 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; {11058#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:01,310 INFO L273 TraceCheckUtils]: 18: Hoare triple {11058#(<= 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; {11059#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:01,311 INFO L273 TraceCheckUtils]: 19: Hoare triple {11059#(<= 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; {11060#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:01,312 INFO L273 TraceCheckUtils]: 20: Hoare triple {11060#(<= 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; {11061#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:01,313 INFO L273 TraceCheckUtils]: 21: Hoare triple {11061#(<= 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; {11062#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:01,314 INFO L273 TraceCheckUtils]: 22: Hoare triple {11062#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11063#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:01,315 INFO L273 TraceCheckUtils]: 23: Hoare triple {11063#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11064#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:01,316 INFO L273 TraceCheckUtils]: 24: Hoare triple {11064#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11065#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:01,317 INFO L273 TraceCheckUtils]: 25: Hoare triple {11065#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11066#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:01,318 INFO L273 TraceCheckUtils]: 26: Hoare triple {11066#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11067#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:01,319 INFO L273 TraceCheckUtils]: 27: Hoare triple {11067#(<= main_~i~0 21)} assume !(~i~0 < 100000); {11045#false} is VALID [2018-11-23 11:57:01,319 INFO L273 TraceCheckUtils]: 28: Hoare triple {11045#false} ~i~0 := 0; {11045#false} is VALID [2018-11-23 11:57:01,319 INFO L273 TraceCheckUtils]: 29: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,319 INFO L273 TraceCheckUtils]: 30: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,320 INFO L273 TraceCheckUtils]: 31: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,320 INFO L273 TraceCheckUtils]: 32: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,320 INFO L273 TraceCheckUtils]: 33: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,320 INFO L273 TraceCheckUtils]: 34: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,321 INFO L273 TraceCheckUtils]: 35: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,321 INFO L273 TraceCheckUtils]: 36: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,321 INFO L273 TraceCheckUtils]: 37: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,322 INFO L273 TraceCheckUtils]: 38: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,322 INFO L273 TraceCheckUtils]: 39: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,322 INFO L273 TraceCheckUtils]: 40: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,322 INFO L273 TraceCheckUtils]: 41: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,323 INFO L273 TraceCheckUtils]: 42: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,323 INFO L273 TraceCheckUtils]: 43: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,323 INFO L273 TraceCheckUtils]: 44: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,323 INFO L273 TraceCheckUtils]: 45: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,323 INFO L273 TraceCheckUtils]: 46: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,323 INFO L273 TraceCheckUtils]: 47: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,324 INFO L273 TraceCheckUtils]: 48: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,324 INFO L273 TraceCheckUtils]: 49: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,324 INFO L273 TraceCheckUtils]: 50: Hoare triple {11045#false} assume !(~i~0 < 100000); {11045#false} is VALID [2018-11-23 11:57:01,324 INFO L273 TraceCheckUtils]: 51: Hoare triple {11045#false} ~i~0 := 0; {11045#false} is VALID [2018-11-23 11:57:01,324 INFO L273 TraceCheckUtils]: 52: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,324 INFO L273 TraceCheckUtils]: 53: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,325 INFO L273 TraceCheckUtils]: 54: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,325 INFO L273 TraceCheckUtils]: 55: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,325 INFO L273 TraceCheckUtils]: 56: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,325 INFO L273 TraceCheckUtils]: 57: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,325 INFO L273 TraceCheckUtils]: 58: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,325 INFO L273 TraceCheckUtils]: 59: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,326 INFO L273 TraceCheckUtils]: 60: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,326 INFO L273 TraceCheckUtils]: 61: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,326 INFO L273 TraceCheckUtils]: 62: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,326 INFO L273 TraceCheckUtils]: 63: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,326 INFO L273 TraceCheckUtils]: 64: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,326 INFO L273 TraceCheckUtils]: 65: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,327 INFO L273 TraceCheckUtils]: 66: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,327 INFO L273 TraceCheckUtils]: 67: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,327 INFO L273 TraceCheckUtils]: 68: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,327 INFO L273 TraceCheckUtils]: 69: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,327 INFO L273 TraceCheckUtils]: 70: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,327 INFO L273 TraceCheckUtils]: 71: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,327 INFO L273 TraceCheckUtils]: 72: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:01,328 INFO L273 TraceCheckUtils]: 73: Hoare triple {11045#false} assume !(~i~0 < 100000); {11045#false} is VALID [2018-11-23 11:57:01,328 INFO L273 TraceCheckUtils]: 74: Hoare triple {11045#false} havoc ~x~0;~x~0 := 0; {11045#false} is VALID [2018-11-23 11:57:01,328 INFO L273 TraceCheckUtils]: 75: Hoare triple {11045#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11045#false} is VALID [2018-11-23 11:57:01,328 INFO L256 TraceCheckUtils]: 76: Hoare triple {11045#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {11045#false} is VALID [2018-11-23 11:57:01,328 INFO L273 TraceCheckUtils]: 77: Hoare triple {11045#false} ~cond := #in~cond; {11045#false} is VALID [2018-11-23 11:57:01,328 INFO L273 TraceCheckUtils]: 78: Hoare triple {11045#false} assume 0 == ~cond; {11045#false} is VALID [2018-11-23 11:57:01,329 INFO L273 TraceCheckUtils]: 79: Hoare triple {11045#false} assume !false; {11045#false} is VALID [2018-11-23 11:57:01,333 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2018-11-23 11:57:01,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:01,333 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:01,342 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:57:20,644 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-23 11:57:20,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:20,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:20,914 INFO L256 TraceCheckUtils]: 0: Hoare triple {11044#true} call ULTIMATE.init(); {11044#true} is VALID [2018-11-23 11:57:20,915 INFO L273 TraceCheckUtils]: 1: Hoare triple {11044#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11044#true} is VALID [2018-11-23 11:57:20,915 INFO L273 TraceCheckUtils]: 2: Hoare triple {11044#true} assume true; {11044#true} is VALID [2018-11-23 11:57:20,915 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11044#true} {11044#true} #74#return; {11044#true} is VALID [2018-11-23 11:57:20,915 INFO L256 TraceCheckUtils]: 4: Hoare triple {11044#true} call #t~ret2 := main(); {11044#true} is VALID [2018-11-23 11:57:20,916 INFO L273 TraceCheckUtils]: 5: Hoare triple {11044#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11086#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:20,916 INFO L273 TraceCheckUtils]: 6: Hoare triple {11086#(<= 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; {11047#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:20,917 INFO L273 TraceCheckUtils]: 7: Hoare triple {11047#(<= 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; {11048#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:20,917 INFO L273 TraceCheckUtils]: 8: Hoare triple {11048#(<= 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; {11049#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:20,918 INFO L273 TraceCheckUtils]: 9: Hoare triple {11049#(<= 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; {11050#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:20,918 INFO L273 TraceCheckUtils]: 10: Hoare triple {11050#(<= 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; {11051#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:20,919 INFO L273 TraceCheckUtils]: 11: Hoare triple {11051#(<= 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; {11052#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:20,920 INFO L273 TraceCheckUtils]: 12: Hoare triple {11052#(<= 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; {11053#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:20,921 INFO L273 TraceCheckUtils]: 13: Hoare triple {11053#(<= 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; {11054#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:20,921 INFO L273 TraceCheckUtils]: 14: Hoare triple {11054#(<= 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; {11055#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:20,922 INFO L273 TraceCheckUtils]: 15: Hoare triple {11055#(<= 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; {11056#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:20,923 INFO L273 TraceCheckUtils]: 16: Hoare triple {11056#(<= 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; {11057#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:20,924 INFO L273 TraceCheckUtils]: 17: Hoare triple {11057#(<= 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; {11058#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:20,925 INFO L273 TraceCheckUtils]: 18: Hoare triple {11058#(<= 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; {11059#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:20,926 INFO L273 TraceCheckUtils]: 19: Hoare triple {11059#(<= 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; {11060#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:20,927 INFO L273 TraceCheckUtils]: 20: Hoare triple {11060#(<= 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; {11061#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:20,928 INFO L273 TraceCheckUtils]: 21: Hoare triple {11061#(<= 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; {11062#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:20,929 INFO L273 TraceCheckUtils]: 22: Hoare triple {11062#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11063#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:20,930 INFO L273 TraceCheckUtils]: 23: Hoare triple {11063#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11064#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:20,931 INFO L273 TraceCheckUtils]: 24: Hoare triple {11064#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11065#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:20,932 INFO L273 TraceCheckUtils]: 25: Hoare triple {11065#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11066#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:20,933 INFO L273 TraceCheckUtils]: 26: Hoare triple {11066#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11067#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:20,933 INFO L273 TraceCheckUtils]: 27: Hoare triple {11067#(<= main_~i~0 21)} assume !(~i~0 < 100000); {11045#false} is VALID [2018-11-23 11:57:20,934 INFO L273 TraceCheckUtils]: 28: Hoare triple {11045#false} ~i~0 := 0; {11045#false} is VALID [2018-11-23 11:57:20,934 INFO L273 TraceCheckUtils]: 29: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,934 INFO L273 TraceCheckUtils]: 30: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,934 INFO L273 TraceCheckUtils]: 31: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,934 INFO L273 TraceCheckUtils]: 32: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,935 INFO L273 TraceCheckUtils]: 33: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,935 INFO L273 TraceCheckUtils]: 34: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,935 INFO L273 TraceCheckUtils]: 35: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,935 INFO L273 TraceCheckUtils]: 36: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,935 INFO L273 TraceCheckUtils]: 37: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,935 INFO L273 TraceCheckUtils]: 38: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,936 INFO L273 TraceCheckUtils]: 39: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,936 INFO L273 TraceCheckUtils]: 40: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,936 INFO L273 TraceCheckUtils]: 41: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,936 INFO L273 TraceCheckUtils]: 42: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,936 INFO L273 TraceCheckUtils]: 43: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,936 INFO L273 TraceCheckUtils]: 44: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,936 INFO L273 TraceCheckUtils]: 45: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,936 INFO L273 TraceCheckUtils]: 46: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,936 INFO L273 TraceCheckUtils]: 47: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,937 INFO L273 TraceCheckUtils]: 48: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,937 INFO L273 TraceCheckUtils]: 49: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,937 INFO L273 TraceCheckUtils]: 50: Hoare triple {11045#false} assume !(~i~0 < 100000); {11045#false} is VALID [2018-11-23 11:57:20,937 INFO L273 TraceCheckUtils]: 51: Hoare triple {11045#false} ~i~0 := 0; {11045#false} is VALID [2018-11-23 11:57:20,937 INFO L273 TraceCheckUtils]: 52: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,937 INFO L273 TraceCheckUtils]: 53: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,937 INFO L273 TraceCheckUtils]: 54: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,937 INFO L273 TraceCheckUtils]: 55: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,938 INFO L273 TraceCheckUtils]: 56: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,938 INFO L273 TraceCheckUtils]: 57: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,938 INFO L273 TraceCheckUtils]: 58: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,938 INFO L273 TraceCheckUtils]: 59: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,938 INFO L273 TraceCheckUtils]: 60: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,938 INFO L273 TraceCheckUtils]: 61: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,938 INFO L273 TraceCheckUtils]: 62: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,938 INFO L273 TraceCheckUtils]: 63: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,938 INFO L273 TraceCheckUtils]: 64: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,939 INFO L273 TraceCheckUtils]: 65: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,939 INFO L273 TraceCheckUtils]: 66: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,939 INFO L273 TraceCheckUtils]: 67: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,939 INFO L273 TraceCheckUtils]: 68: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,939 INFO L273 TraceCheckUtils]: 69: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,939 INFO L273 TraceCheckUtils]: 70: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,939 INFO L273 TraceCheckUtils]: 71: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,939 INFO L273 TraceCheckUtils]: 72: Hoare triple {11045#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11045#false} is VALID [2018-11-23 11:57:20,939 INFO L273 TraceCheckUtils]: 73: Hoare triple {11045#false} assume !(~i~0 < 100000); {11045#false} is VALID [2018-11-23 11:57:20,940 INFO L273 TraceCheckUtils]: 74: Hoare triple {11045#false} havoc ~x~0;~x~0 := 0; {11045#false} is VALID [2018-11-23 11:57:20,940 INFO L273 TraceCheckUtils]: 75: Hoare triple {11045#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11045#false} is VALID [2018-11-23 11:57:20,940 INFO L256 TraceCheckUtils]: 76: Hoare triple {11045#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {11045#false} is VALID [2018-11-23 11:57:20,940 INFO L273 TraceCheckUtils]: 77: Hoare triple {11045#false} ~cond := #in~cond; {11045#false} is VALID [2018-11-23 11:57:20,940 INFO L273 TraceCheckUtils]: 78: Hoare triple {11045#false} assume 0 == ~cond; {11045#false} is VALID [2018-11-23 11:57:20,940 INFO L273 TraceCheckUtils]: 79: Hoare triple {11045#false} assume !false; {11045#false} is VALID [2018-11-23 11:57:20,943 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2018-11-23 11:57:20,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:20,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 11:57:20,969 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 80 [2018-11-23 11:57:20,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:20,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 11:57:21,007 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:21,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 11:57:21,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 11:57:21,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:57:21,009 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand 25 states. [2018-11-23 11:57:21,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:21,725 INFO L93 Difference]: Finished difference Result 145 states and 153 transitions. [2018-11-23 11:57:21,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 11:57:21,725 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 80 [2018-11-23 11:57:21,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:21,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:57:21,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 111 transitions. [2018-11-23 11:57:21,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:57:21,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 111 transitions. [2018-11-23 11:57:21,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 111 transitions. [2018-11-23 11:57:21,843 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:21,845 INFO L225 Difference]: With dead ends: 145 [2018-11-23 11:57:21,845 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 11:57:21,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:57:21,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 11:57:22,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-11-23 11:57:22,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:22,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 88 states. [2018-11-23 11:57:22,054 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2018-11-23 11:57:22,055 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2018-11-23 11:57:22,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:22,057 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2018-11-23 11:57:22,057 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2018-11-23 11:57:22,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:22,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:22,058 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2018-11-23 11:57:22,058 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2018-11-23 11:57:22,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:22,060 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2018-11-23 11:57:22,060 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2018-11-23 11:57:22,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:22,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:22,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:22,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:22,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 11:57:22,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2018-11-23 11:57:22,062 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 80 [2018-11-23 11:57:22,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:22,063 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2018-11-23 11:57:22,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 11:57:22,063 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2018-11-23 11:57:22,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 11:57:22,064 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:22,064 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:22,064 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:22,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:22,064 INFO L82 PathProgramCache]: Analyzing trace with hash 473114, now seen corresponding path program 22 times [2018-11-23 11:57:22,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:22,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:22,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:22,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:22,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:23,055 INFO L256 TraceCheckUtils]: 0: Hoare triple {11916#true} call ULTIMATE.init(); {11916#true} is VALID [2018-11-23 11:57:23,055 INFO L273 TraceCheckUtils]: 1: Hoare triple {11916#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11916#true} is VALID [2018-11-23 11:57:23,055 INFO L273 TraceCheckUtils]: 2: Hoare triple {11916#true} assume true; {11916#true} is VALID [2018-11-23 11:57:23,055 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11916#true} {11916#true} #74#return; {11916#true} is VALID [2018-11-23 11:57:23,055 INFO L256 TraceCheckUtils]: 4: Hoare triple {11916#true} call #t~ret2 := main(); {11916#true} is VALID [2018-11-23 11:57:23,056 INFO L273 TraceCheckUtils]: 5: Hoare triple {11916#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11918#(= main_~i~0 0)} is VALID [2018-11-23 11:57:23,056 INFO L273 TraceCheckUtils]: 6: Hoare triple {11918#(= 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; {11919#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:23,057 INFO L273 TraceCheckUtils]: 7: Hoare triple {11919#(<= 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; {11920#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:23,058 INFO L273 TraceCheckUtils]: 8: Hoare triple {11920#(<= 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; {11921#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:23,058 INFO L273 TraceCheckUtils]: 9: Hoare triple {11921#(<= 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; {11922#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:23,059 INFO L273 TraceCheckUtils]: 10: Hoare triple {11922#(<= 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; {11923#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:23,059 INFO L273 TraceCheckUtils]: 11: Hoare triple {11923#(<= 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; {11924#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:23,060 INFO L273 TraceCheckUtils]: 12: Hoare triple {11924#(<= 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; {11925#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:23,061 INFO L273 TraceCheckUtils]: 13: Hoare triple {11925#(<= 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; {11926#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:23,062 INFO L273 TraceCheckUtils]: 14: Hoare triple {11926#(<= 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; {11927#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:23,063 INFO L273 TraceCheckUtils]: 15: Hoare triple {11927#(<= 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; {11928#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:23,064 INFO L273 TraceCheckUtils]: 16: Hoare triple {11928#(<= 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; {11929#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:23,065 INFO L273 TraceCheckUtils]: 17: Hoare triple {11929#(<= 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; {11930#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:23,066 INFO L273 TraceCheckUtils]: 18: Hoare triple {11930#(<= 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; {11931#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:23,067 INFO L273 TraceCheckUtils]: 19: Hoare triple {11931#(<= 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; {11932#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:23,068 INFO L273 TraceCheckUtils]: 20: Hoare triple {11932#(<= 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; {11933#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:23,069 INFO L273 TraceCheckUtils]: 21: Hoare triple {11933#(<= 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; {11934#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:23,070 INFO L273 TraceCheckUtils]: 22: Hoare triple {11934#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11935#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:23,071 INFO L273 TraceCheckUtils]: 23: Hoare triple {11935#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11936#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:23,072 INFO L273 TraceCheckUtils]: 24: Hoare triple {11936#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11937#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:23,072 INFO L273 TraceCheckUtils]: 25: Hoare triple {11937#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11938#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:23,073 INFO L273 TraceCheckUtils]: 26: Hoare triple {11938#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11939#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:23,074 INFO L273 TraceCheckUtils]: 27: Hoare triple {11939#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11940#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:23,075 INFO L273 TraceCheckUtils]: 28: Hoare triple {11940#(<= main_~i~0 22)} assume !(~i~0 < 100000); {11917#false} is VALID [2018-11-23 11:57:23,075 INFO L273 TraceCheckUtils]: 29: Hoare triple {11917#false} ~i~0 := 0; {11917#false} is VALID [2018-11-23 11:57:23,075 INFO L273 TraceCheckUtils]: 30: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,076 INFO L273 TraceCheckUtils]: 31: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,076 INFO L273 TraceCheckUtils]: 32: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,076 INFO L273 TraceCheckUtils]: 33: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,076 INFO L273 TraceCheckUtils]: 34: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,077 INFO L273 TraceCheckUtils]: 35: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,077 INFO L273 TraceCheckUtils]: 36: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,077 INFO L273 TraceCheckUtils]: 37: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,077 INFO L273 TraceCheckUtils]: 38: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,077 INFO L273 TraceCheckUtils]: 39: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,078 INFO L273 TraceCheckUtils]: 40: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,078 INFO L273 TraceCheckUtils]: 41: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,078 INFO L273 TraceCheckUtils]: 42: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,078 INFO L273 TraceCheckUtils]: 43: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,078 INFO L273 TraceCheckUtils]: 44: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,079 INFO L273 TraceCheckUtils]: 45: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,079 INFO L273 TraceCheckUtils]: 46: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,079 INFO L273 TraceCheckUtils]: 47: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,079 INFO L273 TraceCheckUtils]: 48: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,079 INFO L273 TraceCheckUtils]: 49: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,080 INFO L273 TraceCheckUtils]: 50: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,080 INFO L273 TraceCheckUtils]: 51: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,080 INFO L273 TraceCheckUtils]: 52: Hoare triple {11917#false} assume !(~i~0 < 100000); {11917#false} is VALID [2018-11-23 11:57:23,080 INFO L273 TraceCheckUtils]: 53: Hoare triple {11917#false} ~i~0 := 0; {11917#false} is VALID [2018-11-23 11:57:23,080 INFO L273 TraceCheckUtils]: 54: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,080 INFO L273 TraceCheckUtils]: 55: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,080 INFO L273 TraceCheckUtils]: 56: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,080 INFO L273 TraceCheckUtils]: 57: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,080 INFO L273 TraceCheckUtils]: 58: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,081 INFO L273 TraceCheckUtils]: 59: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,081 INFO L273 TraceCheckUtils]: 60: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,081 INFO L273 TraceCheckUtils]: 61: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,081 INFO L273 TraceCheckUtils]: 62: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,081 INFO L273 TraceCheckUtils]: 63: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,081 INFO L273 TraceCheckUtils]: 64: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,081 INFO L273 TraceCheckUtils]: 65: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,081 INFO L273 TraceCheckUtils]: 66: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,081 INFO L273 TraceCheckUtils]: 67: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,082 INFO L273 TraceCheckUtils]: 68: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,082 INFO L273 TraceCheckUtils]: 69: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,101 INFO L273 TraceCheckUtils]: 70: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,101 INFO L273 TraceCheckUtils]: 71: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,101 INFO L273 TraceCheckUtils]: 72: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,101 INFO L273 TraceCheckUtils]: 73: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,102 INFO L273 TraceCheckUtils]: 74: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,102 INFO L273 TraceCheckUtils]: 75: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,102 INFO L273 TraceCheckUtils]: 76: Hoare triple {11917#false} assume !(~i~0 < 100000); {11917#false} is VALID [2018-11-23 11:57:23,102 INFO L273 TraceCheckUtils]: 77: Hoare triple {11917#false} havoc ~x~0;~x~0 := 0; {11917#false} is VALID [2018-11-23 11:57:23,102 INFO L273 TraceCheckUtils]: 78: Hoare triple {11917#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11917#false} is VALID [2018-11-23 11:57:23,102 INFO L256 TraceCheckUtils]: 79: Hoare triple {11917#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {11917#false} is VALID [2018-11-23 11:57:23,103 INFO L273 TraceCheckUtils]: 80: Hoare triple {11917#false} ~cond := #in~cond; {11917#false} is VALID [2018-11-23 11:57:23,103 INFO L273 TraceCheckUtils]: 81: Hoare triple {11917#false} assume 0 == ~cond; {11917#false} is VALID [2018-11-23 11:57:23,103 INFO L273 TraceCheckUtils]: 82: Hoare triple {11917#false} assume !false; {11917#false} is VALID [2018-11-23 11:57:23,106 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-11-23 11:57:23,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:23,107 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:23,115 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:57:23,171 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:57:23,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:23,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:23,390 INFO L256 TraceCheckUtils]: 0: Hoare triple {11916#true} call ULTIMATE.init(); {11916#true} is VALID [2018-11-23 11:57:23,391 INFO L273 TraceCheckUtils]: 1: Hoare triple {11916#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11916#true} is VALID [2018-11-23 11:57:23,391 INFO L273 TraceCheckUtils]: 2: Hoare triple {11916#true} assume true; {11916#true} is VALID [2018-11-23 11:57:23,391 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11916#true} {11916#true} #74#return; {11916#true} is VALID [2018-11-23 11:57:23,391 INFO L256 TraceCheckUtils]: 4: Hoare triple {11916#true} call #t~ret2 := main(); {11916#true} is VALID [2018-11-23 11:57:23,392 INFO L273 TraceCheckUtils]: 5: Hoare triple {11916#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11959#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:23,393 INFO L273 TraceCheckUtils]: 6: Hoare triple {11959#(<= 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; {11919#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:23,394 INFO L273 TraceCheckUtils]: 7: Hoare triple {11919#(<= 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; {11920#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:23,394 INFO L273 TraceCheckUtils]: 8: Hoare triple {11920#(<= 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; {11921#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:23,395 INFO L273 TraceCheckUtils]: 9: Hoare triple {11921#(<= 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; {11922#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:23,395 INFO L273 TraceCheckUtils]: 10: Hoare triple {11922#(<= 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; {11923#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:23,396 INFO L273 TraceCheckUtils]: 11: Hoare triple {11923#(<= 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; {11924#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:23,397 INFO L273 TraceCheckUtils]: 12: Hoare triple {11924#(<= 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; {11925#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:23,398 INFO L273 TraceCheckUtils]: 13: Hoare triple {11925#(<= 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; {11926#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:23,399 INFO L273 TraceCheckUtils]: 14: Hoare triple {11926#(<= 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; {11927#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:23,400 INFO L273 TraceCheckUtils]: 15: Hoare triple {11927#(<= 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; {11928#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:23,401 INFO L273 TraceCheckUtils]: 16: Hoare triple {11928#(<= 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; {11929#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:23,402 INFO L273 TraceCheckUtils]: 17: Hoare triple {11929#(<= 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; {11930#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:23,403 INFO L273 TraceCheckUtils]: 18: Hoare triple {11930#(<= 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; {11931#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:23,404 INFO L273 TraceCheckUtils]: 19: Hoare triple {11931#(<= 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; {11932#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:23,405 INFO L273 TraceCheckUtils]: 20: Hoare triple {11932#(<= 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; {11933#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:23,406 INFO L273 TraceCheckUtils]: 21: Hoare triple {11933#(<= 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; {11934#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:23,407 INFO L273 TraceCheckUtils]: 22: Hoare triple {11934#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11935#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:23,408 INFO L273 TraceCheckUtils]: 23: Hoare triple {11935#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11936#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:23,409 INFO L273 TraceCheckUtils]: 24: Hoare triple {11936#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11937#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:23,410 INFO L273 TraceCheckUtils]: 25: Hoare triple {11937#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11938#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:23,410 INFO L273 TraceCheckUtils]: 26: Hoare triple {11938#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11939#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:23,411 INFO L273 TraceCheckUtils]: 27: Hoare triple {11939#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11940#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:23,412 INFO L273 TraceCheckUtils]: 28: Hoare triple {11940#(<= main_~i~0 22)} assume !(~i~0 < 100000); {11917#false} is VALID [2018-11-23 11:57:23,412 INFO L273 TraceCheckUtils]: 29: Hoare triple {11917#false} ~i~0 := 0; {11917#false} is VALID [2018-11-23 11:57:23,413 INFO L273 TraceCheckUtils]: 30: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,413 INFO L273 TraceCheckUtils]: 31: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,413 INFO L273 TraceCheckUtils]: 32: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,413 INFO L273 TraceCheckUtils]: 33: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,413 INFO L273 TraceCheckUtils]: 34: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,414 INFO L273 TraceCheckUtils]: 35: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,414 INFO L273 TraceCheckUtils]: 36: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,414 INFO L273 TraceCheckUtils]: 37: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,414 INFO L273 TraceCheckUtils]: 38: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,414 INFO L273 TraceCheckUtils]: 39: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,415 INFO L273 TraceCheckUtils]: 40: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,415 INFO L273 TraceCheckUtils]: 41: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,415 INFO L273 TraceCheckUtils]: 42: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,415 INFO L273 TraceCheckUtils]: 43: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,415 INFO L273 TraceCheckUtils]: 44: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,416 INFO L273 TraceCheckUtils]: 45: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,416 INFO L273 TraceCheckUtils]: 46: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,416 INFO L273 TraceCheckUtils]: 47: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,416 INFO L273 TraceCheckUtils]: 48: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,416 INFO L273 TraceCheckUtils]: 49: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,417 INFO L273 TraceCheckUtils]: 50: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,417 INFO L273 TraceCheckUtils]: 51: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,417 INFO L273 TraceCheckUtils]: 52: Hoare triple {11917#false} assume !(~i~0 < 100000); {11917#false} is VALID [2018-11-23 11:57:23,417 INFO L273 TraceCheckUtils]: 53: Hoare triple {11917#false} ~i~0 := 0; {11917#false} is VALID [2018-11-23 11:57:23,417 INFO L273 TraceCheckUtils]: 54: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,417 INFO L273 TraceCheckUtils]: 55: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,417 INFO L273 TraceCheckUtils]: 56: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,418 INFO L273 TraceCheckUtils]: 57: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,418 INFO L273 TraceCheckUtils]: 58: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,418 INFO L273 TraceCheckUtils]: 59: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,418 INFO L273 TraceCheckUtils]: 60: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,418 INFO L273 TraceCheckUtils]: 61: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,418 INFO L273 TraceCheckUtils]: 62: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,418 INFO L273 TraceCheckUtils]: 63: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,418 INFO L273 TraceCheckUtils]: 64: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,418 INFO L273 TraceCheckUtils]: 65: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,419 INFO L273 TraceCheckUtils]: 66: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,419 INFO L273 TraceCheckUtils]: 67: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,419 INFO L273 TraceCheckUtils]: 68: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,419 INFO L273 TraceCheckUtils]: 69: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,419 INFO L273 TraceCheckUtils]: 70: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,419 INFO L273 TraceCheckUtils]: 71: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,419 INFO L273 TraceCheckUtils]: 72: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,419 INFO L273 TraceCheckUtils]: 73: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,419 INFO L273 TraceCheckUtils]: 74: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,420 INFO L273 TraceCheckUtils]: 75: Hoare triple {11917#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11917#false} is VALID [2018-11-23 11:57:23,420 INFO L273 TraceCheckUtils]: 76: Hoare triple {11917#false} assume !(~i~0 < 100000); {11917#false} is VALID [2018-11-23 11:57:23,420 INFO L273 TraceCheckUtils]: 77: Hoare triple {11917#false} havoc ~x~0;~x~0 := 0; {11917#false} is VALID [2018-11-23 11:57:23,420 INFO L273 TraceCheckUtils]: 78: Hoare triple {11917#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11917#false} is VALID [2018-11-23 11:57:23,420 INFO L256 TraceCheckUtils]: 79: Hoare triple {11917#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {11917#false} is VALID [2018-11-23 11:57:23,420 INFO L273 TraceCheckUtils]: 80: Hoare triple {11917#false} ~cond := #in~cond; {11917#false} is VALID [2018-11-23 11:57:23,420 INFO L273 TraceCheckUtils]: 81: Hoare triple {11917#false} assume 0 == ~cond; {11917#false} is VALID [2018-11-23 11:57:23,420 INFO L273 TraceCheckUtils]: 82: Hoare triple {11917#false} assume !false; {11917#false} is VALID [2018-11-23 11:57:23,424 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-11-23 11:57:23,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:23,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 11:57:23,445 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 83 [2018-11-23 11:57:23,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:23,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 11:57:23,496 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:23,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 11:57:23,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 11:57:23,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:57:23,498 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand 26 states. [2018-11-23 11:57:24,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:24,120 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2018-11-23 11:57:24,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 11:57:24,121 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 83 [2018-11-23 11:57:24,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:24,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:57:24,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 114 transitions. [2018-11-23 11:57:24,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:57:24,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 114 transitions. [2018-11-23 11:57:24,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 114 transitions. [2018-11-23 11:57:24,242 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:24,245 INFO L225 Difference]: With dead ends: 150 [2018-11-23 11:57:24,245 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 11:57:24,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:57:24,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 11:57:24,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-11-23 11:57:24,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:24,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 91 states. [2018-11-23 11:57:24,324 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 91 states. [2018-11-23 11:57:24,324 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 91 states. [2018-11-23 11:57:24,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:24,326 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2018-11-23 11:57:24,326 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2018-11-23 11:57:24,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:24,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:24,327 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 91 states. [2018-11-23 11:57:24,327 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 91 states. [2018-11-23 11:57:24,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:24,328 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2018-11-23 11:57:24,328 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2018-11-23 11:57:24,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:24,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:24,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:24,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:24,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 11:57:24,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2018-11-23 11:57:24,331 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 83 [2018-11-23 11:57:24,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:24,331 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2018-11-23 11:57:24,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 11:57:24,331 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2018-11-23 11:57:24,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 11:57:24,332 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:24,332 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:24,332 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:24,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:24,333 INFO L82 PathProgramCache]: Analyzing trace with hash -874017631, now seen corresponding path program 23 times [2018-11-23 11:57:24,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:24,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:24,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:24,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:24,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:24,962 INFO L256 TraceCheckUtils]: 0: Hoare triple {12820#true} call ULTIMATE.init(); {12820#true} is VALID [2018-11-23 11:57:24,962 INFO L273 TraceCheckUtils]: 1: Hoare triple {12820#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12820#true} is VALID [2018-11-23 11:57:24,962 INFO L273 TraceCheckUtils]: 2: Hoare triple {12820#true} assume true; {12820#true} is VALID [2018-11-23 11:57:24,963 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12820#true} {12820#true} #74#return; {12820#true} is VALID [2018-11-23 11:57:24,963 INFO L256 TraceCheckUtils]: 4: Hoare triple {12820#true} call #t~ret2 := main(); {12820#true} is VALID [2018-11-23 11:57:24,963 INFO L273 TraceCheckUtils]: 5: Hoare triple {12820#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12822#(= main_~i~0 0)} is VALID [2018-11-23 11:57:24,964 INFO L273 TraceCheckUtils]: 6: Hoare triple {12822#(= 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; {12823#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:24,965 INFO L273 TraceCheckUtils]: 7: Hoare triple {12823#(<= 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; {12824#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:24,966 INFO L273 TraceCheckUtils]: 8: Hoare triple {12824#(<= 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; {12825#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:24,967 INFO L273 TraceCheckUtils]: 9: Hoare triple {12825#(<= 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; {12826#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:24,968 INFO L273 TraceCheckUtils]: 10: Hoare triple {12826#(<= 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; {12827#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:24,969 INFO L273 TraceCheckUtils]: 11: Hoare triple {12827#(<= 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; {12828#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:24,970 INFO L273 TraceCheckUtils]: 12: Hoare triple {12828#(<= 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; {12829#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:24,971 INFO L273 TraceCheckUtils]: 13: Hoare triple {12829#(<= 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; {12830#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:24,972 INFO L273 TraceCheckUtils]: 14: Hoare triple {12830#(<= 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; {12831#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:24,973 INFO L273 TraceCheckUtils]: 15: Hoare triple {12831#(<= 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; {12832#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:24,974 INFO L273 TraceCheckUtils]: 16: Hoare triple {12832#(<= 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; {12833#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:24,975 INFO L273 TraceCheckUtils]: 17: Hoare triple {12833#(<= 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; {12834#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:24,975 INFO L273 TraceCheckUtils]: 18: Hoare triple {12834#(<= 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; {12835#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:24,976 INFO L273 TraceCheckUtils]: 19: Hoare triple {12835#(<= 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; {12836#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:24,977 INFO L273 TraceCheckUtils]: 20: Hoare triple {12836#(<= 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; {12837#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:24,978 INFO L273 TraceCheckUtils]: 21: Hoare triple {12837#(<= 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; {12838#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:24,979 INFO L273 TraceCheckUtils]: 22: Hoare triple {12838#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12839#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:24,980 INFO L273 TraceCheckUtils]: 23: Hoare triple {12839#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12840#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:24,981 INFO L273 TraceCheckUtils]: 24: Hoare triple {12840#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12841#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:24,982 INFO L273 TraceCheckUtils]: 25: Hoare triple {12841#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12842#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:24,983 INFO L273 TraceCheckUtils]: 26: Hoare triple {12842#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12843#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:24,984 INFO L273 TraceCheckUtils]: 27: Hoare triple {12843#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12844#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:24,985 INFO L273 TraceCheckUtils]: 28: Hoare triple {12844#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12845#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:24,985 INFO L273 TraceCheckUtils]: 29: Hoare triple {12845#(<= main_~i~0 23)} assume !(~i~0 < 100000); {12821#false} is VALID [2018-11-23 11:57:24,986 INFO L273 TraceCheckUtils]: 30: Hoare triple {12821#false} ~i~0 := 0; {12821#false} is VALID [2018-11-23 11:57:24,986 INFO L273 TraceCheckUtils]: 31: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,986 INFO L273 TraceCheckUtils]: 32: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,986 INFO L273 TraceCheckUtils]: 33: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,987 INFO L273 TraceCheckUtils]: 34: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,987 INFO L273 TraceCheckUtils]: 35: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,987 INFO L273 TraceCheckUtils]: 36: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,987 INFO L273 TraceCheckUtils]: 37: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,987 INFO L273 TraceCheckUtils]: 38: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,988 INFO L273 TraceCheckUtils]: 39: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,988 INFO L273 TraceCheckUtils]: 40: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,988 INFO L273 TraceCheckUtils]: 41: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,988 INFO L273 TraceCheckUtils]: 42: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,988 INFO L273 TraceCheckUtils]: 43: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,989 INFO L273 TraceCheckUtils]: 44: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,989 INFO L273 TraceCheckUtils]: 45: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,989 INFO L273 TraceCheckUtils]: 46: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,989 INFO L273 TraceCheckUtils]: 47: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,989 INFO L273 TraceCheckUtils]: 48: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,990 INFO L273 TraceCheckUtils]: 49: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,990 INFO L273 TraceCheckUtils]: 50: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,990 INFO L273 TraceCheckUtils]: 51: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,990 INFO L273 TraceCheckUtils]: 52: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,990 INFO L273 TraceCheckUtils]: 53: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,991 INFO L273 TraceCheckUtils]: 54: Hoare triple {12821#false} assume !(~i~0 < 100000); {12821#false} is VALID [2018-11-23 11:57:24,991 INFO L273 TraceCheckUtils]: 55: Hoare triple {12821#false} ~i~0 := 0; {12821#false} is VALID [2018-11-23 11:57:24,991 INFO L273 TraceCheckUtils]: 56: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,991 INFO L273 TraceCheckUtils]: 57: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,991 INFO L273 TraceCheckUtils]: 58: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,991 INFO L273 TraceCheckUtils]: 59: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,991 INFO L273 TraceCheckUtils]: 60: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,992 INFO L273 TraceCheckUtils]: 61: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,992 INFO L273 TraceCheckUtils]: 62: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,992 INFO L273 TraceCheckUtils]: 63: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,992 INFO L273 TraceCheckUtils]: 64: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,992 INFO L273 TraceCheckUtils]: 65: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,992 INFO L273 TraceCheckUtils]: 66: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,992 INFO L273 TraceCheckUtils]: 67: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,992 INFO L273 TraceCheckUtils]: 68: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,992 INFO L273 TraceCheckUtils]: 69: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,993 INFO L273 TraceCheckUtils]: 70: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,993 INFO L273 TraceCheckUtils]: 71: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,993 INFO L273 TraceCheckUtils]: 72: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,993 INFO L273 TraceCheckUtils]: 73: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,993 INFO L273 TraceCheckUtils]: 74: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,993 INFO L273 TraceCheckUtils]: 75: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,993 INFO L273 TraceCheckUtils]: 76: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,993 INFO L273 TraceCheckUtils]: 77: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,994 INFO L273 TraceCheckUtils]: 78: Hoare triple {12821#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12821#false} is VALID [2018-11-23 11:57:24,994 INFO L273 TraceCheckUtils]: 79: Hoare triple {12821#false} assume !(~i~0 < 100000); {12821#false} is VALID [2018-11-23 11:57:24,994 INFO L273 TraceCheckUtils]: 80: Hoare triple {12821#false} havoc ~x~0;~x~0 := 0; {12821#false} is VALID [2018-11-23 11:57:24,994 INFO L273 TraceCheckUtils]: 81: Hoare triple {12821#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12821#false} is VALID [2018-11-23 11:57:24,994 INFO L256 TraceCheckUtils]: 82: Hoare triple {12821#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {12821#false} is VALID [2018-11-23 11:57:24,994 INFO L273 TraceCheckUtils]: 83: Hoare triple {12821#false} ~cond := #in~cond; {12821#false} is VALID [2018-11-23 11:57:24,994 INFO L273 TraceCheckUtils]: 84: Hoare triple {12821#false} assume 0 == ~cond; {12821#false} is VALID [2018-11-23 11:57:24,994 INFO L273 TraceCheckUtils]: 85: Hoare triple {12821#false} assume !false; {12821#false} is VALID [2018-11-23 11:57:24,998 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-11-23 11:57:24,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:24,998 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:25,007 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1