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_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:02:26,987 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:02:26,990 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:02:27,003 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:02:27,003 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:02:27,004 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:02:27,006 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:02:27,008 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:02:27,009 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:02:27,010 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:02:27,011 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:02:27,011 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:02:27,012 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:02:27,013 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:02:27,014 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:02:27,015 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:02:27,016 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:02:27,018 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:02:27,020 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:02:27,022 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:02:27,023 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:02:27,027 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:02:27,032 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:02:27,032 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:02:27,032 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:02:27,033 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:02:27,035 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:02:27,039 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:02:27,043 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:02:27,044 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:02:27,045 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:02:27,045 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:02:27,046 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:02:27,046 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:02:27,047 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:02:27,049 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:02:27,049 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:02:27,081 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:02:27,081 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:02:27,082 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:02:27,082 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:02:27,083 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:02:27,083 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:02:27,083 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:02:27,084 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:02:27,084 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:02:27,084 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:02:27,084 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:02:27,085 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:02:27,087 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:02:27,088 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:02:27,088 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:02:27,088 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:02:27,088 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:02:27,088 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:02:27,089 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:02:27,089 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:02:27,089 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:02:27,089 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:02:27,091 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:02:27,091 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:02:27,091 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:02:27,092 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:02:27,092 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:02:27,092 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:02:27,092 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:02:27,092 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:02:27,093 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:02:27,151 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:02:27,167 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:02:27,171 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:02:27,173 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:02:27,173 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:02:27,174 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init3_true-unreach-call_ground.i [2018-11-23 12:02:27,259 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82f3e5355/b53e76244dad4fc1910dd8d012d0cb80/FLAG619901272 [2018-11-23 12:02:27,750 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:02:27,751 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init3_true-unreach-call_ground.i [2018-11-23 12:02:27,761 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82f3e5355/b53e76244dad4fc1910dd8d012d0cb80/FLAG619901272 [2018-11-23 12:02:28,081 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82f3e5355/b53e76244dad4fc1910dd8d012d0cb80 [2018-11-23 12:02:28,091 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:02:28,092 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:02:28,093 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:02:28,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:02:28,098 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:02:28,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:02:28" (1/1) ... [2018-11-23 12:02:28,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@630ba0a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:28, skipping insertion in model container [2018-11-23 12:02:28,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:02:28" (1/1) ... [2018-11-23 12:02:28,113 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:02:28,135 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:02:28,353 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:02:28,358 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:02:28,398 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:02:28,428 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:02:28,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:28 WrapperNode [2018-11-23 12:02:28,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:02:28,430 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:02:28,430 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:02:28,431 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:02:28,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:28" (1/1) ... [2018-11-23 12:02:28,451 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:28" (1/1) ... [2018-11-23 12:02:28,461 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:02:28,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:02:28,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:02:28,461 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:02:28,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:28" (1/1) ... [2018-11-23 12:02:28,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:28" (1/1) ... [2018-11-23 12:02:28,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:28" (1/1) ... [2018-11-23 12:02:28,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:28" (1/1) ... [2018-11-23 12:02:28,486 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:28" (1/1) ... [2018-11-23 12:02:28,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:28" (1/1) ... [2018-11-23 12:02:28,496 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:28" (1/1) ... [2018-11-23 12:02:28,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:02:28,507 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:02:28,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:02:28,508 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:02:28,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:02:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:02:28,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:02:28,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:02:28,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:02:28,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:02:28,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:02:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:02:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:02:28,676 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:02:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:02:28,677 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:02:28,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:02:29,271 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:02:29,272 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 12:02:29,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:02:29 BoogieIcfgContainer [2018-11-23 12:02:29,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:02:29,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:02:29,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:02:29,277 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:02:29,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:02:28" (1/3) ... [2018-11-23 12:02:29,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57c46394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:02:29, skipping insertion in model container [2018-11-23 12:02:29,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:28" (2/3) ... [2018-11-23 12:02:29,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57c46394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:02:29, skipping insertion in model container [2018-11-23 12:02:29,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:02:29" (3/3) ... [2018-11-23 12:02:29,282 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init3_true-unreach-call_ground.i [2018-11-23 12:02:29,292 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:02:29,301 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:02:29,318 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:02:29,353 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:02:29,354 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:02:29,354 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:02:29,354 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:02:29,355 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:02:29,355 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:02:29,355 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:02:29,355 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:02:29,355 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:02:29,374 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-23 12:02:29,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:02:29,381 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:29,384 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 12:02:29,389 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:29,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:29,399 INFO L82 PathProgramCache]: Analyzing trace with hash 578824766, now seen corresponding path program 1 times [2018-11-23 12:02:29,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:29,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:29,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:29,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:29,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:29,567 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-23 12:02:29,572 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 12:02:29,573 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-23 12:02:29,573 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #74#return; {30#true} is VALID [2018-11-23 12:02:29,573 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret2 := main(); {30#true} is VALID [2018-11-23 12:02:29,574 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 12:02:29,576 INFO L273 TraceCheckUtils]: 6: Hoare triple {30#true} assume !true; {31#false} is VALID [2018-11-23 12:02:29,577 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#false} ~i~0 := 0; {31#false} is VALID [2018-11-23 12:02:29,577 INFO L273 TraceCheckUtils]: 8: Hoare triple {31#false} assume !(~i~0 < 100000); {31#false} is VALID [2018-11-23 12:02:29,578 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#false} ~i~0 := 0; {31#false} is VALID [2018-11-23 12:02:29,578 INFO L273 TraceCheckUtils]: 10: Hoare triple {31#false} assume !(~i~0 < 100000); {31#false} is VALID [2018-11-23 12:02:29,579 INFO L273 TraceCheckUtils]: 11: Hoare triple {31#false} havoc ~x~0;~x~0 := 0; {31#false} is VALID [2018-11-23 12:02:29,579 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 12:02:29,579 INFO L256 TraceCheckUtils]: 13: Hoare triple {31#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {31#false} is VALID [2018-11-23 12:02:29,580 INFO L273 TraceCheckUtils]: 14: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2018-11-23 12:02:29,580 INFO L273 TraceCheckUtils]: 15: Hoare triple {31#false} assume 0 == ~cond; {31#false} is VALID [2018-11-23 12:02:29,581 INFO L273 TraceCheckUtils]: 16: Hoare triple {31#false} assume !false; {31#false} is VALID [2018-11-23 12:02:29,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:29,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:02:29,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:02:29,594 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 12:02:29,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:29,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:02:29,742 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:29,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:02:29,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:02:29,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:02:29,754 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-23 12:02:30,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:30,005 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2018-11-23 12:02:30,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:02:30,005 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 12:02:30,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:30,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:02:30,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2018-11-23 12:02:30,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:02:30,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2018-11-23 12:02:30,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 62 transitions. [2018-11-23 12:02:30,319 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:30,331 INFO L225 Difference]: With dead ends: 47 [2018-11-23 12:02:30,331 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 12:02:30,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:02:30,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 12:02:30,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 12:02:30,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:30,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 12:02:30,472 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 12:02:30,473 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 12:02:30,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:30,477 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-23 12:02:30,477 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-23 12:02:30,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:30,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:30,478 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 12:02:30,479 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 12:02:30,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:30,483 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-23 12:02:30,483 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-23 12:02:30,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:30,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:30,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:30,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:30,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:02:30,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-23 12:02:30,489 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2018-11-23 12:02:30,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:30,490 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-23 12:02:30,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:02:30,490 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-23 12:02:30,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:02:30,491 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:30,492 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 12:02:30,492 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:30,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:30,493 INFO L82 PathProgramCache]: Analyzing trace with hash -823304390, now seen corresponding path program 1 times [2018-11-23 12:02:30,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:30,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:30,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:30,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:30,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:30,586 INFO L256 TraceCheckUtils]: 0: Hoare triple {172#true} call ULTIMATE.init(); {172#true} is VALID [2018-11-23 12:02:30,588 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 12:02:30,588 INFO L273 TraceCheckUtils]: 2: Hoare triple {172#true} assume true; {172#true} is VALID [2018-11-23 12:02:30,589 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {172#true} {172#true} #74#return; {172#true} is VALID [2018-11-23 12:02:30,589 INFO L256 TraceCheckUtils]: 4: Hoare triple {172#true} call #t~ret2 := main(); {172#true} is VALID [2018-11-23 12:02:30,590 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 12:02:30,592 INFO L273 TraceCheckUtils]: 6: Hoare triple {174#(= main_~i~0 0)} assume !(~i~0 < 100000); {173#false} is VALID [2018-11-23 12:02:30,593 INFO L273 TraceCheckUtils]: 7: Hoare triple {173#false} ~i~0 := 0; {173#false} is VALID [2018-11-23 12:02:30,593 INFO L273 TraceCheckUtils]: 8: Hoare triple {173#false} assume !(~i~0 < 100000); {173#false} is VALID [2018-11-23 12:02:30,593 INFO L273 TraceCheckUtils]: 9: Hoare triple {173#false} ~i~0 := 0; {173#false} is VALID [2018-11-23 12:02:30,594 INFO L273 TraceCheckUtils]: 10: Hoare triple {173#false} assume !(~i~0 < 100000); {173#false} is VALID [2018-11-23 12:02:30,594 INFO L273 TraceCheckUtils]: 11: Hoare triple {173#false} havoc ~x~0;~x~0 := 0; {173#false} is VALID [2018-11-23 12:02:30,594 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 12:02:30,594 INFO L256 TraceCheckUtils]: 13: Hoare triple {173#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {173#false} is VALID [2018-11-23 12:02:30,595 INFO L273 TraceCheckUtils]: 14: Hoare triple {173#false} ~cond := #in~cond; {173#false} is VALID [2018-11-23 12:02:30,595 INFO L273 TraceCheckUtils]: 15: Hoare triple {173#false} assume 0 == ~cond; {173#false} is VALID [2018-11-23 12:02:30,595 INFO L273 TraceCheckUtils]: 16: Hoare triple {173#false} assume !false; {173#false} is VALID [2018-11-23 12:02:30,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:30,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:02:30,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:02:30,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:02:30,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:30,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:02:30,640 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:30,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:02:30,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:02:30,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:02:30,642 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 3 states. [2018-11-23 12:02:30,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:30,833 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-23 12:02:30,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:02:30,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:02:30,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:30,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:02:30,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2018-11-23 12:02:30,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:02:30,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2018-11-23 12:02:30,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2018-11-23 12:02:31,205 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:31,207 INFO L225 Difference]: With dead ends: 40 [2018-11-23 12:02:31,207 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 12:02:31,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:02:31,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 12:02:31,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 12:02:31,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:31,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 12:02:31,241 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 12:02:31,241 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 12:02:31,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:31,243 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 12:02:31,243 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 12:02:31,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:31,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:31,244 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 12:02:31,244 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 12:02:31,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:31,247 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 12:02:31,248 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 12:02:31,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:31,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:31,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:31,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:31,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:02:31,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-23 12:02:31,251 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2018-11-23 12:02:31,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:31,252 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-23 12:02:31,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:02:31,252 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 12:02:31,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:02:31,253 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:31,253 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 12:02:31,254 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:31,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:31,254 INFO L82 PathProgramCache]: Analyzing trace with hash 3753729, now seen corresponding path program 1 times [2018-11-23 12:02:31,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:31,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:31,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:31,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:31,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:31,404 INFO L256 TraceCheckUtils]: 0: Hoare triple {323#true} call ULTIMATE.init(); {323#true} is VALID [2018-11-23 12:02:31,405 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 12:02:31,405 INFO L273 TraceCheckUtils]: 2: Hoare triple {323#true} assume true; {323#true} is VALID [2018-11-23 12:02:31,405 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {323#true} {323#true} #74#return; {323#true} is VALID [2018-11-23 12:02:31,406 INFO L256 TraceCheckUtils]: 4: Hoare triple {323#true} call #t~ret2 := main(); {323#true} is VALID [2018-11-23 12:02:31,409 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 12:02:31,411 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 12:02:31,414 INFO L273 TraceCheckUtils]: 7: Hoare triple {326#(<= main_~i~0 1)} assume !(~i~0 < 100000); {324#false} is VALID [2018-11-23 12:02:31,414 INFO L273 TraceCheckUtils]: 8: Hoare triple {324#false} ~i~0 := 0; {324#false} is VALID [2018-11-23 12:02:31,415 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 12:02:31,415 INFO L273 TraceCheckUtils]: 10: Hoare triple {324#false} assume !(~i~0 < 100000); {324#false} is VALID [2018-11-23 12:02:31,415 INFO L273 TraceCheckUtils]: 11: Hoare triple {324#false} ~i~0 := 0; {324#false} is VALID [2018-11-23 12:02:31,416 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 12:02:31,416 INFO L273 TraceCheckUtils]: 13: Hoare triple {324#false} assume !(~i~0 < 100000); {324#false} is VALID [2018-11-23 12:02:31,416 INFO L273 TraceCheckUtils]: 14: Hoare triple {324#false} havoc ~x~0;~x~0 := 0; {324#false} is VALID [2018-11-23 12:02:31,417 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 12:02:31,417 INFO L256 TraceCheckUtils]: 16: Hoare triple {324#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {324#false} is VALID [2018-11-23 12:02:31,417 INFO L273 TraceCheckUtils]: 17: Hoare triple {324#false} ~cond := #in~cond; {324#false} is VALID [2018-11-23 12:02:31,418 INFO L273 TraceCheckUtils]: 18: Hoare triple {324#false} assume 0 == ~cond; {324#false} is VALID [2018-11-23 12:02:31,418 INFO L273 TraceCheckUtils]: 19: Hoare triple {324#false} assume !false; {324#false} is VALID [2018-11-23 12:02:31,419 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 12:02:31,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:31,420 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:31,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:31,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:31,757 INFO L256 TraceCheckUtils]: 0: Hoare triple {323#true} call ULTIMATE.init(); {323#true} is VALID [2018-11-23 12:02:31,758 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 12:02:31,758 INFO L273 TraceCheckUtils]: 2: Hoare triple {323#true} assume true; {323#true} is VALID [2018-11-23 12:02:31,759 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {323#true} {323#true} #74#return; {323#true} is VALID [2018-11-23 12:02:31,759 INFO L256 TraceCheckUtils]: 4: Hoare triple {323#true} call #t~ret2 := main(); {323#true} is VALID [2018-11-23 12:02:31,761 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 12:02:31,765 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 12:02:31,767 INFO L273 TraceCheckUtils]: 7: Hoare triple {326#(<= main_~i~0 1)} assume !(~i~0 < 100000); {324#false} is VALID [2018-11-23 12:02:31,767 INFO L273 TraceCheckUtils]: 8: Hoare triple {324#false} ~i~0 := 0; {324#false} is VALID [2018-11-23 12:02:31,767 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 12:02:31,768 INFO L273 TraceCheckUtils]: 10: Hoare triple {324#false} assume !(~i~0 < 100000); {324#false} is VALID [2018-11-23 12:02:31,768 INFO L273 TraceCheckUtils]: 11: Hoare triple {324#false} ~i~0 := 0; {324#false} is VALID [2018-11-23 12:02:31,768 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 12:02:31,769 INFO L273 TraceCheckUtils]: 13: Hoare triple {324#false} assume !(~i~0 < 100000); {324#false} is VALID [2018-11-23 12:02:31,769 INFO L273 TraceCheckUtils]: 14: Hoare triple {324#false} havoc ~x~0;~x~0 := 0; {324#false} is VALID [2018-11-23 12:02:31,769 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 12:02:31,770 INFO L256 TraceCheckUtils]: 16: Hoare triple {324#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {324#false} is VALID [2018-11-23 12:02:31,770 INFO L273 TraceCheckUtils]: 17: Hoare triple {324#false} ~cond := #in~cond; {324#false} is VALID [2018-11-23 12:02:31,771 INFO L273 TraceCheckUtils]: 18: Hoare triple {324#false} assume 0 == ~cond; {324#false} is VALID [2018-11-23 12:02:31,771 INFO L273 TraceCheckUtils]: 19: Hoare triple {324#false} assume !false; {324#false} is VALID [2018-11-23 12:02:31,772 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 12:02:31,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:31,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:02:31,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 12:02:31,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:31,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:02:31,873 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:31,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:02:31,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:02:31,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:02:31,874 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2018-11-23 12:02:32,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:32,294 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2018-11-23 12:02:32,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:02:32,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 12:02:32,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:32,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:02:32,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2018-11-23 12:02:32,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:02:32,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2018-11-23 12:02:32,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2018-11-23 12:02:32,425 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:32,427 INFO L225 Difference]: With dead ends: 45 [2018-11-23 12:02:32,427 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:02:32,428 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 12:02:32,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:02:32,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 12:02:32,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:32,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 12:02:32,509 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 12:02:32,509 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 12:02:32,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:32,511 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-23 12:02:32,511 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-23 12:02:32,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:32,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:32,513 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 12:02:32,513 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 12:02:32,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:32,516 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-23 12:02:32,516 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-23 12:02:32,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:32,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:32,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:32,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:32,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:02:32,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-23 12:02:32,520 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 20 [2018-11-23 12:02:32,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:32,520 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-23 12:02:32,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:02:32,520 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-23 12:02:32,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:02:32,522 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:32,522 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 12:02:32,522 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:32,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:32,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1185149478, now seen corresponding path program 2 times [2018-11-23 12:02:32,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:32,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:32,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:32,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:32,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:32,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:32,654 INFO L256 TraceCheckUtils]: 0: Hoare triple {555#true} call ULTIMATE.init(); {555#true} is VALID [2018-11-23 12:02:32,655 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 12:02:32,655 INFO L273 TraceCheckUtils]: 2: Hoare triple {555#true} assume true; {555#true} is VALID [2018-11-23 12:02:32,655 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {555#true} {555#true} #74#return; {555#true} is VALID [2018-11-23 12:02:32,655 INFO L256 TraceCheckUtils]: 4: Hoare triple {555#true} call #t~ret2 := main(); {555#true} is VALID [2018-11-23 12:02:32,656 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 12:02:32,657 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 12:02:32,660 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 12:02:32,661 INFO L273 TraceCheckUtils]: 8: Hoare triple {559#(<= main_~i~0 2)} assume !(~i~0 < 100000); {556#false} is VALID [2018-11-23 12:02:32,662 INFO L273 TraceCheckUtils]: 9: Hoare triple {556#false} ~i~0 := 0; {556#false} is VALID [2018-11-23 12:02:32,662 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 12:02:32,662 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 12:02:32,663 INFO L273 TraceCheckUtils]: 12: Hoare triple {556#false} assume !(~i~0 < 100000); {556#false} is VALID [2018-11-23 12:02:32,663 INFO L273 TraceCheckUtils]: 13: Hoare triple {556#false} ~i~0 := 0; {556#false} is VALID [2018-11-23 12:02:32,663 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 12:02:32,663 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 12:02:32,664 INFO L273 TraceCheckUtils]: 16: Hoare triple {556#false} assume !(~i~0 < 100000); {556#false} is VALID [2018-11-23 12:02:32,664 INFO L273 TraceCheckUtils]: 17: Hoare triple {556#false} havoc ~x~0;~x~0 := 0; {556#false} is VALID [2018-11-23 12:02:32,664 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 12:02:32,664 INFO L256 TraceCheckUtils]: 19: Hoare triple {556#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {556#false} is VALID [2018-11-23 12:02:32,665 INFO L273 TraceCheckUtils]: 20: Hoare triple {556#false} ~cond := #in~cond; {556#false} is VALID [2018-11-23 12:02:32,665 INFO L273 TraceCheckUtils]: 21: Hoare triple {556#false} assume 0 == ~cond; {556#false} is VALID [2018-11-23 12:02:32,665 INFO L273 TraceCheckUtils]: 22: Hoare triple {556#false} assume !false; {556#false} is VALID [2018-11-23 12:02:32,666 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 12:02:32,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:32,667 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:32,689 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:02:32,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:02:32,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:32,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:32,852 INFO L256 TraceCheckUtils]: 0: Hoare triple {555#true} call ULTIMATE.init(); {555#true} is VALID [2018-11-23 12:02:32,852 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 12:02:32,853 INFO L273 TraceCheckUtils]: 2: Hoare triple {555#true} assume true; {555#true} is VALID [2018-11-23 12:02:32,853 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {555#true} {555#true} #74#return; {555#true} is VALID [2018-11-23 12:02:32,853 INFO L256 TraceCheckUtils]: 4: Hoare triple {555#true} call #t~ret2 := main(); {555#true} is VALID [2018-11-23 12:02:32,855 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 12:02:32,857 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 12:02:32,858 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 12:02:32,860 INFO L273 TraceCheckUtils]: 8: Hoare triple {559#(<= main_~i~0 2)} assume !(~i~0 < 100000); {556#false} is VALID [2018-11-23 12:02:32,860 INFO L273 TraceCheckUtils]: 9: Hoare triple {556#false} ~i~0 := 0; {556#false} is VALID [2018-11-23 12:02:32,861 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 12:02:32,861 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 12:02:32,862 INFO L273 TraceCheckUtils]: 12: Hoare triple {556#false} assume !(~i~0 < 100000); {556#false} is VALID [2018-11-23 12:02:32,862 INFO L273 TraceCheckUtils]: 13: Hoare triple {556#false} ~i~0 := 0; {556#false} is VALID [2018-11-23 12:02:32,863 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 12:02:32,863 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 12:02:32,863 INFO L273 TraceCheckUtils]: 16: Hoare triple {556#false} assume !(~i~0 < 100000); {556#false} is VALID [2018-11-23 12:02:32,863 INFO L273 TraceCheckUtils]: 17: Hoare triple {556#false} havoc ~x~0;~x~0 := 0; {556#false} is VALID [2018-11-23 12:02:32,864 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 12:02:32,864 INFO L256 TraceCheckUtils]: 19: Hoare triple {556#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {556#false} is VALID [2018-11-23 12:02:32,864 INFO L273 TraceCheckUtils]: 20: Hoare triple {556#false} ~cond := #in~cond; {556#false} is VALID [2018-11-23 12:02:32,865 INFO L273 TraceCheckUtils]: 21: Hoare triple {556#false} assume 0 == ~cond; {556#false} is VALID [2018-11-23 12:02:32,865 INFO L273 TraceCheckUtils]: 22: Hoare triple {556#false} assume !false; {556#false} is VALID [2018-11-23 12:02:32,866 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 12:02:32,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:32,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:02:32,886 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-23 12:02:32,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:32,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:02:32,939 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:32,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:02:32,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:02:32,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:02:32,940 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 6 states. [2018-11-23 12:02:33,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:33,164 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-23 12:02:33,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:02:33,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-23 12:02:33,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:33,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:02:33,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2018-11-23 12:02:33,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:02:33,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2018-11-23 12:02:33,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2018-11-23 12:02:33,289 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:33,291 INFO L225 Difference]: With dead ends: 50 [2018-11-23 12:02:33,291 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:02:33,292 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 12:02:33,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:02:33,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 12:02:33,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:33,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-23 12:02:33,315 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 12:02:33,315 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 12:02:33,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:33,318 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-23 12:02:33,318 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-23 12:02:33,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:33,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:33,319 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 12:02:33,319 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 12:02:33,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:33,322 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-23 12:02:33,322 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-23 12:02:33,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:33,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:33,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:33,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:33,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:02:33,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-23 12:02:33,325 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 23 [2018-11-23 12:02:33,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:33,325 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-23 12:02:33,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:02:33,326 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-23 12:02:33,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:02:33,327 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:33,327 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 12:02:33,327 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:33,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:33,328 INFO L82 PathProgramCache]: Analyzing trace with hash 455820257, now seen corresponding path program 3 times [2018-11-23 12:02:33,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:33,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:33,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:33,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:33,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:33,460 INFO L256 TraceCheckUtils]: 0: Hoare triple {819#true} call ULTIMATE.init(); {819#true} is VALID [2018-11-23 12:02:33,461 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 12:02:33,461 INFO L273 TraceCheckUtils]: 2: Hoare triple {819#true} assume true; {819#true} is VALID [2018-11-23 12:02:33,461 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {819#true} {819#true} #74#return; {819#true} is VALID [2018-11-23 12:02:33,461 INFO L256 TraceCheckUtils]: 4: Hoare triple {819#true} call #t~ret2 := main(); {819#true} is VALID [2018-11-23 12:02:33,476 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 12:02:33,482 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 12:02:33,483 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 12:02:33,487 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 12:02:33,487 INFO L273 TraceCheckUtils]: 9: Hoare triple {824#(<= main_~i~0 3)} assume !(~i~0 < 100000); {820#false} is VALID [2018-11-23 12:02:33,488 INFO L273 TraceCheckUtils]: 10: Hoare triple {820#false} ~i~0 := 0; {820#false} is VALID [2018-11-23 12:02:33,488 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 12:02:33,488 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 12:02:33,488 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 12:02:33,489 INFO L273 TraceCheckUtils]: 14: Hoare triple {820#false} assume !(~i~0 < 100000); {820#false} is VALID [2018-11-23 12:02:33,489 INFO L273 TraceCheckUtils]: 15: Hoare triple {820#false} ~i~0 := 0; {820#false} is VALID [2018-11-23 12:02:33,489 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 12:02:33,489 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 12:02:33,489 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 12:02:33,490 INFO L273 TraceCheckUtils]: 19: Hoare triple {820#false} assume !(~i~0 < 100000); {820#false} is VALID [2018-11-23 12:02:33,490 INFO L273 TraceCheckUtils]: 20: Hoare triple {820#false} havoc ~x~0;~x~0 := 0; {820#false} is VALID [2018-11-23 12:02:33,490 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 12:02:33,490 INFO L256 TraceCheckUtils]: 22: Hoare triple {820#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {820#false} is VALID [2018-11-23 12:02:33,491 INFO L273 TraceCheckUtils]: 23: Hoare triple {820#false} ~cond := #in~cond; {820#false} is VALID [2018-11-23 12:02:33,491 INFO L273 TraceCheckUtils]: 24: Hoare triple {820#false} assume 0 == ~cond; {820#false} is VALID [2018-11-23 12:02:33,491 INFO L273 TraceCheckUtils]: 25: Hoare triple {820#false} assume !false; {820#false} is VALID [2018-11-23 12:02:33,492 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 12:02:33,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:33,493 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:33,502 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:02:33,523 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:02:33,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:33,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:33,624 INFO L256 TraceCheckUtils]: 0: Hoare triple {819#true} call ULTIMATE.init(); {819#true} is VALID [2018-11-23 12:02:33,625 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 12:02:33,625 INFO L273 TraceCheckUtils]: 2: Hoare triple {819#true} assume true; {819#true} is VALID [2018-11-23 12:02:33,626 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {819#true} {819#true} #74#return; {819#true} is VALID [2018-11-23 12:02:33,626 INFO L256 TraceCheckUtils]: 4: Hoare triple {819#true} call #t~ret2 := main(); {819#true} is VALID [2018-11-23 12:02:33,627 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 12:02:33,627 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 12:02:33,627 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 12:02:33,627 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 12:02:33,627 INFO L273 TraceCheckUtils]: 9: Hoare triple {819#true} assume !(~i~0 < 100000); {819#true} is VALID [2018-11-23 12:02:33,628 INFO L273 TraceCheckUtils]: 10: Hoare triple {819#true} ~i~0 := 0; {819#true} is VALID [2018-11-23 12:02:33,628 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 12:02:33,628 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 12:02:33,628 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 12:02:33,628 INFO L273 TraceCheckUtils]: 14: Hoare triple {819#true} assume !(~i~0 < 100000); {819#true} is VALID [2018-11-23 12:02:33,629 INFO L273 TraceCheckUtils]: 15: Hoare triple {819#true} ~i~0 := 0; {873#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:33,630 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 12:02:33,632 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 12:02:33,633 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 12:02:33,634 INFO L273 TraceCheckUtils]: 19: Hoare triple {824#(<= main_~i~0 3)} assume !(~i~0 < 100000); {820#false} is VALID [2018-11-23 12:02:33,634 INFO L273 TraceCheckUtils]: 20: Hoare triple {820#false} havoc ~x~0;~x~0 := 0; {820#false} is VALID [2018-11-23 12:02:33,634 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 12:02:33,634 INFO L256 TraceCheckUtils]: 22: Hoare triple {820#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {820#false} is VALID [2018-11-23 12:02:33,635 INFO L273 TraceCheckUtils]: 23: Hoare triple {820#false} ~cond := #in~cond; {820#false} is VALID [2018-11-23 12:02:33,635 INFO L273 TraceCheckUtils]: 24: Hoare triple {820#false} assume 0 == ~cond; {820#false} is VALID [2018-11-23 12:02:33,635 INFO L273 TraceCheckUtils]: 25: Hoare triple {820#false} assume !false; {820#false} is VALID [2018-11-23 12:02:33,637 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 12:02:33,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:33,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 12:02:33,657 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 12:02:33,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:33,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:02:33,707 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:33,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:02:33,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:02:33,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:02:33,708 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 7 states. [2018-11-23 12:02:33,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:33,935 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-23 12:02:33,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:02:33,935 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 12:02:33,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:33,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:02:33,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2018-11-23 12:02:33,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:02:33,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2018-11-23 12:02:33,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2018-11-23 12:02:34,079 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:34,081 INFO L225 Difference]: With dead ends: 55 [2018-11-23 12:02:34,082 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:02:34,082 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 12:02:34,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:02:34,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 12:02:34,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:34,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-23 12:02:34,112 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 12:02:34,112 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 12:02:34,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:34,115 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 12:02:34,115 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 12:02:34,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:34,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:34,116 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 12:02:34,116 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 12:02:34,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:34,118 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 12:02:34,119 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 12:02:34,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:34,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:34,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:34,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:34,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:02:34,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-23 12:02:34,126 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 26 [2018-11-23 12:02:34,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:34,126 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-23 12:02:34,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:02:34,127 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 12:02:34,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:02:34,127 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:34,128 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 12:02:34,128 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:34,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:34,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1002382458, now seen corresponding path program 4 times [2018-11-23 12:02:34,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:34,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:34,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:34,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:34,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:34,314 INFO L256 TraceCheckUtils]: 0: Hoare triple {1115#true} call ULTIMATE.init(); {1115#true} is VALID [2018-11-23 12:02:34,314 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 12:02:34,315 INFO L273 TraceCheckUtils]: 2: Hoare triple {1115#true} assume true; {1115#true} is VALID [2018-11-23 12:02:34,315 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1115#true} {1115#true} #74#return; {1115#true} is VALID [2018-11-23 12:02:34,316 INFO L256 TraceCheckUtils]: 4: Hoare triple {1115#true} call #t~ret2 := main(); {1115#true} is VALID [2018-11-23 12:02:34,318 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 12:02:34,319 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 12:02:34,320 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 12:02:34,320 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 12:02:34,322 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 12:02:34,323 INFO L273 TraceCheckUtils]: 10: Hoare triple {1121#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1116#false} is VALID [2018-11-23 12:02:34,323 INFO L273 TraceCheckUtils]: 11: Hoare triple {1116#false} ~i~0 := 0; {1116#false} is VALID [2018-11-23 12:02:34,323 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 12:02:34,324 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 12:02:34,324 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 12:02:34,324 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 12:02:34,325 INFO L273 TraceCheckUtils]: 16: Hoare triple {1116#false} assume !(~i~0 < 100000); {1116#false} is VALID [2018-11-23 12:02:34,325 INFO L273 TraceCheckUtils]: 17: Hoare triple {1116#false} ~i~0 := 0; {1116#false} is VALID [2018-11-23 12:02:34,326 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 12:02:34,326 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 12:02:34,326 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 12:02:34,327 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 12:02:34,327 INFO L273 TraceCheckUtils]: 22: Hoare triple {1116#false} assume !(~i~0 < 100000); {1116#false} is VALID [2018-11-23 12:02:34,327 INFO L273 TraceCheckUtils]: 23: Hoare triple {1116#false} havoc ~x~0;~x~0 := 0; {1116#false} is VALID [2018-11-23 12:02:34,327 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 12:02:34,328 INFO L256 TraceCheckUtils]: 25: Hoare triple {1116#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {1116#false} is VALID [2018-11-23 12:02:34,328 INFO L273 TraceCheckUtils]: 26: Hoare triple {1116#false} ~cond := #in~cond; {1116#false} is VALID [2018-11-23 12:02:34,328 INFO L273 TraceCheckUtils]: 27: Hoare triple {1116#false} assume 0 == ~cond; {1116#false} is VALID [2018-11-23 12:02:34,328 INFO L273 TraceCheckUtils]: 28: Hoare triple {1116#false} assume !false; {1116#false} is VALID [2018-11-23 12:02:34,330 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 12:02:34,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:34,330 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:34,346 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:02:34,382 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:02:34,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:34,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:34,600 INFO L256 TraceCheckUtils]: 0: Hoare triple {1115#true} call ULTIMATE.init(); {1115#true} is VALID [2018-11-23 12:02:34,600 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 12:02:34,601 INFO L273 TraceCheckUtils]: 2: Hoare triple {1115#true} assume true; {1115#true} is VALID [2018-11-23 12:02:34,601 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1115#true} {1115#true} #74#return; {1115#true} is VALID [2018-11-23 12:02:34,601 INFO L256 TraceCheckUtils]: 4: Hoare triple {1115#true} call #t~ret2 := main(); {1115#true} is VALID [2018-11-23 12:02:34,608 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 12:02:34,609 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 12:02:34,610 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 12:02:34,610 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 12:02:34,612 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 12:02:34,613 INFO L273 TraceCheckUtils]: 10: Hoare triple {1121#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1116#false} is VALID [2018-11-23 12:02:34,613 INFO L273 TraceCheckUtils]: 11: Hoare triple {1116#false} ~i~0 := 0; {1116#false} is VALID [2018-11-23 12:02:34,614 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 12:02:34,614 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 12:02:34,614 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 12:02:34,615 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 12:02:34,615 INFO L273 TraceCheckUtils]: 16: Hoare triple {1116#false} assume !(~i~0 < 100000); {1116#false} is VALID [2018-11-23 12:02:34,615 INFO L273 TraceCheckUtils]: 17: Hoare triple {1116#false} ~i~0 := 0; {1116#false} is VALID [2018-11-23 12:02:34,616 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 12:02:34,616 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 12:02:34,616 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 12:02:34,616 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 12:02:34,617 INFO L273 TraceCheckUtils]: 22: Hoare triple {1116#false} assume !(~i~0 < 100000); {1116#false} is VALID [2018-11-23 12:02:34,617 INFO L273 TraceCheckUtils]: 23: Hoare triple {1116#false} havoc ~x~0;~x~0 := 0; {1116#false} is VALID [2018-11-23 12:02:34,617 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 12:02:34,617 INFO L256 TraceCheckUtils]: 25: Hoare triple {1116#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {1116#false} is VALID [2018-11-23 12:02:34,617 INFO L273 TraceCheckUtils]: 26: Hoare triple {1116#false} ~cond := #in~cond; {1116#false} is VALID [2018-11-23 12:02:34,618 INFO L273 TraceCheckUtils]: 27: Hoare triple {1116#false} assume 0 == ~cond; {1116#false} is VALID [2018-11-23 12:02:34,618 INFO L273 TraceCheckUtils]: 28: Hoare triple {1116#false} assume !false; {1116#false} is VALID [2018-11-23 12:02:34,620 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 12:02:34,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:34,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:02:34,642 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-23 12:02:34,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:34,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:02:34,669 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:34,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:02:34,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:02:34,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:02:34,670 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 8 states. [2018-11-23 12:02:34,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:34,899 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-11-23 12:02:34,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:02:34,899 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-23 12:02:34,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:34,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:02:34,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2018-11-23 12:02:34,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:02:34,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2018-11-23 12:02:34,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2018-11-23 12:02:35,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:35,002 INFO L225 Difference]: With dead ends: 60 [2018-11-23 12:02:35,002 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 12:02:35,002 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 12:02:35,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 12:02:35,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 12:02:35,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:35,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-23 12:02:35,039 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 12:02:35,039 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 12:02:35,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:35,042 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-23 12:02:35,042 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-23 12:02:35,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:35,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:35,043 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 12:02:35,043 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 12:02:35,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:35,045 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-23 12:02:35,045 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-23 12:02:35,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:35,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:35,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:35,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:35,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:02:35,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-11-23 12:02:35,048 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 29 [2018-11-23 12:02:35,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:35,049 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-23 12:02:35,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:02:35,049 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-23 12:02:35,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:02:35,050 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:35,050 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 12:02:35,051 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:35,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:35,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1395779391, now seen corresponding path program 5 times [2018-11-23 12:02:35,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:35,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:35,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:35,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:35,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:35,215 INFO L256 TraceCheckUtils]: 0: Hoare triple {1443#true} call ULTIMATE.init(); {1443#true} is VALID [2018-11-23 12:02:35,216 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 12:02:35,216 INFO L273 TraceCheckUtils]: 2: Hoare triple {1443#true} assume true; {1443#true} is VALID [2018-11-23 12:02:35,217 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1443#true} {1443#true} #74#return; {1443#true} is VALID [2018-11-23 12:02:35,217 INFO L256 TraceCheckUtils]: 4: Hoare triple {1443#true} call #t~ret2 := main(); {1443#true} is VALID [2018-11-23 12:02:35,218 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 12:02:35,219 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 12:02:35,220 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 12:02:35,220 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 12:02:35,221 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 12:02:35,222 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 12:02:35,222 INFO L273 TraceCheckUtils]: 11: Hoare triple {1450#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1444#false} is VALID [2018-11-23 12:02:35,223 INFO L273 TraceCheckUtils]: 12: Hoare triple {1444#false} ~i~0 := 0; {1444#false} is VALID [2018-11-23 12:02:35,223 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 12:02:35,223 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 12:02:35,224 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 12:02:35,224 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 12:02:35,224 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 12:02:35,225 INFO L273 TraceCheckUtils]: 18: Hoare triple {1444#false} assume !(~i~0 < 100000); {1444#false} is VALID [2018-11-23 12:02:35,225 INFO L273 TraceCheckUtils]: 19: Hoare triple {1444#false} ~i~0 := 0; {1444#false} is VALID [2018-11-23 12:02:35,225 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 12:02:35,226 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 12:02:35,226 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 12:02:35,226 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 12:02:35,227 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 12:02:35,227 INFO L273 TraceCheckUtils]: 25: Hoare triple {1444#false} assume !(~i~0 < 100000); {1444#false} is VALID [2018-11-23 12:02:35,227 INFO L273 TraceCheckUtils]: 26: Hoare triple {1444#false} havoc ~x~0;~x~0 := 0; {1444#false} is VALID [2018-11-23 12:02:35,228 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 12:02:35,228 INFO L256 TraceCheckUtils]: 28: Hoare triple {1444#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {1444#false} is VALID [2018-11-23 12:02:35,228 INFO L273 TraceCheckUtils]: 29: Hoare triple {1444#false} ~cond := #in~cond; {1444#false} is VALID [2018-11-23 12:02:35,229 INFO L273 TraceCheckUtils]: 30: Hoare triple {1444#false} assume 0 == ~cond; {1444#false} is VALID [2018-11-23 12:02:35,229 INFO L273 TraceCheckUtils]: 31: Hoare triple {1444#false} assume !false; {1444#false} is VALID [2018-11-23 12:02:35,231 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 12:02:35,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:35,231 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:35,247 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:02:35,397 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 12:02:35,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:35,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:35,557 INFO L256 TraceCheckUtils]: 0: Hoare triple {1443#true} call ULTIMATE.init(); {1443#true} is VALID [2018-11-23 12:02:35,558 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 12:02:35,558 INFO L273 TraceCheckUtils]: 2: Hoare triple {1443#true} assume true; {1443#true} is VALID [2018-11-23 12:02:35,558 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1443#true} {1443#true} #74#return; {1443#true} is VALID [2018-11-23 12:02:35,559 INFO L256 TraceCheckUtils]: 4: Hoare triple {1443#true} call #t~ret2 := main(); {1443#true} is VALID [2018-11-23 12:02:35,559 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 12:02:35,559 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 12:02:35,559 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 12:02:35,560 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 12:02:35,560 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 12:02:35,560 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 12:02:35,560 INFO L273 TraceCheckUtils]: 11: Hoare triple {1443#true} assume !(~i~0 < 100000); {1443#true} is VALID [2018-11-23 12:02:35,561 INFO L273 TraceCheckUtils]: 12: Hoare triple {1443#true} ~i~0 := 0; {1443#true} is VALID [2018-11-23 12:02:35,561 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 12:02:35,561 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 12:02:35,561 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 12:02:35,562 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 12:02:35,562 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 12:02:35,562 INFO L273 TraceCheckUtils]: 18: Hoare triple {1443#true} assume !(~i~0 < 100000); {1443#true} is VALID [2018-11-23 12:02:35,564 INFO L273 TraceCheckUtils]: 19: Hoare triple {1443#true} ~i~0 := 0; {1511#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:35,565 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 12:02:35,565 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 12:02:35,566 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 12:02:35,567 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 12:02:35,568 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 12:02:35,569 INFO L273 TraceCheckUtils]: 25: Hoare triple {1450#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1444#false} is VALID [2018-11-23 12:02:35,569 INFO L273 TraceCheckUtils]: 26: Hoare triple {1444#false} havoc ~x~0;~x~0 := 0; {1444#false} is VALID [2018-11-23 12:02:35,570 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 12:02:35,570 INFO L256 TraceCheckUtils]: 28: Hoare triple {1444#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {1444#false} is VALID [2018-11-23 12:02:35,570 INFO L273 TraceCheckUtils]: 29: Hoare triple {1444#false} ~cond := #in~cond; {1444#false} is VALID [2018-11-23 12:02:35,571 INFO L273 TraceCheckUtils]: 30: Hoare triple {1444#false} assume 0 == ~cond; {1444#false} is VALID [2018-11-23 12:02:35,571 INFO L273 TraceCheckUtils]: 31: Hoare triple {1444#false} assume !false; {1444#false} is VALID [2018-11-23 12:02:35,573 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 12:02:35,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:35,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:02:35,595 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-23 12:02:35,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:35,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:02:35,644 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:35,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:02:35,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:02:35,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:02:35,645 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 9 states. [2018-11-23 12:02:36,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:36,034 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-11-23 12:02:36,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:02:36,035 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-23 12:02:36,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:36,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:02:36,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2018-11-23 12:02:36,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:02:36,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2018-11-23 12:02:36,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 63 transitions. [2018-11-23 12:02:36,143 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:36,146 INFO L225 Difference]: With dead ends: 65 [2018-11-23 12:02:36,146 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:02:36,147 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 12:02:36,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:02:36,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 12:02:36,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:36,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-23 12:02:36,268 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 12:02:36,268 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 12:02:36,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:36,270 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-11-23 12:02:36,270 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-11-23 12:02:36,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:36,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:36,271 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 12:02:36,271 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 12:02:36,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:36,273 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-11-23 12:02:36,274 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-11-23 12:02:36,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:36,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:36,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:36,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:36,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:02:36,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-11-23 12:02:36,276 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 32 [2018-11-23 12:02:36,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:36,277 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-11-23 12:02:36,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:02:36,277 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-11-23 12:02:36,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 12:02:36,278 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:36,278 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 12:02:36,278 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:36,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:36,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1957995290, now seen corresponding path program 6 times [2018-11-23 12:02:36,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:36,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:36,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:36,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:36,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:36,466 INFO L256 TraceCheckUtils]: 0: Hoare triple {1803#true} call ULTIMATE.init(); {1803#true} is VALID [2018-11-23 12:02:36,466 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 12:02:36,467 INFO L273 TraceCheckUtils]: 2: Hoare triple {1803#true} assume true; {1803#true} is VALID [2018-11-23 12:02:36,467 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1803#true} {1803#true} #74#return; {1803#true} is VALID [2018-11-23 12:02:36,467 INFO L256 TraceCheckUtils]: 4: Hoare triple {1803#true} call #t~ret2 := main(); {1803#true} is VALID [2018-11-23 12:02:36,467 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 12:02:36,468 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 12:02:36,469 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 12:02:36,470 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 12:02:36,470 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 12:02:36,471 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 12:02:36,472 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 12:02:36,473 INFO L273 TraceCheckUtils]: 12: Hoare triple {1811#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1804#false} is VALID [2018-11-23 12:02:36,474 INFO L273 TraceCheckUtils]: 13: Hoare triple {1804#false} ~i~0 := 0; {1804#false} is VALID [2018-11-23 12:02:36,474 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 12:02:36,475 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 12:02:36,475 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 12:02:36,475 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 12:02:36,476 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 12:02:36,476 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 12:02:36,477 INFO L273 TraceCheckUtils]: 20: Hoare triple {1804#false} assume !(~i~0 < 100000); {1804#false} is VALID [2018-11-23 12:02:36,477 INFO L273 TraceCheckUtils]: 21: Hoare triple {1804#false} ~i~0 := 0; {1804#false} is VALID [2018-11-23 12:02:36,478 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 12:02:36,478 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 12:02:36,478 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 12:02:36,478 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 12:02:36,479 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 12:02:36,479 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 12:02:36,479 INFO L273 TraceCheckUtils]: 28: Hoare triple {1804#false} assume !(~i~0 < 100000); {1804#false} is VALID [2018-11-23 12:02:36,479 INFO L273 TraceCheckUtils]: 29: Hoare triple {1804#false} havoc ~x~0;~x~0 := 0; {1804#false} is VALID [2018-11-23 12:02:36,479 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 12:02:36,480 INFO L256 TraceCheckUtils]: 31: Hoare triple {1804#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {1804#false} is VALID [2018-11-23 12:02:36,480 INFO L273 TraceCheckUtils]: 32: Hoare triple {1804#false} ~cond := #in~cond; {1804#false} is VALID [2018-11-23 12:02:36,480 INFO L273 TraceCheckUtils]: 33: Hoare triple {1804#false} assume 0 == ~cond; {1804#false} is VALID [2018-11-23 12:02:36,480 INFO L273 TraceCheckUtils]: 34: Hoare triple {1804#false} assume !false; {1804#false} is VALID [2018-11-23 12:02:36,482 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 12:02:36,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:36,482 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:36,493 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:02:36,751 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-23 12:02:36,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:36,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:37,167 INFO L256 TraceCheckUtils]: 0: Hoare triple {1803#true} call ULTIMATE.init(); {1803#true} is VALID [2018-11-23 12:02:37,168 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 12:02:37,168 INFO L273 TraceCheckUtils]: 2: Hoare triple {1803#true} assume true; {1803#true} is VALID [2018-11-23 12:02:37,168 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1803#true} {1803#true} #74#return; {1803#true} is VALID [2018-11-23 12:02:37,168 INFO L256 TraceCheckUtils]: 4: Hoare triple {1803#true} call #t~ret2 := main(); {1803#true} is VALID [2018-11-23 12:02:37,169 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 12:02:37,170 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 12:02:37,171 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 12:02:37,171 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 12:02:37,172 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 12:02:37,173 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 12:02:37,174 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 12:02:37,175 INFO L273 TraceCheckUtils]: 12: Hoare triple {1811#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1804#false} is VALID [2018-11-23 12:02:37,175 INFO L273 TraceCheckUtils]: 13: Hoare triple {1804#false} ~i~0 := 0; {1804#false} is VALID [2018-11-23 12:02:37,176 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 12:02:37,176 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 12:02:37,176 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 12:02:37,177 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 12:02:37,177 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 12:02:37,177 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 12:02:37,178 INFO L273 TraceCheckUtils]: 20: Hoare triple {1804#false} assume !(~i~0 < 100000); {1804#false} is VALID [2018-11-23 12:02:37,178 INFO L273 TraceCheckUtils]: 21: Hoare triple {1804#false} ~i~0 := 0; {1804#false} is VALID [2018-11-23 12:02:37,178 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 12:02:37,179 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 12:02:37,179 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 12:02:37,179 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 12:02:37,179 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 12:02:37,180 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 12:02:37,180 INFO L273 TraceCheckUtils]: 28: Hoare triple {1804#false} assume !(~i~0 < 100000); {1804#false} is VALID [2018-11-23 12:02:37,180 INFO L273 TraceCheckUtils]: 29: Hoare triple {1804#false} havoc ~x~0;~x~0 := 0; {1804#false} is VALID [2018-11-23 12:02:37,180 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 12:02:37,181 INFO L256 TraceCheckUtils]: 31: Hoare triple {1804#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {1804#false} is VALID [2018-11-23 12:02:37,181 INFO L273 TraceCheckUtils]: 32: Hoare triple {1804#false} ~cond := #in~cond; {1804#false} is VALID [2018-11-23 12:02:37,181 INFO L273 TraceCheckUtils]: 33: Hoare triple {1804#false} assume 0 == ~cond; {1804#false} is VALID [2018-11-23 12:02:37,181 INFO L273 TraceCheckUtils]: 34: Hoare triple {1804#false} assume !false; {1804#false} is VALID [2018-11-23 12:02:37,183 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 12:02:37,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:37,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 12:02:37,205 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-23 12:02:37,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:37,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:02:37,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:37,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:02:37,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:02:37,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:02:37,236 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 10 states. [2018-11-23 12:02:37,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:37,555 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2018-11-23 12:02:37,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:02:37,556 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-23 12:02:37,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:37,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:02:37,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 66 transitions. [2018-11-23 12:02:37,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:02:37,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 66 transitions. [2018-11-23 12:02:37,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 66 transitions. [2018-11-23 12:02:37,719 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:37,720 INFO L225 Difference]: With dead ends: 70 [2018-11-23 12:02:37,721 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 12:02:37,721 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 12:02:37,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 12:02:37,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-23 12:02:37,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:37,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2018-11-23 12:02:37,830 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 12:02:37,830 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 12:02:37,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:37,832 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-11-23 12:02:37,833 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-11-23 12:02:37,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:37,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:37,833 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 12:02:37,833 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 12:02:37,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:37,835 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-11-23 12:02:37,835 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-11-23 12:02:37,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:37,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:37,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:37,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:37,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:02:37,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-11-23 12:02:37,838 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 35 [2018-11-23 12:02:37,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:37,839 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-11-23 12:02:37,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:02:37,839 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-11-23 12:02:37,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 12:02:37,840 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:37,840 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 12:02:37,840 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:37,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:37,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1474050655, now seen corresponding path program 7 times [2018-11-23 12:02:37,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:37,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:37,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:37,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:37,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:38,174 INFO L256 TraceCheckUtils]: 0: Hoare triple {2195#true} call ULTIMATE.init(); {2195#true} is VALID [2018-11-23 12:02:38,174 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 12:02:38,175 INFO L273 TraceCheckUtils]: 2: Hoare triple {2195#true} assume true; {2195#true} is VALID [2018-11-23 12:02:38,175 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2195#true} {2195#true} #74#return; {2195#true} is VALID [2018-11-23 12:02:38,175 INFO L256 TraceCheckUtils]: 4: Hoare triple {2195#true} call #t~ret2 := main(); {2195#true} is VALID [2018-11-23 12:02:38,188 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 12:02:38,200 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 12:02:38,218 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 12:02:38,227 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 12:02:38,234 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 12:02:38,237 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 12:02:38,239 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 12:02:38,239 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 12:02:38,241 INFO L273 TraceCheckUtils]: 13: Hoare triple {2204#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2196#false} is VALID [2018-11-23 12:02:38,241 INFO L273 TraceCheckUtils]: 14: Hoare triple {2196#false} ~i~0 := 0; {2196#false} is VALID [2018-11-23 12:02:38,241 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 12:02:38,241 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 12:02:38,241 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 12:02:38,242 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 12:02:38,242 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 12:02:38,242 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 12:02:38,242 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 12:02:38,242 INFO L273 TraceCheckUtils]: 22: Hoare triple {2196#false} assume !(~i~0 < 100000); {2196#false} is VALID [2018-11-23 12:02:38,243 INFO L273 TraceCheckUtils]: 23: Hoare triple {2196#false} ~i~0 := 0; {2196#false} is VALID [2018-11-23 12:02:38,243 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 12:02:38,243 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 12:02:38,243 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 12:02:38,243 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 12:02:38,244 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 12:02:38,244 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 12:02:38,244 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 12:02:38,244 INFO L273 TraceCheckUtils]: 31: Hoare triple {2196#false} assume !(~i~0 < 100000); {2196#false} is VALID [2018-11-23 12:02:38,244 INFO L273 TraceCheckUtils]: 32: Hoare triple {2196#false} havoc ~x~0;~x~0 := 0; {2196#false} is VALID [2018-11-23 12:02:38,245 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 12:02:38,245 INFO L256 TraceCheckUtils]: 34: Hoare triple {2196#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {2196#false} is VALID [2018-11-23 12:02:38,245 INFO L273 TraceCheckUtils]: 35: Hoare triple {2196#false} ~cond := #in~cond; {2196#false} is VALID [2018-11-23 12:02:38,245 INFO L273 TraceCheckUtils]: 36: Hoare triple {2196#false} assume 0 == ~cond; {2196#false} is VALID [2018-11-23 12:02:38,245 INFO L273 TraceCheckUtils]: 37: Hoare triple {2196#false} assume !false; {2196#false} is VALID [2018-11-23 12:02:38,247 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 12:02:38,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:38,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:38,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:38,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:38,413 INFO L256 TraceCheckUtils]: 0: Hoare triple {2195#true} call ULTIMATE.init(); {2195#true} is VALID [2018-11-23 12:02:38,413 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 12:02:38,414 INFO L273 TraceCheckUtils]: 2: Hoare triple {2195#true} assume true; {2195#true} is VALID [2018-11-23 12:02:38,414 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2195#true} {2195#true} #74#return; {2195#true} is VALID [2018-11-23 12:02:38,414 INFO L256 TraceCheckUtils]: 4: Hoare triple {2195#true} call #t~ret2 := main(); {2195#true} is VALID [2018-11-23 12:02:38,415 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 12:02:38,416 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 12:02:38,417 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 12:02:38,417 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 12:02:38,418 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 12:02:38,419 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 12:02:38,420 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 12:02:38,421 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 12:02:38,421 INFO L273 TraceCheckUtils]: 13: Hoare triple {2204#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2196#false} is VALID [2018-11-23 12:02:38,422 INFO L273 TraceCheckUtils]: 14: Hoare triple {2196#false} ~i~0 := 0; {2196#false} is VALID [2018-11-23 12:02:38,422 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 12:02:38,422 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 12:02:38,422 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 12:02:38,423 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 12:02:38,423 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 12:02:38,423 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 12:02:38,423 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 12:02:38,424 INFO L273 TraceCheckUtils]: 22: Hoare triple {2196#false} assume !(~i~0 < 100000); {2196#false} is VALID [2018-11-23 12:02:38,424 INFO L273 TraceCheckUtils]: 23: Hoare triple {2196#false} ~i~0 := 0; {2196#false} is VALID [2018-11-23 12:02:38,424 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 12:02:38,424 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 12:02:38,425 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 12:02:38,425 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 12:02:38,425 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 12:02:38,425 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 12:02:38,425 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 12:02:38,426 INFO L273 TraceCheckUtils]: 31: Hoare triple {2196#false} assume !(~i~0 < 100000); {2196#false} is VALID [2018-11-23 12:02:38,426 INFO L273 TraceCheckUtils]: 32: Hoare triple {2196#false} havoc ~x~0;~x~0 := 0; {2196#false} is VALID [2018-11-23 12:02:38,426 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 12:02:38,426 INFO L256 TraceCheckUtils]: 34: Hoare triple {2196#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {2196#false} is VALID [2018-11-23 12:02:38,427 INFO L273 TraceCheckUtils]: 35: Hoare triple {2196#false} ~cond := #in~cond; {2196#false} is VALID [2018-11-23 12:02:38,427 INFO L273 TraceCheckUtils]: 36: Hoare triple {2196#false} assume 0 == ~cond; {2196#false} is VALID [2018-11-23 12:02:38,427 INFO L273 TraceCheckUtils]: 37: Hoare triple {2196#false} assume !false; {2196#false} is VALID [2018-11-23 12:02:38,428 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 12:02:38,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:38,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:02:38,447 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-11-23 12:02:38,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:38,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:02:38,489 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:38,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:02:38,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:02:38,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:02:38,490 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 11 states. [2018-11-23 12:02:39,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:39,030 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2018-11-23 12:02:39,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:02:39,031 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-11-23 12:02:39,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:39,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:02:39,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2018-11-23 12:02:39,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:02:39,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2018-11-23 12:02:39,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 69 transitions. [2018-11-23 12:02:39,115 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:39,116 INFO L225 Difference]: With dead ends: 75 [2018-11-23 12:02:39,117 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 12:02:39,117 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 12:02:39,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 12:02:39,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-23 12:02:39,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:39,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-23 12:02:39,182 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 12:02:39,182 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 12:02:39,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:39,186 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-11-23 12:02:39,186 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-11-23 12:02:39,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:39,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:39,186 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 12:02:39,186 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 12:02:39,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:39,188 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-11-23 12:02:39,188 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-11-23 12:02:39,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:39,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:39,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:39,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:39,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:02:39,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-11-23 12:02:39,190 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 38 [2018-11-23 12:02:39,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:39,190 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-11-23 12:02:39,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:02:39,191 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-11-23 12:02:39,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 12:02:39,191 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:39,191 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 12:02:39,192 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:39,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:39,192 INFO L82 PathProgramCache]: Analyzing trace with hash 2136639930, now seen corresponding path program 8 times [2018-11-23 12:02:39,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:39,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:39,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:39,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:39,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:39,508 INFO L256 TraceCheckUtils]: 0: Hoare triple {2619#true} call ULTIMATE.init(); {2619#true} is VALID [2018-11-23 12:02:39,509 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 12:02:39,509 INFO L273 TraceCheckUtils]: 2: Hoare triple {2619#true} assume true; {2619#true} is VALID [2018-11-23 12:02:39,509 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2619#true} {2619#true} #74#return; {2619#true} is VALID [2018-11-23 12:02:39,510 INFO L256 TraceCheckUtils]: 4: Hoare triple {2619#true} call #t~ret2 := main(); {2619#true} is VALID [2018-11-23 12:02:39,511 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 12:02:39,512 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 12:02:39,512 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 12:02:39,513 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 12:02:39,513 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 12:02:39,514 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 12:02:39,515 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 12:02:39,515 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 12:02:39,516 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 12:02:39,522 INFO L273 TraceCheckUtils]: 14: Hoare triple {2629#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2620#false} is VALID [2018-11-23 12:02:39,522 INFO L273 TraceCheckUtils]: 15: Hoare triple {2620#false} ~i~0 := 0; {2620#false} is VALID [2018-11-23 12:02:39,523 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 12:02:39,523 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 12:02:39,523 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 12:02:39,523 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 12:02:39,523 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 12:02:39,523 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 12:02:39,523 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 12:02:39,524 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 12:02:39,524 INFO L273 TraceCheckUtils]: 24: Hoare triple {2620#false} assume !(~i~0 < 100000); {2620#false} is VALID [2018-11-23 12:02:39,524 INFO L273 TraceCheckUtils]: 25: Hoare triple {2620#false} ~i~0 := 0; {2620#false} is VALID [2018-11-23 12:02:39,524 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 12:02:39,524 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 12:02:39,524 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 12:02:39,524 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 12:02:39,525 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 12:02:39,525 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 12:02:39,525 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 12:02:39,525 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 12:02:39,525 INFO L273 TraceCheckUtils]: 34: Hoare triple {2620#false} assume !(~i~0 < 100000); {2620#false} is VALID [2018-11-23 12:02:39,525 INFO L273 TraceCheckUtils]: 35: Hoare triple {2620#false} havoc ~x~0;~x~0 := 0; {2620#false} is VALID [2018-11-23 12:02:39,525 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 12:02:39,526 INFO L256 TraceCheckUtils]: 37: Hoare triple {2620#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {2620#false} is VALID [2018-11-23 12:02:39,526 INFO L273 TraceCheckUtils]: 38: Hoare triple {2620#false} ~cond := #in~cond; {2620#false} is VALID [2018-11-23 12:02:39,526 INFO L273 TraceCheckUtils]: 39: Hoare triple {2620#false} assume 0 == ~cond; {2620#false} is VALID [2018-11-23 12:02:39,526 INFO L273 TraceCheckUtils]: 40: Hoare triple {2620#false} assume !false; {2620#false} is VALID [2018-11-23 12:02:39,527 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 12:02:39,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:39,527 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:39,538 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:02:39,566 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:02:39,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:39,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:39,720 INFO L256 TraceCheckUtils]: 0: Hoare triple {2619#true} call ULTIMATE.init(); {2619#true} is VALID [2018-11-23 12:02:39,721 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 12:02:39,721 INFO L273 TraceCheckUtils]: 2: Hoare triple {2619#true} assume true; {2619#true} is VALID [2018-11-23 12:02:39,721 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2619#true} {2619#true} #74#return; {2619#true} is VALID [2018-11-23 12:02:39,721 INFO L256 TraceCheckUtils]: 4: Hoare triple {2619#true} call #t~ret2 := main(); {2619#true} is VALID [2018-11-23 12:02:39,722 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 12:02:39,724 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 12:02:39,725 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 12:02:39,726 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 12:02:39,727 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 12:02:39,728 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 12:02:39,729 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 12:02:39,730 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 12:02:39,731 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 12:02:39,732 INFO L273 TraceCheckUtils]: 14: Hoare triple {2629#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2620#false} is VALID [2018-11-23 12:02:39,733 INFO L273 TraceCheckUtils]: 15: Hoare triple {2620#false} ~i~0 := 0; {2620#false} is VALID [2018-11-23 12:02:39,733 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 12:02:39,733 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 12:02:39,734 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 12:02:39,734 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 12:02:39,734 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 12:02:39,734 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 12:02:39,734 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 12:02:39,735 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 12:02:39,735 INFO L273 TraceCheckUtils]: 24: Hoare triple {2620#false} assume !(~i~0 < 100000); {2620#false} is VALID [2018-11-23 12:02:39,735 INFO L273 TraceCheckUtils]: 25: Hoare triple {2620#false} ~i~0 := 0; {2620#false} is VALID [2018-11-23 12:02:39,735 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 12:02:39,735 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 12:02:39,735 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 12:02:39,736 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 12:02:39,736 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 12:02:39,737 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 12:02:39,737 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 12:02:39,737 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 12:02:39,737 INFO L273 TraceCheckUtils]: 34: Hoare triple {2620#false} assume !(~i~0 < 100000); {2620#false} is VALID [2018-11-23 12:02:39,737 INFO L273 TraceCheckUtils]: 35: Hoare triple {2620#false} havoc ~x~0;~x~0 := 0; {2620#false} is VALID [2018-11-23 12:02:39,738 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 12:02:39,738 INFO L256 TraceCheckUtils]: 37: Hoare triple {2620#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {2620#false} is VALID [2018-11-23 12:02:39,738 INFO L273 TraceCheckUtils]: 38: Hoare triple {2620#false} ~cond := #in~cond; {2620#false} is VALID [2018-11-23 12:02:39,738 INFO L273 TraceCheckUtils]: 39: Hoare triple {2620#false} assume 0 == ~cond; {2620#false} is VALID [2018-11-23 12:02:39,738 INFO L273 TraceCheckUtils]: 40: Hoare triple {2620#false} assume !false; {2620#false} is VALID [2018-11-23 12:02:39,740 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 12:02:39,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:39,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:02:39,760 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-11-23 12:02:39,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:39,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:02:39,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:39,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:02:39,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:02:39,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:02:39,785 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 12 states. [2018-11-23 12:02:40,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:40,276 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-11-23 12:02:40,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:02:40,276 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-11-23 12:02:40,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:40,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:02:40,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 72 transitions. [2018-11-23 12:02:40,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:02:40,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 72 transitions. [2018-11-23 12:02:40,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 72 transitions. [2018-11-23 12:02:40,441 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:40,443 INFO L225 Difference]: With dead ends: 80 [2018-11-23 12:02:40,443 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:02:40,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:02:40,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:02:40,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-23 12:02:40,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:40,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2018-11-23 12:02:40,474 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-23 12:02:40,475 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-23 12:02:40,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:40,476 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-11-23 12:02:40,476 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-23 12:02:40,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:40,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:40,477 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-23 12:02:40,477 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-23 12:02:40,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:40,478 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-11-23 12:02:40,478 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-23 12:02:40,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:40,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:40,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:40,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:40,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:02:40,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-11-23 12:02:40,481 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 41 [2018-11-23 12:02:40,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:40,481 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-11-23 12:02:40,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:02:40,481 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-23 12:02:40,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 12:02:40,482 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:40,482 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 12:02:40,482 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:40,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:40,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1548858751, now seen corresponding path program 9 times [2018-11-23 12:02:40,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:40,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:40,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:40,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:40,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:40,832 INFO L256 TraceCheckUtils]: 0: Hoare triple {3075#true} call ULTIMATE.init(); {3075#true} is VALID [2018-11-23 12:02:40,833 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 12:02:40,833 INFO L273 TraceCheckUtils]: 2: Hoare triple {3075#true} assume true; {3075#true} is VALID [2018-11-23 12:02:40,833 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3075#true} {3075#true} #74#return; {3075#true} is VALID [2018-11-23 12:02:40,833 INFO L256 TraceCheckUtils]: 4: Hoare triple {3075#true} call #t~ret2 := main(); {3075#true} is VALID [2018-11-23 12:02:40,834 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 12:02:40,835 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 12:02:40,836 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 12:02:40,837 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 12:02:40,837 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 12:02:40,838 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 12:02:40,839 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 12:02:40,840 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 12:02:40,840 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 12:02:40,841 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 12:02:40,842 INFO L273 TraceCheckUtils]: 15: Hoare triple {3086#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3076#false} is VALID [2018-11-23 12:02:40,842 INFO L273 TraceCheckUtils]: 16: Hoare triple {3076#false} ~i~0 := 0; {3076#false} is VALID [2018-11-23 12:02:40,843 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 12:02:40,843 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 12:02:40,843 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 12:02:40,843 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 12:02:40,844 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 12:02:40,844 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 12:02:40,844 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 12:02:40,844 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 12:02:40,844 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 12:02:40,845 INFO L273 TraceCheckUtils]: 26: Hoare triple {3076#false} assume !(~i~0 < 100000); {3076#false} is VALID [2018-11-23 12:02:40,845 INFO L273 TraceCheckUtils]: 27: Hoare triple {3076#false} ~i~0 := 0; {3076#false} is VALID [2018-11-23 12:02:40,845 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 12:02:40,845 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 12:02:40,845 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 12:02:40,846 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 12:02:40,846 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 12:02:40,846 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 12:02:40,846 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 12:02:40,846 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 12:02:40,846 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 12:02:40,846 INFO L273 TraceCheckUtils]: 37: Hoare triple {3076#false} assume !(~i~0 < 100000); {3076#false} is VALID [2018-11-23 12:02:40,846 INFO L273 TraceCheckUtils]: 38: Hoare triple {3076#false} havoc ~x~0;~x~0 := 0; {3076#false} is VALID [2018-11-23 12:02:40,847 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 12:02:40,847 INFO L256 TraceCheckUtils]: 40: Hoare triple {3076#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {3076#false} is VALID [2018-11-23 12:02:40,847 INFO L273 TraceCheckUtils]: 41: Hoare triple {3076#false} ~cond := #in~cond; {3076#false} is VALID [2018-11-23 12:02:40,847 INFO L273 TraceCheckUtils]: 42: Hoare triple {3076#false} assume 0 == ~cond; {3076#false} is VALID [2018-11-23 12:02:40,847 INFO L273 TraceCheckUtils]: 43: Hoare triple {3076#false} assume !false; {3076#false} is VALID [2018-11-23 12:02:40,849 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 12:02:40,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:40,849 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:40,867 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:02:41,159 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:02:41,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:41,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:41,440 INFO L256 TraceCheckUtils]: 0: Hoare triple {3075#true} call ULTIMATE.init(); {3075#true} is VALID [2018-11-23 12:02:41,440 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 12:02:41,440 INFO L273 TraceCheckUtils]: 2: Hoare triple {3075#true} assume true; {3075#true} is VALID [2018-11-23 12:02:41,441 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3075#true} {3075#true} #74#return; {3075#true} is VALID [2018-11-23 12:02:41,441 INFO L256 TraceCheckUtils]: 4: Hoare triple {3075#true} call #t~ret2 := main(); {3075#true} is VALID [2018-11-23 12:02:41,441 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 12:02:41,441 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 12:02:41,442 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 12:02:41,442 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 12:02:41,442 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 12:02:41,442 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 12:02:41,442 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 12:02:41,442 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 12:02:41,442 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 12:02:41,442 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 12:02:41,443 INFO L273 TraceCheckUtils]: 15: Hoare triple {3075#true} assume !(~i~0 < 100000); {3075#true} is VALID [2018-11-23 12:02:41,443 INFO L273 TraceCheckUtils]: 16: Hoare triple {3075#true} ~i~0 := 0; {3075#true} is VALID [2018-11-23 12:02:41,443 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 12:02:41,443 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 12:02:41,443 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 12:02:41,443 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 12:02:41,443 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 12:02:41,443 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 12:02:41,444 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 12:02:41,444 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 12:02:41,444 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; {3165#(<= main_~i~0 100000)} is VALID [2018-11-23 12:02:41,445 INFO L273 TraceCheckUtils]: 26: Hoare triple {3165#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {3075#true} is VALID [2018-11-23 12:02:41,445 INFO L273 TraceCheckUtils]: 27: Hoare triple {3075#true} ~i~0 := 0; {3172#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:41,446 INFO L273 TraceCheckUtils]: 28: Hoare triple {3172#(<= 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 12:02:41,446 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 12:02:41,447 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 12:02:41,447 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 12:02:41,448 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 12:02:41,449 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 12:02:41,450 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 12:02:41,451 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 12:02:41,452 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 12:02:41,453 INFO L273 TraceCheckUtils]: 37: Hoare triple {3086#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3076#false} is VALID [2018-11-23 12:02:41,453 INFO L273 TraceCheckUtils]: 38: Hoare triple {3076#false} havoc ~x~0;~x~0 := 0; {3076#false} is VALID [2018-11-23 12:02:41,453 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 12:02:41,454 INFO L256 TraceCheckUtils]: 40: Hoare triple {3076#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {3076#false} is VALID [2018-11-23 12:02:41,454 INFO L273 TraceCheckUtils]: 41: Hoare triple {3076#false} ~cond := #in~cond; {3076#false} is VALID [2018-11-23 12:02:41,454 INFO L273 TraceCheckUtils]: 42: Hoare triple {3076#false} assume 0 == ~cond; {3076#false} is VALID [2018-11-23 12:02:41,454 INFO L273 TraceCheckUtils]: 43: Hoare triple {3076#false} assume !false; {3076#false} is VALID [2018-11-23 12:02:41,456 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 9 proven. 45 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 12:02:41,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:41,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 14 [2018-11-23 12:02:41,479 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-11-23 12:02:41,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:41,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:02:41,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:41,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:02:41,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:02:41,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:02:41,524 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 14 states. [2018-11-23 12:02:41,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:41,982 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-11-23 12:02:41,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:02:41,982 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-11-23 12:02:41,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:41,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:02:41,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 75 transitions. [2018-11-23 12:02:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:02:41,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 75 transitions. [2018-11-23 12:02:41,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 75 transitions. [2018-11-23 12:02:42,134 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:42,135 INFO L225 Difference]: With dead ends: 85 [2018-11-23 12:02:42,135 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:02:42,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:02:42,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:02:42,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-23 12:02:42,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:42,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2018-11-23 12:02:42,171 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 12:02:42,171 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 12:02:42,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:42,172 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-11-23 12:02:42,173 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-23 12:02:42,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:42,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:42,173 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 12:02:42,173 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 12:02:42,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:42,174 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-11-23 12:02:42,174 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-23 12:02:42,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:42,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:42,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:42,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:42,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:02:42,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-11-23 12:02:42,176 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 44 [2018-11-23 12:02:42,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:42,176 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-11-23 12:02:42,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:02:42,176 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-23 12:02:42,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 12:02:42,176 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:42,177 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 12:02:42,177 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:42,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:42,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1397676122, now seen corresponding path program 10 times [2018-11-23 12:02:42,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:42,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:42,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:42,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:42,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:42,423 INFO L256 TraceCheckUtils]: 0: Hoare triple {3564#true} call ULTIMATE.init(); {3564#true} is VALID [2018-11-23 12:02:42,424 INFO L273 TraceCheckUtils]: 1: Hoare triple {3564#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3564#true} is VALID [2018-11-23 12:02:42,424 INFO L273 TraceCheckUtils]: 2: Hoare triple {3564#true} assume true; {3564#true} is VALID [2018-11-23 12:02:42,424 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3564#true} {3564#true} #74#return; {3564#true} is VALID [2018-11-23 12:02:42,425 INFO L256 TraceCheckUtils]: 4: Hoare triple {3564#true} call #t~ret2 := main(); {3564#true} is VALID [2018-11-23 12:02:42,425 INFO L273 TraceCheckUtils]: 5: Hoare triple {3564#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3566#(= main_~i~0 0)} is VALID [2018-11-23 12:02:42,426 INFO L273 TraceCheckUtils]: 6: Hoare triple {3566#(= 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; {3567#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:42,427 INFO L273 TraceCheckUtils]: 7: Hoare triple {3567#(<= 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; {3568#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:42,432 INFO L273 TraceCheckUtils]: 8: Hoare triple {3568#(<= 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; {3569#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:42,433 INFO L273 TraceCheckUtils]: 9: Hoare triple {3569#(<= 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; {3570#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:42,433 INFO L273 TraceCheckUtils]: 10: Hoare triple {3570#(<= 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; {3571#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:42,434 INFO L273 TraceCheckUtils]: 11: Hoare triple {3571#(<= 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; {3572#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:42,435 INFO L273 TraceCheckUtils]: 12: Hoare triple {3572#(<= 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; {3573#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:42,435 INFO L273 TraceCheckUtils]: 13: Hoare triple {3573#(<= 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; {3574#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:42,436 INFO L273 TraceCheckUtils]: 14: Hoare triple {3574#(<= 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; {3575#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:42,437 INFO L273 TraceCheckUtils]: 15: Hoare triple {3575#(<= 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; {3576#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:42,438 INFO L273 TraceCheckUtils]: 16: Hoare triple {3576#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3565#false} is VALID [2018-11-23 12:02:42,438 INFO L273 TraceCheckUtils]: 17: Hoare triple {3565#false} ~i~0 := 0; {3565#false} is VALID [2018-11-23 12:02:42,438 INFO L273 TraceCheckUtils]: 18: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,438 INFO L273 TraceCheckUtils]: 19: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,439 INFO L273 TraceCheckUtils]: 20: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,439 INFO L273 TraceCheckUtils]: 21: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,439 INFO L273 TraceCheckUtils]: 22: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,439 INFO L273 TraceCheckUtils]: 23: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,440 INFO L273 TraceCheckUtils]: 24: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,440 INFO L273 TraceCheckUtils]: 25: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,440 INFO L273 TraceCheckUtils]: 26: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,440 INFO L273 TraceCheckUtils]: 27: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,441 INFO L273 TraceCheckUtils]: 28: Hoare triple {3565#false} assume !(~i~0 < 100000); {3565#false} is VALID [2018-11-23 12:02:42,441 INFO L273 TraceCheckUtils]: 29: Hoare triple {3565#false} ~i~0 := 0; {3565#false} is VALID [2018-11-23 12:02:42,441 INFO L273 TraceCheckUtils]: 30: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,442 INFO L273 TraceCheckUtils]: 31: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,442 INFO L273 TraceCheckUtils]: 32: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,442 INFO L273 TraceCheckUtils]: 33: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,442 INFO L273 TraceCheckUtils]: 34: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,442 INFO L273 TraceCheckUtils]: 35: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,443 INFO L273 TraceCheckUtils]: 36: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,443 INFO L273 TraceCheckUtils]: 37: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,443 INFO L273 TraceCheckUtils]: 38: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,443 INFO L273 TraceCheckUtils]: 39: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,444 INFO L273 TraceCheckUtils]: 40: Hoare triple {3565#false} assume !(~i~0 < 100000); {3565#false} is VALID [2018-11-23 12:02:42,444 INFO L273 TraceCheckUtils]: 41: Hoare triple {3565#false} havoc ~x~0;~x~0 := 0; {3565#false} is VALID [2018-11-23 12:02:42,444 INFO L273 TraceCheckUtils]: 42: Hoare triple {3565#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3565#false} is VALID [2018-11-23 12:02:42,444 INFO L256 TraceCheckUtils]: 43: Hoare triple {3565#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {3565#false} is VALID [2018-11-23 12:02:42,445 INFO L273 TraceCheckUtils]: 44: Hoare triple {3565#false} ~cond := #in~cond; {3565#false} is VALID [2018-11-23 12:02:42,445 INFO L273 TraceCheckUtils]: 45: Hoare triple {3565#false} assume 0 == ~cond; {3565#false} is VALID [2018-11-23 12:02:42,445 INFO L273 TraceCheckUtils]: 46: Hoare triple {3565#false} assume !false; {3565#false} is VALID [2018-11-23 12:02:42,448 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 12:02:42,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:42,448 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:42,463 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:02:42,498 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:02:42,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:42,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:42,645 INFO L256 TraceCheckUtils]: 0: Hoare triple {3564#true} call ULTIMATE.init(); {3564#true} is VALID [2018-11-23 12:02:42,645 INFO L273 TraceCheckUtils]: 1: Hoare triple {3564#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3564#true} is VALID [2018-11-23 12:02:42,645 INFO L273 TraceCheckUtils]: 2: Hoare triple {3564#true} assume true; {3564#true} is VALID [2018-11-23 12:02:42,646 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3564#true} {3564#true} #74#return; {3564#true} is VALID [2018-11-23 12:02:42,646 INFO L256 TraceCheckUtils]: 4: Hoare triple {3564#true} call #t~ret2 := main(); {3564#true} is VALID [2018-11-23 12:02:42,647 INFO L273 TraceCheckUtils]: 5: Hoare triple {3564#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3595#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:42,667 INFO L273 TraceCheckUtils]: 6: Hoare triple {3595#(<= 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; {3567#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:42,668 INFO L273 TraceCheckUtils]: 7: Hoare triple {3567#(<= 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; {3568#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:42,669 INFO L273 TraceCheckUtils]: 8: Hoare triple {3568#(<= 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; {3569#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:42,670 INFO L273 TraceCheckUtils]: 9: Hoare triple {3569#(<= 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; {3570#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:42,672 INFO L273 TraceCheckUtils]: 10: Hoare triple {3570#(<= 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; {3571#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:42,673 INFO L273 TraceCheckUtils]: 11: Hoare triple {3571#(<= 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; {3572#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:42,674 INFO L273 TraceCheckUtils]: 12: Hoare triple {3572#(<= 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; {3573#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:42,676 INFO L273 TraceCheckUtils]: 13: Hoare triple {3573#(<= 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; {3574#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:42,677 INFO L273 TraceCheckUtils]: 14: Hoare triple {3574#(<= 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; {3575#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:42,677 INFO L273 TraceCheckUtils]: 15: Hoare triple {3575#(<= 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; {3576#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:42,678 INFO L273 TraceCheckUtils]: 16: Hoare triple {3576#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3565#false} is VALID [2018-11-23 12:02:42,678 INFO L273 TraceCheckUtils]: 17: Hoare triple {3565#false} ~i~0 := 0; {3565#false} is VALID [2018-11-23 12:02:42,678 INFO L273 TraceCheckUtils]: 18: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,678 INFO L273 TraceCheckUtils]: 19: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,678 INFO L273 TraceCheckUtils]: 20: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,678 INFO L273 TraceCheckUtils]: 21: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,679 INFO L273 TraceCheckUtils]: 22: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,679 INFO L273 TraceCheckUtils]: 23: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,679 INFO L273 TraceCheckUtils]: 24: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,679 INFO L273 TraceCheckUtils]: 25: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,679 INFO L273 TraceCheckUtils]: 26: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,679 INFO L273 TraceCheckUtils]: 27: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,679 INFO L273 TraceCheckUtils]: 28: Hoare triple {3565#false} assume !(~i~0 < 100000); {3565#false} is VALID [2018-11-23 12:02:42,679 INFO L273 TraceCheckUtils]: 29: Hoare triple {3565#false} ~i~0 := 0; {3565#false} is VALID [2018-11-23 12:02:42,680 INFO L273 TraceCheckUtils]: 30: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,680 INFO L273 TraceCheckUtils]: 31: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,680 INFO L273 TraceCheckUtils]: 32: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,680 INFO L273 TraceCheckUtils]: 33: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,680 INFO L273 TraceCheckUtils]: 34: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,680 INFO L273 TraceCheckUtils]: 35: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,681 INFO L273 TraceCheckUtils]: 36: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,681 INFO L273 TraceCheckUtils]: 37: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,681 INFO L273 TraceCheckUtils]: 38: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,681 INFO L273 TraceCheckUtils]: 39: Hoare triple {3565#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3565#false} is VALID [2018-11-23 12:02:42,682 INFO L273 TraceCheckUtils]: 40: Hoare triple {3565#false} assume !(~i~0 < 100000); {3565#false} is VALID [2018-11-23 12:02:42,682 INFO L273 TraceCheckUtils]: 41: Hoare triple {3565#false} havoc ~x~0;~x~0 := 0; {3565#false} is VALID [2018-11-23 12:02:42,682 INFO L273 TraceCheckUtils]: 42: Hoare triple {3565#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3565#false} is VALID [2018-11-23 12:02:42,682 INFO L256 TraceCheckUtils]: 43: Hoare triple {3565#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {3565#false} is VALID [2018-11-23 12:02:42,682 INFO L273 TraceCheckUtils]: 44: Hoare triple {3565#false} ~cond := #in~cond; {3565#false} is VALID [2018-11-23 12:02:42,682 INFO L273 TraceCheckUtils]: 45: Hoare triple {3565#false} assume 0 == ~cond; {3565#false} is VALID [2018-11-23 12:02:42,682 INFO L273 TraceCheckUtils]: 46: Hoare triple {3565#false} assume !false; {3565#false} is VALID [2018-11-23 12:02:42,684 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 12:02:42,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:42,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 12:02:42,703 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2018-11-23 12:02:42,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:42,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:02:42,728 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:42,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:02:42,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:02:42,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:02:42,729 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 14 states. [2018-11-23 12:02:43,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:43,433 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2018-11-23 12:02:43,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:02:43,433 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2018-11-23 12:02:43,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:43,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:02:43,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2018-11-23 12:02:43,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:02:43,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2018-11-23 12:02:43,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 78 transitions. [2018-11-23 12:02:43,520 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:43,522 INFO L225 Difference]: With dead ends: 90 [2018-11-23 12:02:43,522 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 12:02:43,523 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 12:02:43,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 12:02:43,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-23 12:02:43,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:43,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2018-11-23 12:02:43,585 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2018-11-23 12:02:43,585 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2018-11-23 12:02:43,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:43,587 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-11-23 12:02:43,587 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-11-23 12:02:43,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:43,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:43,587 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2018-11-23 12:02:43,587 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2018-11-23 12:02:43,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:43,589 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-11-23 12:02:43,589 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-11-23 12:02:43,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:43,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:43,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:43,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:43,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:02:43,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-11-23 12:02:43,591 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 47 [2018-11-23 12:02:43,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:43,591 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-11-23 12:02:43,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:02:43,591 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-11-23 12:02:43,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 12:02:43,592 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:43,592 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 12:02:43,592 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:43,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:43,593 INFO L82 PathProgramCache]: Analyzing trace with hash -110123167, now seen corresponding path program 11 times [2018-11-23 12:02:43,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:43,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:43,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:43,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:43,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:43,888 INFO L256 TraceCheckUtils]: 0: Hoare triple {4084#true} call ULTIMATE.init(); {4084#true} is VALID [2018-11-23 12:02:43,888 INFO L273 TraceCheckUtils]: 1: Hoare triple {4084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4084#true} is VALID [2018-11-23 12:02:43,888 INFO L273 TraceCheckUtils]: 2: Hoare triple {4084#true} assume true; {4084#true} is VALID [2018-11-23 12:02:43,889 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4084#true} {4084#true} #74#return; {4084#true} is VALID [2018-11-23 12:02:43,889 INFO L256 TraceCheckUtils]: 4: Hoare triple {4084#true} call #t~ret2 := main(); {4084#true} is VALID [2018-11-23 12:02:43,889 INFO L273 TraceCheckUtils]: 5: Hoare triple {4084#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4086#(= main_~i~0 0)} is VALID [2018-11-23 12:02:43,890 INFO L273 TraceCheckUtils]: 6: Hoare triple {4086#(= 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; {4087#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:43,890 INFO L273 TraceCheckUtils]: 7: Hoare triple {4087#(<= 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; {4088#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:43,891 INFO L273 TraceCheckUtils]: 8: Hoare triple {4088#(<= 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; {4089#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:43,891 INFO L273 TraceCheckUtils]: 9: Hoare triple {4089#(<= 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; {4090#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:43,892 INFO L273 TraceCheckUtils]: 10: Hoare triple {4090#(<= 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; {4091#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:43,893 INFO L273 TraceCheckUtils]: 11: Hoare triple {4091#(<= 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; {4092#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:43,894 INFO L273 TraceCheckUtils]: 12: Hoare triple {4092#(<= 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; {4093#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:43,895 INFO L273 TraceCheckUtils]: 13: Hoare triple {4093#(<= 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; {4094#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:43,896 INFO L273 TraceCheckUtils]: 14: Hoare triple {4094#(<= 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; {4095#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:43,897 INFO L273 TraceCheckUtils]: 15: Hoare triple {4095#(<= 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; {4096#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:43,898 INFO L273 TraceCheckUtils]: 16: Hoare triple {4096#(<= 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; {4097#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:43,899 INFO L273 TraceCheckUtils]: 17: Hoare triple {4097#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4085#false} is VALID [2018-11-23 12:02:43,899 INFO L273 TraceCheckUtils]: 18: Hoare triple {4085#false} ~i~0 := 0; {4085#false} is VALID [2018-11-23 12:02:43,899 INFO L273 TraceCheckUtils]: 19: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:43,899 INFO L273 TraceCheckUtils]: 20: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:43,899 INFO L273 TraceCheckUtils]: 21: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:43,900 INFO L273 TraceCheckUtils]: 22: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:43,900 INFO L273 TraceCheckUtils]: 23: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:43,900 INFO L273 TraceCheckUtils]: 24: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:43,900 INFO L273 TraceCheckUtils]: 25: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:43,901 INFO L273 TraceCheckUtils]: 26: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:43,901 INFO L273 TraceCheckUtils]: 27: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:43,901 INFO L273 TraceCheckUtils]: 28: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:43,901 INFO L273 TraceCheckUtils]: 29: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:43,901 INFO L273 TraceCheckUtils]: 30: Hoare triple {4085#false} assume !(~i~0 < 100000); {4085#false} is VALID [2018-11-23 12:02:43,901 INFO L273 TraceCheckUtils]: 31: Hoare triple {4085#false} ~i~0 := 0; {4085#false} is VALID [2018-11-23 12:02:43,902 INFO L273 TraceCheckUtils]: 32: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:43,902 INFO L273 TraceCheckUtils]: 33: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:43,902 INFO L273 TraceCheckUtils]: 34: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:43,902 INFO L273 TraceCheckUtils]: 35: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:43,902 INFO L273 TraceCheckUtils]: 36: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:43,902 INFO L273 TraceCheckUtils]: 37: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:43,902 INFO L273 TraceCheckUtils]: 38: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:43,902 INFO L273 TraceCheckUtils]: 39: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:43,902 INFO L273 TraceCheckUtils]: 40: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:43,903 INFO L273 TraceCheckUtils]: 41: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:43,903 INFO L273 TraceCheckUtils]: 42: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:43,903 INFO L273 TraceCheckUtils]: 43: Hoare triple {4085#false} assume !(~i~0 < 100000); {4085#false} is VALID [2018-11-23 12:02:43,903 INFO L273 TraceCheckUtils]: 44: Hoare triple {4085#false} havoc ~x~0;~x~0 := 0; {4085#false} is VALID [2018-11-23 12:02:43,903 INFO L273 TraceCheckUtils]: 45: Hoare triple {4085#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4085#false} is VALID [2018-11-23 12:02:43,903 INFO L256 TraceCheckUtils]: 46: Hoare triple {4085#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {4085#false} is VALID [2018-11-23 12:02:43,903 INFO L273 TraceCheckUtils]: 47: Hoare triple {4085#false} ~cond := #in~cond; {4085#false} is VALID [2018-11-23 12:02:43,903 INFO L273 TraceCheckUtils]: 48: Hoare triple {4085#false} assume 0 == ~cond; {4085#false} is VALID [2018-11-23 12:02:43,904 INFO L273 TraceCheckUtils]: 49: Hoare triple {4085#false} assume !false; {4085#false} is VALID [2018-11-23 12:02:43,906 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 12:02:43,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:43,906 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:43,915 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:02:49,984 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 12:02:49,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:50,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:50,146 INFO L256 TraceCheckUtils]: 0: Hoare triple {4084#true} call ULTIMATE.init(); {4084#true} is VALID [2018-11-23 12:02:50,146 INFO L273 TraceCheckUtils]: 1: Hoare triple {4084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4084#true} is VALID [2018-11-23 12:02:50,147 INFO L273 TraceCheckUtils]: 2: Hoare triple {4084#true} assume true; {4084#true} is VALID [2018-11-23 12:02:50,147 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4084#true} {4084#true} #74#return; {4084#true} is VALID [2018-11-23 12:02:50,147 INFO L256 TraceCheckUtils]: 4: Hoare triple {4084#true} call #t~ret2 := main(); {4084#true} is VALID [2018-11-23 12:02:50,148 INFO L273 TraceCheckUtils]: 5: Hoare triple {4084#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4116#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:50,149 INFO L273 TraceCheckUtils]: 6: Hoare triple {4116#(<= 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; {4087#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:50,150 INFO L273 TraceCheckUtils]: 7: Hoare triple {4087#(<= 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; {4088#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:50,150 INFO L273 TraceCheckUtils]: 8: Hoare triple {4088#(<= 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; {4089#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:50,151 INFO L273 TraceCheckUtils]: 9: Hoare triple {4089#(<= 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; {4090#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:50,152 INFO L273 TraceCheckUtils]: 10: Hoare triple {4090#(<= 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; {4091#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:50,153 INFO L273 TraceCheckUtils]: 11: Hoare triple {4091#(<= 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; {4092#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:50,154 INFO L273 TraceCheckUtils]: 12: Hoare triple {4092#(<= 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; {4093#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:50,155 INFO L273 TraceCheckUtils]: 13: Hoare triple {4093#(<= 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; {4094#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:50,157 INFO L273 TraceCheckUtils]: 14: Hoare triple {4094#(<= 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; {4095#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:50,158 INFO L273 TraceCheckUtils]: 15: Hoare triple {4095#(<= 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; {4096#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:50,159 INFO L273 TraceCheckUtils]: 16: Hoare triple {4096#(<= 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; {4097#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:50,159 INFO L273 TraceCheckUtils]: 17: Hoare triple {4097#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4085#false} is VALID [2018-11-23 12:02:50,160 INFO L273 TraceCheckUtils]: 18: Hoare triple {4085#false} ~i~0 := 0; {4085#false} is VALID [2018-11-23 12:02:50,160 INFO L273 TraceCheckUtils]: 19: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:50,160 INFO L273 TraceCheckUtils]: 20: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:50,161 INFO L273 TraceCheckUtils]: 21: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:50,161 INFO L273 TraceCheckUtils]: 22: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:50,161 INFO L273 TraceCheckUtils]: 23: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:50,162 INFO L273 TraceCheckUtils]: 24: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:50,162 INFO L273 TraceCheckUtils]: 25: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:50,162 INFO L273 TraceCheckUtils]: 26: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:50,163 INFO L273 TraceCheckUtils]: 27: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:50,163 INFO L273 TraceCheckUtils]: 28: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:50,163 INFO L273 TraceCheckUtils]: 29: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:50,164 INFO L273 TraceCheckUtils]: 30: Hoare triple {4085#false} assume !(~i~0 < 100000); {4085#false} is VALID [2018-11-23 12:02:50,164 INFO L273 TraceCheckUtils]: 31: Hoare triple {4085#false} ~i~0 := 0; {4085#false} is VALID [2018-11-23 12:02:50,164 INFO L273 TraceCheckUtils]: 32: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:50,164 INFO L273 TraceCheckUtils]: 33: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:50,165 INFO L273 TraceCheckUtils]: 34: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:50,165 INFO L273 TraceCheckUtils]: 35: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:50,165 INFO L273 TraceCheckUtils]: 36: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:50,165 INFO L273 TraceCheckUtils]: 37: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:50,166 INFO L273 TraceCheckUtils]: 38: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:50,166 INFO L273 TraceCheckUtils]: 39: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:50,166 INFO L273 TraceCheckUtils]: 40: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:50,166 INFO L273 TraceCheckUtils]: 41: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:50,166 INFO L273 TraceCheckUtils]: 42: Hoare triple {4085#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4085#false} is VALID [2018-11-23 12:02:50,167 INFO L273 TraceCheckUtils]: 43: Hoare triple {4085#false} assume !(~i~0 < 100000); {4085#false} is VALID [2018-11-23 12:02:50,167 INFO L273 TraceCheckUtils]: 44: Hoare triple {4085#false} havoc ~x~0;~x~0 := 0; {4085#false} is VALID [2018-11-23 12:02:50,167 INFO L273 TraceCheckUtils]: 45: Hoare triple {4085#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4085#false} is VALID [2018-11-23 12:02:50,167 INFO L256 TraceCheckUtils]: 46: Hoare triple {4085#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {4085#false} is VALID [2018-11-23 12:02:50,168 INFO L273 TraceCheckUtils]: 47: Hoare triple {4085#false} ~cond := #in~cond; {4085#false} is VALID [2018-11-23 12:02:50,168 INFO L273 TraceCheckUtils]: 48: Hoare triple {4085#false} assume 0 == ~cond; {4085#false} is VALID [2018-11-23 12:02:50,168 INFO L273 TraceCheckUtils]: 49: Hoare triple {4085#false} assume !false; {4085#false} is VALID [2018-11-23 12:02:50,171 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 12:02:50,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:50,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 12:02:50,206 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2018-11-23 12:02:50,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:50,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:02:50,300 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:50,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:02:50,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:02:50,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:02:50,302 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 15 states. [2018-11-23 12:02:50,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:50,639 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2018-11-23 12:02:50,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:02:50,640 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2018-11-23 12:02:50,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:50,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:02:50,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 81 transitions. [2018-11-23 12:02:50,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:02:50,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 81 transitions. [2018-11-23 12:02:50,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 81 transitions. [2018-11-23 12:02:50,742 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 12:02:50,743 INFO L225 Difference]: With dead ends: 95 [2018-11-23 12:02:50,744 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 12:02:50,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:02:50,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 12:02:50,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-23 12:02:50,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:50,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-23 12:02:50,800 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 12:02:50,800 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 12:02:50,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:50,801 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-11-23 12:02:50,802 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-11-23 12:02:50,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:50,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:50,802 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 12:02:50,803 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 12:02:50,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:50,804 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-11-23 12:02:50,805 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-11-23 12:02:50,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:50,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:50,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:50,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:50,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 12:02:50,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-11-23 12:02:50,807 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 50 [2018-11-23 12:02:50,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:50,808 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-11-23 12:02:50,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:02:50,808 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-11-23 12:02:50,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 12:02:50,809 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:50,809 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 12:02:50,809 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:50,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:50,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1531998470, now seen corresponding path program 12 times [2018-11-23 12:02:50,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:50,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:50,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:50,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:50,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:51,609 INFO L256 TraceCheckUtils]: 0: Hoare triple {4636#true} call ULTIMATE.init(); {4636#true} is VALID [2018-11-23 12:02:51,609 INFO L273 TraceCheckUtils]: 1: Hoare triple {4636#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4636#true} is VALID [2018-11-23 12:02:51,610 INFO L273 TraceCheckUtils]: 2: Hoare triple {4636#true} assume true; {4636#true} is VALID [2018-11-23 12:02:51,610 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4636#true} {4636#true} #74#return; {4636#true} is VALID [2018-11-23 12:02:51,610 INFO L256 TraceCheckUtils]: 4: Hoare triple {4636#true} call #t~ret2 := main(); {4636#true} is VALID [2018-11-23 12:02:51,611 INFO L273 TraceCheckUtils]: 5: Hoare triple {4636#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4638#(= main_~i~0 0)} is VALID [2018-11-23 12:02:51,612 INFO L273 TraceCheckUtils]: 6: Hoare triple {4638#(= 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; {4639#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:51,612 INFO L273 TraceCheckUtils]: 7: Hoare triple {4639#(<= 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; {4640#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:51,613 INFO L273 TraceCheckUtils]: 8: Hoare triple {4640#(<= 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; {4641#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:51,613 INFO L273 TraceCheckUtils]: 9: Hoare triple {4641#(<= 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; {4642#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:51,614 INFO L273 TraceCheckUtils]: 10: Hoare triple {4642#(<= 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; {4643#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:51,615 INFO L273 TraceCheckUtils]: 11: Hoare triple {4643#(<= 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; {4644#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:51,616 INFO L273 TraceCheckUtils]: 12: Hoare triple {4644#(<= 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; {4645#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:51,617 INFO L273 TraceCheckUtils]: 13: Hoare triple {4645#(<= 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; {4646#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:51,618 INFO L273 TraceCheckUtils]: 14: Hoare triple {4646#(<= 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; {4647#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:51,619 INFO L273 TraceCheckUtils]: 15: Hoare triple {4647#(<= 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; {4648#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:51,620 INFO L273 TraceCheckUtils]: 16: Hoare triple {4648#(<= 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; {4649#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:51,621 INFO L273 TraceCheckUtils]: 17: Hoare triple {4649#(<= 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; {4650#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:51,621 INFO L273 TraceCheckUtils]: 18: Hoare triple {4650#(<= main_~i~0 12)} assume !(~i~0 < 100000); {4637#false} is VALID [2018-11-23 12:02:51,622 INFO L273 TraceCheckUtils]: 19: Hoare triple {4637#false} ~i~0 := 0; {4637#false} is VALID [2018-11-23 12:02:51,622 INFO L273 TraceCheckUtils]: 20: Hoare triple {4637#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4637#false} is VALID [2018-11-23 12:02:51,622 INFO L273 TraceCheckUtils]: 21: Hoare triple {4637#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4637#false} is VALID [2018-11-23 12:02:51,622 INFO L273 TraceCheckUtils]: 22: Hoare triple {4637#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4637#false} is VALID [2018-11-23 12:02:51,622 INFO L273 TraceCheckUtils]: 23: Hoare triple {4637#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4637#false} is VALID [2018-11-23 12:02:51,623 INFO L273 TraceCheckUtils]: 24: Hoare triple {4637#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4637#false} is VALID [2018-11-23 12:02:51,623 INFO L273 TraceCheckUtils]: 25: Hoare triple {4637#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4637#false} is VALID [2018-11-23 12:02:51,623 INFO L273 TraceCheckUtils]: 26: Hoare triple {4637#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4637#false} is VALID [2018-11-23 12:02:51,623 INFO L273 TraceCheckUtils]: 27: Hoare triple {4637#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4637#false} is VALID [2018-11-23 12:02:51,623 INFO L273 TraceCheckUtils]: 28: Hoare triple {4637#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4637#false} is VALID [2018-11-23 12:02:51,624 INFO L273 TraceCheckUtils]: 29: Hoare triple {4637#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4637#false} is VALID [2018-11-23 12:02:51,624 INFO L273 TraceCheckUtils]: 30: Hoare triple {4637#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4637#false} is VALID [2018-11-23 12:02:51,624 INFO L273 TraceCheckUtils]: 31: Hoare triple {4637#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4637#false} is VALID [2018-11-23 12:02:51,624 INFO L273 TraceCheckUtils]: 32: Hoare triple {4637#false} assume !(~i~0 < 100000); {4637#false} is VALID [2018-11-23 12:02:51,624 INFO L273 TraceCheckUtils]: 33: Hoare triple {4637#false} ~i~0 := 0; {4637#false} is VALID [2018-11-23 12:02:51,625 INFO L273 TraceCheckUtils]: 34: Hoare triple {4637#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4637#false} is VALID [2018-11-23 12:02:51,625 INFO L273 TraceCheckUtils]: 35: Hoare triple {4637#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4637#false} is VALID [2018-11-23 12:02:51,625 INFO L273 TraceCheckUtils]: 36: Hoare triple {4637#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4637#false} is VALID [2018-11-23 12:02:51,625 INFO L273 TraceCheckUtils]: 37: Hoare triple {4637#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4637#false} is VALID [2018-11-23 12:02:51,626 INFO L273 TraceCheckUtils]: 38: Hoare triple {4637#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4637#false} is VALID [2018-11-23 12:02:51,626 INFO L273 TraceCheckUtils]: 39: Hoare triple {4637#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4637#false} is VALID [2018-11-23 12:02:51,626 INFO L273 TraceCheckUtils]: 40: Hoare triple {4637#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4637#false} is VALID [2018-11-23 12:02:51,626 INFO L273 TraceCheckUtils]: 41: Hoare triple {4637#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4637#false} is VALID [2018-11-23 12:02:51,626 INFO L273 TraceCheckUtils]: 42: Hoare triple {4637#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4637#false} is VALID [2018-11-23 12:02:51,626 INFO L273 TraceCheckUtils]: 43: Hoare triple {4637#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4637#false} is VALID [2018-11-23 12:02:51,626 INFO L273 TraceCheckUtils]: 44: Hoare triple {4637#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4637#false} is VALID [2018-11-23 12:02:51,626 INFO L273 TraceCheckUtils]: 45: Hoare triple {4637#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4637#false} is VALID [2018-11-23 12:02:51,627 INFO L273 TraceCheckUtils]: 46: Hoare triple {4637#false} assume !(~i~0 < 100000); {4637#false} is VALID [2018-11-23 12:02:51,627 INFO L273 TraceCheckUtils]: 47: Hoare triple {4637#false} havoc ~x~0;~x~0 := 0; {4637#false} is VALID [2018-11-23 12:02:51,627 INFO L273 TraceCheckUtils]: 48: Hoare triple {4637#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4637#false} is VALID [2018-11-23 12:02:51,627 INFO L256 TraceCheckUtils]: 49: Hoare triple {4637#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {4637#false} is VALID [2018-11-23 12:02:51,627 INFO L273 TraceCheckUtils]: 50: Hoare triple {4637#false} ~cond := #in~cond; {4637#false} is VALID [2018-11-23 12:02:51,627 INFO L273 TraceCheckUtils]: 51: Hoare triple {4637#false} assume 0 == ~cond; {4637#false} is VALID [2018-11-23 12:02:51,627 INFO L273 TraceCheckUtils]: 52: Hoare triple {4637#false} assume !false; {4637#false} is VALID [2018-11-23 12:02:51,629 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 12:02:51,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:51,629 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:51,638 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:02:57,799 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:02:57,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:57,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:58,017 INFO L256 TraceCheckUtils]: 0: Hoare triple {4636#true} call ULTIMATE.init(); {4636#true} is VALID [2018-11-23 12:02:58,018 INFO L273 TraceCheckUtils]: 1: Hoare triple {4636#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4636#true} is VALID [2018-11-23 12:02:58,018 INFO L273 TraceCheckUtils]: 2: Hoare triple {4636#true} assume true; {4636#true} is VALID [2018-11-23 12:02:58,018 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4636#true} {4636#true} #74#return; {4636#true} is VALID [2018-11-23 12:02:58,019 INFO L256 TraceCheckUtils]: 4: Hoare triple {4636#true} call #t~ret2 := main(); {4636#true} is VALID [2018-11-23 12:02:58,019 INFO L273 TraceCheckUtils]: 5: Hoare triple {4636#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4636#true} is VALID [2018-11-23 12:02:58,019 INFO L273 TraceCheckUtils]: 6: Hoare triple {4636#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#true} is VALID [2018-11-23 12:02:58,019 INFO L273 TraceCheckUtils]: 7: Hoare triple {4636#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#true} is VALID [2018-11-23 12:02:58,019 INFO L273 TraceCheckUtils]: 8: Hoare triple {4636#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#true} is VALID [2018-11-23 12:02:58,020 INFO L273 TraceCheckUtils]: 9: Hoare triple {4636#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#true} is VALID [2018-11-23 12:02:58,020 INFO L273 TraceCheckUtils]: 10: Hoare triple {4636#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#true} is VALID [2018-11-23 12:02:58,020 INFO L273 TraceCheckUtils]: 11: Hoare triple {4636#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#true} is VALID [2018-11-23 12:02:58,020 INFO L273 TraceCheckUtils]: 12: Hoare triple {4636#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#true} is VALID [2018-11-23 12:02:58,020 INFO L273 TraceCheckUtils]: 13: Hoare triple {4636#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#true} is VALID [2018-11-23 12:02:58,021 INFO L273 TraceCheckUtils]: 14: Hoare triple {4636#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#true} is VALID [2018-11-23 12:02:58,021 INFO L273 TraceCheckUtils]: 15: Hoare triple {4636#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#true} is VALID [2018-11-23 12:02:58,021 INFO L273 TraceCheckUtils]: 16: Hoare triple {4636#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#true} is VALID [2018-11-23 12:02:58,022 INFO L273 TraceCheckUtils]: 17: Hoare triple {4636#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4705#(<= main_~i~0 100000)} is VALID [2018-11-23 12:02:58,022 INFO L273 TraceCheckUtils]: 18: Hoare triple {4705#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {4636#true} is VALID [2018-11-23 12:02:58,022 INFO L273 TraceCheckUtils]: 19: Hoare triple {4636#true} ~i~0 := 0; {4636#true} is VALID [2018-11-23 12:02:58,022 INFO L273 TraceCheckUtils]: 20: Hoare triple {4636#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#true} is VALID [2018-11-23 12:02:58,022 INFO L273 TraceCheckUtils]: 21: Hoare triple {4636#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#true} is VALID [2018-11-23 12:02:58,022 INFO L273 TraceCheckUtils]: 22: Hoare triple {4636#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#true} is VALID [2018-11-23 12:02:58,022 INFO L273 TraceCheckUtils]: 23: Hoare triple {4636#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#true} is VALID [2018-11-23 12:02:58,022 INFO L273 TraceCheckUtils]: 24: Hoare triple {4636#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#true} is VALID [2018-11-23 12:02:58,023 INFO L273 TraceCheckUtils]: 25: Hoare triple {4636#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#true} is VALID [2018-11-23 12:02:58,023 INFO L273 TraceCheckUtils]: 26: Hoare triple {4636#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#true} is VALID [2018-11-23 12:02:58,023 INFO L273 TraceCheckUtils]: 27: Hoare triple {4636#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#true} is VALID [2018-11-23 12:02:58,023 INFO L273 TraceCheckUtils]: 28: Hoare triple {4636#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#true} is VALID [2018-11-23 12:02:58,023 INFO L273 TraceCheckUtils]: 29: Hoare triple {4636#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#true} is VALID [2018-11-23 12:02:58,023 INFO L273 TraceCheckUtils]: 30: Hoare triple {4636#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4636#true} is VALID [2018-11-23 12:02:58,024 INFO L273 TraceCheckUtils]: 31: Hoare triple {4636#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4705#(<= main_~i~0 100000)} is VALID [2018-11-23 12:02:58,024 INFO L273 TraceCheckUtils]: 32: Hoare triple {4705#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {4636#true} is VALID [2018-11-23 12:02:58,024 INFO L273 TraceCheckUtils]: 33: Hoare triple {4636#true} ~i~0 := 0; {4754#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:58,025 INFO L273 TraceCheckUtils]: 34: Hoare triple {4754#(<= 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; {4639#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:58,026 INFO L273 TraceCheckUtils]: 35: Hoare triple {4639#(<= 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; {4640#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:58,027 INFO L273 TraceCheckUtils]: 36: Hoare triple {4640#(<= 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; {4641#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:58,028 INFO L273 TraceCheckUtils]: 37: Hoare triple {4641#(<= 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; {4642#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:58,029 INFO L273 TraceCheckUtils]: 38: Hoare triple {4642#(<= 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; {4643#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:58,030 INFO L273 TraceCheckUtils]: 39: Hoare triple {4643#(<= 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; {4644#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:58,031 INFO L273 TraceCheckUtils]: 40: Hoare triple {4644#(<= 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; {4645#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:58,032 INFO L273 TraceCheckUtils]: 41: Hoare triple {4645#(<= 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; {4646#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:58,033 INFO L273 TraceCheckUtils]: 42: Hoare triple {4646#(<= 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; {4647#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:58,034 INFO L273 TraceCheckUtils]: 43: Hoare triple {4647#(<= 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; {4648#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:58,034 INFO L273 TraceCheckUtils]: 44: Hoare triple {4648#(<= 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; {4649#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:58,035 INFO L273 TraceCheckUtils]: 45: Hoare triple {4649#(<= 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; {4650#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:58,036 INFO L273 TraceCheckUtils]: 46: Hoare triple {4650#(<= main_~i~0 12)} assume !(~i~0 < 100000); {4637#false} is VALID [2018-11-23 12:02:58,036 INFO L273 TraceCheckUtils]: 47: Hoare triple {4637#false} havoc ~x~0;~x~0 := 0; {4637#false} is VALID [2018-11-23 12:02:58,037 INFO L273 TraceCheckUtils]: 48: Hoare triple {4637#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4637#false} is VALID [2018-11-23 12:02:58,037 INFO L256 TraceCheckUtils]: 49: Hoare triple {4637#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {4637#false} is VALID [2018-11-23 12:02:58,037 INFO L273 TraceCheckUtils]: 50: Hoare triple {4637#false} ~cond := #in~cond; {4637#false} is VALID [2018-11-23 12:02:58,037 INFO L273 TraceCheckUtils]: 51: Hoare triple {4637#false} assume 0 == ~cond; {4637#false} is VALID [2018-11-23 12:02:58,037 INFO L273 TraceCheckUtils]: 52: Hoare triple {4637#false} assume !false; {4637#false} is VALID [2018-11-23 12:02:58,040 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 12:02:58,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:58,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 17 [2018-11-23 12:02:58,063 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-11-23 12:02:58,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:58,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:02:58,115 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:58,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:02:58,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:02:58,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:02:58,116 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 17 states. [2018-11-23 12:02:58,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:58,674 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2018-11-23 12:02:58,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:02:58,674 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-11-23 12:02:58,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:58,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:02:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 84 transitions. [2018-11-23 12:02:58,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:02:58,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 84 transitions. [2018-11-23 12:02:58,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 84 transitions. [2018-11-23 12:02:59,155 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:59,157 INFO L225 Difference]: With dead ends: 100 [2018-11-23 12:02:59,157 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 12:02:59,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 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 12:02:59,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 12:03:00,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-23 12:03:00,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:00,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 61 states. [2018-11-23 12:03:00,285 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-23 12:03:00,285 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-23 12:03:00,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:00,287 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-11-23 12:03:00,287 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-11-23 12:03:00,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:00,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:00,288 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-23 12:03:00,288 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-23 12:03:00,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:00,290 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-11-23 12:03:00,290 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-11-23 12:03:00,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:00,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:00,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:00,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:00,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 12:03:00,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-11-23 12:03:00,292 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 53 [2018-11-23 12:03:00,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:00,292 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-11-23 12:03:00,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:03:00,293 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-11-23 12:03:00,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 12:03:00,293 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:00,293 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 12:03:00,294 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:00,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:00,294 INFO L82 PathProgramCache]: Analyzing trace with hash -420881343, now seen corresponding path program 13 times [2018-11-23 12:03:00,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:00,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:00,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:00,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:00,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:00,552 INFO L256 TraceCheckUtils]: 0: Hoare triple {5221#true} call ULTIMATE.init(); {5221#true} is VALID [2018-11-23 12:03:00,553 INFO L273 TraceCheckUtils]: 1: Hoare triple {5221#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5221#true} is VALID [2018-11-23 12:03:00,553 INFO L273 TraceCheckUtils]: 2: Hoare triple {5221#true} assume true; {5221#true} is VALID [2018-11-23 12:03:00,553 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5221#true} {5221#true} #74#return; {5221#true} is VALID [2018-11-23 12:03:00,553 INFO L256 TraceCheckUtils]: 4: Hoare triple {5221#true} call #t~ret2 := main(); {5221#true} is VALID [2018-11-23 12:03:00,554 INFO L273 TraceCheckUtils]: 5: Hoare triple {5221#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5223#(= main_~i~0 0)} is VALID [2018-11-23 12:03:00,555 INFO L273 TraceCheckUtils]: 6: Hoare triple {5223#(= 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; {5224#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:00,555 INFO L273 TraceCheckUtils]: 7: Hoare triple {5224#(<= 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; {5225#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:00,556 INFO L273 TraceCheckUtils]: 8: Hoare triple {5225#(<= 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; {5226#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:00,557 INFO L273 TraceCheckUtils]: 9: Hoare triple {5226#(<= 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; {5227#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:00,557 INFO L273 TraceCheckUtils]: 10: Hoare triple {5227#(<= 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; {5228#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:00,558 INFO L273 TraceCheckUtils]: 11: Hoare triple {5228#(<= 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; {5229#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:00,559 INFO L273 TraceCheckUtils]: 12: Hoare triple {5229#(<= 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; {5230#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:00,560 INFO L273 TraceCheckUtils]: 13: Hoare triple {5230#(<= 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; {5231#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:00,560 INFO L273 TraceCheckUtils]: 14: Hoare triple {5231#(<= 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; {5232#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:00,561 INFO L273 TraceCheckUtils]: 15: Hoare triple {5232#(<= 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; {5233#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:00,562 INFO L273 TraceCheckUtils]: 16: Hoare triple {5233#(<= 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; {5234#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:00,563 INFO L273 TraceCheckUtils]: 17: Hoare triple {5234#(<= 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; {5235#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:00,564 INFO L273 TraceCheckUtils]: 18: Hoare triple {5235#(<= 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; {5236#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:00,565 INFO L273 TraceCheckUtils]: 19: Hoare triple {5236#(<= main_~i~0 13)} assume !(~i~0 < 100000); {5222#false} is VALID [2018-11-23 12:03:00,565 INFO L273 TraceCheckUtils]: 20: Hoare triple {5222#false} ~i~0 := 0; {5222#false} is VALID [2018-11-23 12:03:00,565 INFO L273 TraceCheckUtils]: 21: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,566 INFO L273 TraceCheckUtils]: 22: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,566 INFO L273 TraceCheckUtils]: 23: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,566 INFO L273 TraceCheckUtils]: 24: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,566 INFO L273 TraceCheckUtils]: 25: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,566 INFO L273 TraceCheckUtils]: 26: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,567 INFO L273 TraceCheckUtils]: 27: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,567 INFO L273 TraceCheckUtils]: 28: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,567 INFO L273 TraceCheckUtils]: 29: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,567 INFO L273 TraceCheckUtils]: 30: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,567 INFO L273 TraceCheckUtils]: 31: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,568 INFO L273 TraceCheckUtils]: 32: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,568 INFO L273 TraceCheckUtils]: 33: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,568 INFO L273 TraceCheckUtils]: 34: Hoare triple {5222#false} assume !(~i~0 < 100000); {5222#false} is VALID [2018-11-23 12:03:00,568 INFO L273 TraceCheckUtils]: 35: Hoare triple {5222#false} ~i~0 := 0; {5222#false} is VALID [2018-11-23 12:03:00,568 INFO L273 TraceCheckUtils]: 36: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,568 INFO L273 TraceCheckUtils]: 37: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,568 INFO L273 TraceCheckUtils]: 38: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,568 INFO L273 TraceCheckUtils]: 39: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,569 INFO L273 TraceCheckUtils]: 40: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,569 INFO L273 TraceCheckUtils]: 41: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,569 INFO L273 TraceCheckUtils]: 42: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,569 INFO L273 TraceCheckUtils]: 43: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,569 INFO L273 TraceCheckUtils]: 44: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,569 INFO L273 TraceCheckUtils]: 45: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,569 INFO L273 TraceCheckUtils]: 46: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,569 INFO L273 TraceCheckUtils]: 47: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,570 INFO L273 TraceCheckUtils]: 48: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,570 INFO L273 TraceCheckUtils]: 49: Hoare triple {5222#false} assume !(~i~0 < 100000); {5222#false} is VALID [2018-11-23 12:03:00,570 INFO L273 TraceCheckUtils]: 50: Hoare triple {5222#false} havoc ~x~0;~x~0 := 0; {5222#false} is VALID [2018-11-23 12:03:00,570 INFO L273 TraceCheckUtils]: 51: Hoare triple {5222#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5222#false} is VALID [2018-11-23 12:03:00,570 INFO L256 TraceCheckUtils]: 52: Hoare triple {5222#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {5222#false} is VALID [2018-11-23 12:03:00,570 INFO L273 TraceCheckUtils]: 53: Hoare triple {5222#false} ~cond := #in~cond; {5222#false} is VALID [2018-11-23 12:03:00,570 INFO L273 TraceCheckUtils]: 54: Hoare triple {5222#false} assume 0 == ~cond; {5222#false} is VALID [2018-11-23 12:03:00,570 INFO L273 TraceCheckUtils]: 55: Hoare triple {5222#false} assume !false; {5222#false} is VALID [2018-11-23 12:03:00,572 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 12:03:00,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:00,573 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:00,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:03:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:00,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:00,750 INFO L256 TraceCheckUtils]: 0: Hoare triple {5221#true} call ULTIMATE.init(); {5221#true} is VALID [2018-11-23 12:03:00,751 INFO L273 TraceCheckUtils]: 1: Hoare triple {5221#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5221#true} is VALID [2018-11-23 12:03:00,751 INFO L273 TraceCheckUtils]: 2: Hoare triple {5221#true} assume true; {5221#true} is VALID [2018-11-23 12:03:00,751 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5221#true} {5221#true} #74#return; {5221#true} is VALID [2018-11-23 12:03:00,751 INFO L256 TraceCheckUtils]: 4: Hoare triple {5221#true} call #t~ret2 := main(); {5221#true} is VALID [2018-11-23 12:03:00,752 INFO L273 TraceCheckUtils]: 5: Hoare triple {5221#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5255#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:00,753 INFO L273 TraceCheckUtils]: 6: Hoare triple {5255#(<= 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; {5224#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:00,753 INFO L273 TraceCheckUtils]: 7: Hoare triple {5224#(<= 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; {5225#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:00,754 INFO L273 TraceCheckUtils]: 8: Hoare triple {5225#(<= 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; {5226#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:00,754 INFO L273 TraceCheckUtils]: 9: Hoare triple {5226#(<= 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; {5227#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:00,755 INFO L273 TraceCheckUtils]: 10: Hoare triple {5227#(<= 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; {5228#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:00,756 INFO L273 TraceCheckUtils]: 11: Hoare triple {5228#(<= 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; {5229#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:00,757 INFO L273 TraceCheckUtils]: 12: Hoare triple {5229#(<= 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; {5230#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:00,758 INFO L273 TraceCheckUtils]: 13: Hoare triple {5230#(<= 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; {5231#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:00,759 INFO L273 TraceCheckUtils]: 14: Hoare triple {5231#(<= 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; {5232#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:00,759 INFO L273 TraceCheckUtils]: 15: Hoare triple {5232#(<= 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; {5233#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:00,760 INFO L273 TraceCheckUtils]: 16: Hoare triple {5233#(<= 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; {5234#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:00,761 INFO L273 TraceCheckUtils]: 17: Hoare triple {5234#(<= 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; {5235#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:00,767 INFO L273 TraceCheckUtils]: 18: Hoare triple {5235#(<= 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; {5236#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:00,768 INFO L273 TraceCheckUtils]: 19: Hoare triple {5236#(<= main_~i~0 13)} assume !(~i~0 < 100000); {5222#false} is VALID [2018-11-23 12:03:00,768 INFO L273 TraceCheckUtils]: 20: Hoare triple {5222#false} ~i~0 := 0; {5222#false} is VALID [2018-11-23 12:03:00,768 INFO L273 TraceCheckUtils]: 21: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,768 INFO L273 TraceCheckUtils]: 22: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,768 INFO L273 TraceCheckUtils]: 23: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,768 INFO L273 TraceCheckUtils]: 24: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,768 INFO L273 TraceCheckUtils]: 25: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,769 INFO L273 TraceCheckUtils]: 26: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,769 INFO L273 TraceCheckUtils]: 27: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,769 INFO L273 TraceCheckUtils]: 28: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,769 INFO L273 TraceCheckUtils]: 29: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,769 INFO L273 TraceCheckUtils]: 30: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,769 INFO L273 TraceCheckUtils]: 31: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,769 INFO L273 TraceCheckUtils]: 32: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,769 INFO L273 TraceCheckUtils]: 33: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,769 INFO L273 TraceCheckUtils]: 34: Hoare triple {5222#false} assume !(~i~0 < 100000); {5222#false} is VALID [2018-11-23 12:03:00,770 INFO L273 TraceCheckUtils]: 35: Hoare triple {5222#false} ~i~0 := 0; {5222#false} is VALID [2018-11-23 12:03:00,770 INFO L273 TraceCheckUtils]: 36: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,770 INFO L273 TraceCheckUtils]: 37: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,770 INFO L273 TraceCheckUtils]: 38: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,770 INFO L273 TraceCheckUtils]: 39: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,770 INFO L273 TraceCheckUtils]: 40: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,771 INFO L273 TraceCheckUtils]: 41: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,771 INFO L273 TraceCheckUtils]: 42: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,771 INFO L273 TraceCheckUtils]: 43: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,771 INFO L273 TraceCheckUtils]: 44: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,771 INFO L273 TraceCheckUtils]: 45: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,772 INFO L273 TraceCheckUtils]: 46: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,772 INFO L273 TraceCheckUtils]: 47: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,772 INFO L273 TraceCheckUtils]: 48: Hoare triple {5222#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5222#false} is VALID [2018-11-23 12:03:00,772 INFO L273 TraceCheckUtils]: 49: Hoare triple {5222#false} assume !(~i~0 < 100000); {5222#false} is VALID [2018-11-23 12:03:00,772 INFO L273 TraceCheckUtils]: 50: Hoare triple {5222#false} havoc ~x~0;~x~0 := 0; {5222#false} is VALID [2018-11-23 12:03:00,772 INFO L273 TraceCheckUtils]: 51: Hoare triple {5222#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5222#false} is VALID [2018-11-23 12:03:00,772 INFO L256 TraceCheckUtils]: 52: Hoare triple {5222#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {5222#false} is VALID [2018-11-23 12:03:00,773 INFO L273 TraceCheckUtils]: 53: Hoare triple {5222#false} ~cond := #in~cond; {5222#false} is VALID [2018-11-23 12:03:00,773 INFO L273 TraceCheckUtils]: 54: Hoare triple {5222#false} assume 0 == ~cond; {5222#false} is VALID [2018-11-23 12:03:00,773 INFO L273 TraceCheckUtils]: 55: Hoare triple {5222#false} assume !false; {5222#false} is VALID [2018-11-23 12:03:00,774 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 12:03:00,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:00,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:03:00,795 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-11-23 12:03:00,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:00,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:03:00,821 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:00,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:03:00,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:03:00,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:03:00,823 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 17 states. [2018-11-23 12:03:01,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:01,473 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2018-11-23 12:03:01,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:03:01,473 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-11-23 12:03:01,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:01,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:03:01,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 87 transitions. [2018-11-23 12:03:01,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:03:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 87 transitions. [2018-11-23 12:03:01,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 87 transitions. [2018-11-23 12:03:01,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:01,641 INFO L225 Difference]: With dead ends: 105 [2018-11-23 12:03:01,641 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 12:03:01,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:03:01,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 12:03:01,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-23 12:03:01,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:01,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 64 states. [2018-11-23 12:03:01,695 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 12:03:01,695 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 12:03:01,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:01,696 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-11-23 12:03:01,696 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-11-23 12:03:01,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:01,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:01,697 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 12:03:01,697 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 12:03:01,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:01,698 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-11-23 12:03:01,699 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-11-23 12:03:01,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:01,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:01,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:01,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:01,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 12:03:01,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-11-23 12:03:01,701 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 56 [2018-11-23 12:03:01,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:01,701 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2018-11-23 12:03:01,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:03:01,701 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-11-23 12:03:01,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 12:03:01,702 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:01,702 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 12:03:01,702 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:01,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:01,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1004884582, now seen corresponding path program 14 times [2018-11-23 12:03:01,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:01,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:01,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:01,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:03:01,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:02,336 INFO L256 TraceCheckUtils]: 0: Hoare triple {5837#true} call ULTIMATE.init(); {5837#true} is VALID [2018-11-23 12:03:02,336 INFO L273 TraceCheckUtils]: 1: Hoare triple {5837#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5837#true} is VALID [2018-11-23 12:03:02,337 INFO L273 TraceCheckUtils]: 2: Hoare triple {5837#true} assume true; {5837#true} is VALID [2018-11-23 12:03:02,337 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5837#true} {5837#true} #74#return; {5837#true} is VALID [2018-11-23 12:03:02,337 INFO L256 TraceCheckUtils]: 4: Hoare triple {5837#true} call #t~ret2 := main(); {5837#true} is VALID [2018-11-23 12:03:02,338 INFO L273 TraceCheckUtils]: 5: Hoare triple {5837#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5839#(= main_~i~0 0)} is VALID [2018-11-23 12:03:02,339 INFO L273 TraceCheckUtils]: 6: Hoare triple {5839#(= 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; {5840#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:02,339 INFO L273 TraceCheckUtils]: 7: Hoare triple {5840#(<= 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; {5841#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:02,340 INFO L273 TraceCheckUtils]: 8: Hoare triple {5841#(<= 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; {5842#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:02,341 INFO L273 TraceCheckUtils]: 9: Hoare triple {5842#(<= 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; {5843#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:02,342 INFO L273 TraceCheckUtils]: 10: Hoare triple {5843#(<= 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; {5844#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:02,343 INFO L273 TraceCheckUtils]: 11: Hoare triple {5844#(<= 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; {5845#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:02,344 INFO L273 TraceCheckUtils]: 12: Hoare triple {5845#(<= 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; {5846#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:02,345 INFO L273 TraceCheckUtils]: 13: Hoare triple {5846#(<= 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; {5847#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:02,346 INFO L273 TraceCheckUtils]: 14: Hoare triple {5847#(<= 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; {5848#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:02,347 INFO L273 TraceCheckUtils]: 15: Hoare triple {5848#(<= 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; {5849#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:02,348 INFO L273 TraceCheckUtils]: 16: Hoare triple {5849#(<= 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; {5850#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:02,348 INFO L273 TraceCheckUtils]: 17: Hoare triple {5850#(<= 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; {5851#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:02,349 INFO L273 TraceCheckUtils]: 18: Hoare triple {5851#(<= 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; {5852#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:02,350 INFO L273 TraceCheckUtils]: 19: Hoare triple {5852#(<= 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; {5853#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:02,351 INFO L273 TraceCheckUtils]: 20: Hoare triple {5853#(<= main_~i~0 14)} assume !(~i~0 < 100000); {5838#false} is VALID [2018-11-23 12:03:02,351 INFO L273 TraceCheckUtils]: 21: Hoare triple {5838#false} ~i~0 := 0; {5838#false} is VALID [2018-11-23 12:03:02,351 INFO L273 TraceCheckUtils]: 22: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,352 INFO L273 TraceCheckUtils]: 23: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,352 INFO L273 TraceCheckUtils]: 24: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,352 INFO L273 TraceCheckUtils]: 25: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,352 INFO L273 TraceCheckUtils]: 26: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,352 INFO L273 TraceCheckUtils]: 27: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,353 INFO L273 TraceCheckUtils]: 28: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,353 INFO L273 TraceCheckUtils]: 29: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,353 INFO L273 TraceCheckUtils]: 30: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,353 INFO L273 TraceCheckUtils]: 31: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,353 INFO L273 TraceCheckUtils]: 32: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,353 INFO L273 TraceCheckUtils]: 33: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,354 INFO L273 TraceCheckUtils]: 34: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,354 INFO L273 TraceCheckUtils]: 35: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,354 INFO L273 TraceCheckUtils]: 36: Hoare triple {5838#false} assume !(~i~0 < 100000); {5838#false} is VALID [2018-11-23 12:03:02,354 INFO L273 TraceCheckUtils]: 37: Hoare triple {5838#false} ~i~0 := 0; {5838#false} is VALID [2018-11-23 12:03:02,354 INFO L273 TraceCheckUtils]: 38: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,355 INFO L273 TraceCheckUtils]: 39: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,355 INFO L273 TraceCheckUtils]: 40: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,355 INFO L273 TraceCheckUtils]: 41: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,355 INFO L273 TraceCheckUtils]: 42: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,355 INFO L273 TraceCheckUtils]: 43: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,355 INFO L273 TraceCheckUtils]: 44: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,355 INFO L273 TraceCheckUtils]: 45: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,356 INFO L273 TraceCheckUtils]: 46: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,356 INFO L273 TraceCheckUtils]: 47: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,356 INFO L273 TraceCheckUtils]: 48: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,356 INFO L273 TraceCheckUtils]: 49: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,356 INFO L273 TraceCheckUtils]: 50: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,356 INFO L273 TraceCheckUtils]: 51: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,356 INFO L273 TraceCheckUtils]: 52: Hoare triple {5838#false} assume !(~i~0 < 100000); {5838#false} is VALID [2018-11-23 12:03:02,356 INFO L273 TraceCheckUtils]: 53: Hoare triple {5838#false} havoc ~x~0;~x~0 := 0; {5838#false} is VALID [2018-11-23 12:03:02,357 INFO L273 TraceCheckUtils]: 54: Hoare triple {5838#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5838#false} is VALID [2018-11-23 12:03:02,357 INFO L256 TraceCheckUtils]: 55: Hoare triple {5838#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {5838#false} is VALID [2018-11-23 12:03:02,357 INFO L273 TraceCheckUtils]: 56: Hoare triple {5838#false} ~cond := #in~cond; {5838#false} is VALID [2018-11-23 12:03:02,357 INFO L273 TraceCheckUtils]: 57: Hoare triple {5838#false} assume 0 == ~cond; {5838#false} is VALID [2018-11-23 12:03:02,357 INFO L273 TraceCheckUtils]: 58: Hoare triple {5838#false} assume !false; {5838#false} is VALID [2018-11-23 12:03:02,359 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 12:03:02,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:02,359 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:02,370 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:03:02,408 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:03:02,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:02,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:02,695 INFO L256 TraceCheckUtils]: 0: Hoare triple {5837#true} call ULTIMATE.init(); {5837#true} is VALID [2018-11-23 12:03:02,695 INFO L273 TraceCheckUtils]: 1: Hoare triple {5837#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5837#true} is VALID [2018-11-23 12:03:02,696 INFO L273 TraceCheckUtils]: 2: Hoare triple {5837#true} assume true; {5837#true} is VALID [2018-11-23 12:03:02,696 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5837#true} {5837#true} #74#return; {5837#true} is VALID [2018-11-23 12:03:02,696 INFO L256 TraceCheckUtils]: 4: Hoare triple {5837#true} call #t~ret2 := main(); {5837#true} is VALID [2018-11-23 12:03:02,697 INFO L273 TraceCheckUtils]: 5: Hoare triple {5837#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5872#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:02,698 INFO L273 TraceCheckUtils]: 6: Hoare triple {5872#(<= 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; {5840#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:02,698 INFO L273 TraceCheckUtils]: 7: Hoare triple {5840#(<= 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; {5841#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:02,699 INFO L273 TraceCheckUtils]: 8: Hoare triple {5841#(<= 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; {5842#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:02,699 INFO L273 TraceCheckUtils]: 9: Hoare triple {5842#(<= 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; {5843#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:02,700 INFO L273 TraceCheckUtils]: 10: Hoare triple {5843#(<= 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; {5844#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:02,701 INFO L273 TraceCheckUtils]: 11: Hoare triple {5844#(<= 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; {5845#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:02,701 INFO L273 TraceCheckUtils]: 12: Hoare triple {5845#(<= 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; {5846#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:02,702 INFO L273 TraceCheckUtils]: 13: Hoare triple {5846#(<= 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; {5847#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:02,703 INFO L273 TraceCheckUtils]: 14: Hoare triple {5847#(<= 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; {5848#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:02,704 INFO L273 TraceCheckUtils]: 15: Hoare triple {5848#(<= 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; {5849#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:02,705 INFO L273 TraceCheckUtils]: 16: Hoare triple {5849#(<= 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; {5850#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:02,706 INFO L273 TraceCheckUtils]: 17: Hoare triple {5850#(<= 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; {5851#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:02,707 INFO L273 TraceCheckUtils]: 18: Hoare triple {5851#(<= 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; {5852#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:02,708 INFO L273 TraceCheckUtils]: 19: Hoare triple {5852#(<= 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; {5853#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:02,709 INFO L273 TraceCheckUtils]: 20: Hoare triple {5853#(<= main_~i~0 14)} assume !(~i~0 < 100000); {5838#false} is VALID [2018-11-23 12:03:02,709 INFO L273 TraceCheckUtils]: 21: Hoare triple {5838#false} ~i~0 := 0; {5838#false} is VALID [2018-11-23 12:03:02,709 INFO L273 TraceCheckUtils]: 22: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,709 INFO L273 TraceCheckUtils]: 23: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,709 INFO L273 TraceCheckUtils]: 24: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,710 INFO L273 TraceCheckUtils]: 25: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,710 INFO L273 TraceCheckUtils]: 26: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,710 INFO L273 TraceCheckUtils]: 27: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,710 INFO L273 TraceCheckUtils]: 28: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,710 INFO L273 TraceCheckUtils]: 29: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,711 INFO L273 TraceCheckUtils]: 30: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,711 INFO L273 TraceCheckUtils]: 31: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,711 INFO L273 TraceCheckUtils]: 32: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,711 INFO L273 TraceCheckUtils]: 33: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,711 INFO L273 TraceCheckUtils]: 34: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,712 INFO L273 TraceCheckUtils]: 35: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,712 INFO L273 TraceCheckUtils]: 36: Hoare triple {5838#false} assume !(~i~0 < 100000); {5838#false} is VALID [2018-11-23 12:03:02,712 INFO L273 TraceCheckUtils]: 37: Hoare triple {5838#false} ~i~0 := 0; {5838#false} is VALID [2018-11-23 12:03:02,712 INFO L273 TraceCheckUtils]: 38: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,712 INFO L273 TraceCheckUtils]: 39: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,713 INFO L273 TraceCheckUtils]: 40: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,713 INFO L273 TraceCheckUtils]: 41: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,713 INFO L273 TraceCheckUtils]: 42: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,713 INFO L273 TraceCheckUtils]: 43: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,713 INFO L273 TraceCheckUtils]: 44: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,713 INFO L273 TraceCheckUtils]: 45: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,713 INFO L273 TraceCheckUtils]: 46: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,713 INFO L273 TraceCheckUtils]: 47: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,714 INFO L273 TraceCheckUtils]: 48: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,714 INFO L273 TraceCheckUtils]: 49: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,714 INFO L273 TraceCheckUtils]: 50: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,714 INFO L273 TraceCheckUtils]: 51: Hoare triple {5838#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5838#false} is VALID [2018-11-23 12:03:02,714 INFO L273 TraceCheckUtils]: 52: Hoare triple {5838#false} assume !(~i~0 < 100000); {5838#false} is VALID [2018-11-23 12:03:02,714 INFO L273 TraceCheckUtils]: 53: Hoare triple {5838#false} havoc ~x~0;~x~0 := 0; {5838#false} is VALID [2018-11-23 12:03:02,714 INFO L273 TraceCheckUtils]: 54: Hoare triple {5838#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5838#false} is VALID [2018-11-23 12:03:02,714 INFO L256 TraceCheckUtils]: 55: Hoare triple {5838#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {5838#false} is VALID [2018-11-23 12:03:02,714 INFO L273 TraceCheckUtils]: 56: Hoare triple {5838#false} ~cond := #in~cond; {5838#false} is VALID [2018-11-23 12:03:02,715 INFO L273 TraceCheckUtils]: 57: Hoare triple {5838#false} assume 0 == ~cond; {5838#false} is VALID [2018-11-23 12:03:02,715 INFO L273 TraceCheckUtils]: 58: Hoare triple {5838#false} assume !false; {5838#false} is VALID [2018-11-23 12:03:02,716 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 12:03:02,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:02,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:03:02,736 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 59 [2018-11-23 12:03:02,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:02,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:03:02,761 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:02,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:03:02,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:03:02,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:03:02,762 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 18 states. [2018-11-23 12:03:03,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:03,208 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2018-11-23 12:03:03,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:03:03,209 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 59 [2018-11-23 12:03:03,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:03,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:03:03,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 90 transitions. [2018-11-23 12:03:03,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:03:03,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 90 transitions. [2018-11-23 12:03:03,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 90 transitions. [2018-11-23 12:03:03,705 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:03,706 INFO L225 Difference]: With dead ends: 110 [2018-11-23 12:03:03,706 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 12:03:03,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:03:03,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 12:03:03,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-23 12:03:03,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:03,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 67 states. [2018-11-23 12:03:03,900 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-23 12:03:03,901 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-23 12:03:03,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:03,903 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-11-23 12:03:03,903 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-11-23 12:03:03,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:03,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:03,903 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-23 12:03:03,904 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-23 12:03:03,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:03,906 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-11-23 12:03:03,906 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-11-23 12:03:03,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:03,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:03,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:03,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:03,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 12:03:03,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2018-11-23 12:03:03,909 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 59 [2018-11-23 12:03:03,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:03,910 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-11-23 12:03:03,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:03:03,910 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-11-23 12:03:03,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 12:03:03,911 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:03,911 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 12:03:03,911 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:03,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:03,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1390483167, now seen corresponding path program 15 times [2018-11-23 12:03:03,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:03,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:03,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:03,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:03,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:04,496 INFO L256 TraceCheckUtils]: 0: Hoare triple {6485#true} call ULTIMATE.init(); {6485#true} is VALID [2018-11-23 12:03:04,497 INFO L273 TraceCheckUtils]: 1: Hoare triple {6485#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6485#true} is VALID [2018-11-23 12:03:04,497 INFO L273 TraceCheckUtils]: 2: Hoare triple {6485#true} assume true; {6485#true} is VALID [2018-11-23 12:03:04,497 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6485#true} {6485#true} #74#return; {6485#true} is VALID [2018-11-23 12:03:04,498 INFO L256 TraceCheckUtils]: 4: Hoare triple {6485#true} call #t~ret2 := main(); {6485#true} is VALID [2018-11-23 12:03:04,498 INFO L273 TraceCheckUtils]: 5: Hoare triple {6485#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6487#(= main_~i~0 0)} is VALID [2018-11-23 12:03:04,499 INFO L273 TraceCheckUtils]: 6: Hoare triple {6487#(= 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; {6488#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:04,500 INFO L273 TraceCheckUtils]: 7: Hoare triple {6488#(<= 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; {6489#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:04,500 INFO L273 TraceCheckUtils]: 8: Hoare triple {6489#(<= 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; {6490#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:04,501 INFO L273 TraceCheckUtils]: 9: Hoare triple {6490#(<= 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; {6491#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:04,501 INFO L273 TraceCheckUtils]: 10: Hoare triple {6491#(<= 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; {6492#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:04,502 INFO L273 TraceCheckUtils]: 11: Hoare triple {6492#(<= 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; {6493#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:04,503 INFO L273 TraceCheckUtils]: 12: Hoare triple {6493#(<= 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; {6494#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:04,504 INFO L273 TraceCheckUtils]: 13: Hoare triple {6494#(<= 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; {6495#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:04,505 INFO L273 TraceCheckUtils]: 14: Hoare triple {6495#(<= 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; {6496#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:04,506 INFO L273 TraceCheckUtils]: 15: Hoare triple {6496#(<= 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; {6497#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:04,507 INFO L273 TraceCheckUtils]: 16: Hoare triple {6497#(<= 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; {6498#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:04,508 INFO L273 TraceCheckUtils]: 17: Hoare triple {6498#(<= 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; {6499#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:04,509 INFO L273 TraceCheckUtils]: 18: Hoare triple {6499#(<= 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; {6500#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:04,510 INFO L273 TraceCheckUtils]: 19: Hoare triple {6500#(<= 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; {6501#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:04,511 INFO L273 TraceCheckUtils]: 20: Hoare triple {6501#(<= 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; {6502#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:04,512 INFO L273 TraceCheckUtils]: 21: Hoare triple {6502#(<= main_~i~0 15)} assume !(~i~0 < 100000); {6486#false} is VALID [2018-11-23 12:03:04,512 INFO L273 TraceCheckUtils]: 22: Hoare triple {6486#false} ~i~0 := 0; {6486#false} is VALID [2018-11-23 12:03:04,513 INFO L273 TraceCheckUtils]: 23: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:04,513 INFO L273 TraceCheckUtils]: 24: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:04,513 INFO L273 TraceCheckUtils]: 25: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:04,513 INFO L273 TraceCheckUtils]: 26: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:04,514 INFO L273 TraceCheckUtils]: 27: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:04,514 INFO L273 TraceCheckUtils]: 28: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:04,514 INFO L273 TraceCheckUtils]: 29: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:04,514 INFO L273 TraceCheckUtils]: 30: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:04,515 INFO L273 TraceCheckUtils]: 31: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:04,515 INFO L273 TraceCheckUtils]: 32: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:04,515 INFO L273 TraceCheckUtils]: 33: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:04,515 INFO L273 TraceCheckUtils]: 34: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:04,516 INFO L273 TraceCheckUtils]: 35: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:04,516 INFO L273 TraceCheckUtils]: 36: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:04,516 INFO L273 TraceCheckUtils]: 37: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:04,516 INFO L273 TraceCheckUtils]: 38: Hoare triple {6486#false} assume !(~i~0 < 100000); {6486#false} is VALID [2018-11-23 12:03:04,516 INFO L273 TraceCheckUtils]: 39: Hoare triple {6486#false} ~i~0 := 0; {6486#false} is VALID [2018-11-23 12:03:04,517 INFO L273 TraceCheckUtils]: 40: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:04,517 INFO L273 TraceCheckUtils]: 41: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:04,517 INFO L273 TraceCheckUtils]: 42: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:04,517 INFO L273 TraceCheckUtils]: 43: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:04,517 INFO L273 TraceCheckUtils]: 44: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:04,517 INFO L273 TraceCheckUtils]: 45: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:04,517 INFO L273 TraceCheckUtils]: 46: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:04,518 INFO L273 TraceCheckUtils]: 47: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:04,518 INFO L273 TraceCheckUtils]: 48: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:04,518 INFO L273 TraceCheckUtils]: 49: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:04,518 INFO L273 TraceCheckUtils]: 50: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:04,518 INFO L273 TraceCheckUtils]: 51: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:04,518 INFO L273 TraceCheckUtils]: 52: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:04,518 INFO L273 TraceCheckUtils]: 53: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:04,519 INFO L273 TraceCheckUtils]: 54: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:04,519 INFO L273 TraceCheckUtils]: 55: Hoare triple {6486#false} assume !(~i~0 < 100000); {6486#false} is VALID [2018-11-23 12:03:04,519 INFO L273 TraceCheckUtils]: 56: Hoare triple {6486#false} havoc ~x~0;~x~0 := 0; {6486#false} is VALID [2018-11-23 12:03:04,519 INFO L273 TraceCheckUtils]: 57: Hoare triple {6486#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6486#false} is VALID [2018-11-23 12:03:04,519 INFO L256 TraceCheckUtils]: 58: Hoare triple {6486#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {6486#false} is VALID [2018-11-23 12:03:04,519 INFO L273 TraceCheckUtils]: 59: Hoare triple {6486#false} ~cond := #in~cond; {6486#false} is VALID [2018-11-23 12:03:04,520 INFO L273 TraceCheckUtils]: 60: Hoare triple {6486#false} assume 0 == ~cond; {6486#false} is VALID [2018-11-23 12:03:04,520 INFO L273 TraceCheckUtils]: 61: Hoare triple {6486#false} assume !false; {6486#false} is VALID [2018-11-23 12:03:04,523 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 12:03:04,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:04,524 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:04,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:03:08,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:03:08,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:08,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:09,240 INFO L256 TraceCheckUtils]: 0: Hoare triple {6485#true} call ULTIMATE.init(); {6485#true} is VALID [2018-11-23 12:03:09,241 INFO L273 TraceCheckUtils]: 1: Hoare triple {6485#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6485#true} is VALID [2018-11-23 12:03:09,241 INFO L273 TraceCheckUtils]: 2: Hoare triple {6485#true} assume true; {6485#true} is VALID [2018-11-23 12:03:09,241 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6485#true} {6485#true} #74#return; {6485#true} is VALID [2018-11-23 12:03:09,242 INFO L256 TraceCheckUtils]: 4: Hoare triple {6485#true} call #t~ret2 := main(); {6485#true} is VALID [2018-11-23 12:03:09,242 INFO L273 TraceCheckUtils]: 5: Hoare triple {6485#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6521#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:09,243 INFO L273 TraceCheckUtils]: 6: Hoare triple {6521#(<= 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; {6488#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:09,244 INFO L273 TraceCheckUtils]: 7: Hoare triple {6488#(<= 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; {6489#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:09,244 INFO L273 TraceCheckUtils]: 8: Hoare triple {6489#(<= 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; {6490#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:09,245 INFO L273 TraceCheckUtils]: 9: Hoare triple {6490#(<= 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; {6491#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:09,246 INFO L273 TraceCheckUtils]: 10: Hoare triple {6491#(<= 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; {6492#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:09,246 INFO L273 TraceCheckUtils]: 11: Hoare triple {6492#(<= 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; {6493#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:09,247 INFO L273 TraceCheckUtils]: 12: Hoare triple {6493#(<= 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; {6494#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:09,248 INFO L273 TraceCheckUtils]: 13: Hoare triple {6494#(<= 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; {6495#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:09,249 INFO L273 TraceCheckUtils]: 14: Hoare triple {6495#(<= 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; {6496#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:09,250 INFO L273 TraceCheckUtils]: 15: Hoare triple {6496#(<= 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; {6497#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:09,251 INFO L273 TraceCheckUtils]: 16: Hoare triple {6497#(<= 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; {6498#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:09,252 INFO L273 TraceCheckUtils]: 17: Hoare triple {6498#(<= 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; {6499#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:09,253 INFO L273 TraceCheckUtils]: 18: Hoare triple {6499#(<= 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; {6500#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:09,253 INFO L273 TraceCheckUtils]: 19: Hoare triple {6500#(<= 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; {6501#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:09,254 INFO L273 TraceCheckUtils]: 20: Hoare triple {6501#(<= 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; {6502#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:09,255 INFO L273 TraceCheckUtils]: 21: Hoare triple {6502#(<= main_~i~0 15)} assume !(~i~0 < 100000); {6486#false} is VALID [2018-11-23 12:03:09,255 INFO L273 TraceCheckUtils]: 22: Hoare triple {6486#false} ~i~0 := 0; {6486#false} is VALID [2018-11-23 12:03:09,255 INFO L273 TraceCheckUtils]: 23: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:09,256 INFO L273 TraceCheckUtils]: 24: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:09,256 INFO L273 TraceCheckUtils]: 25: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:09,256 INFO L273 TraceCheckUtils]: 26: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:09,256 INFO L273 TraceCheckUtils]: 27: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:09,256 INFO L273 TraceCheckUtils]: 28: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:09,257 INFO L273 TraceCheckUtils]: 29: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:09,257 INFO L273 TraceCheckUtils]: 30: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:09,257 INFO L273 TraceCheckUtils]: 31: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:09,257 INFO L273 TraceCheckUtils]: 32: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:09,257 INFO L273 TraceCheckUtils]: 33: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:09,258 INFO L273 TraceCheckUtils]: 34: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:09,258 INFO L273 TraceCheckUtils]: 35: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:09,258 INFO L273 TraceCheckUtils]: 36: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:09,258 INFO L273 TraceCheckUtils]: 37: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:09,258 INFO L273 TraceCheckUtils]: 38: Hoare triple {6486#false} assume !(~i~0 < 100000); {6486#false} is VALID [2018-11-23 12:03:09,259 INFO L273 TraceCheckUtils]: 39: Hoare triple {6486#false} ~i~0 := 0; {6486#false} is VALID [2018-11-23 12:03:09,259 INFO L273 TraceCheckUtils]: 40: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:09,259 INFO L273 TraceCheckUtils]: 41: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:09,259 INFO L273 TraceCheckUtils]: 42: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:09,259 INFO L273 TraceCheckUtils]: 43: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:09,260 INFO L273 TraceCheckUtils]: 44: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:09,260 INFO L273 TraceCheckUtils]: 45: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:09,260 INFO L273 TraceCheckUtils]: 46: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:09,260 INFO L273 TraceCheckUtils]: 47: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:09,260 INFO L273 TraceCheckUtils]: 48: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:09,260 INFO L273 TraceCheckUtils]: 49: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:09,261 INFO L273 TraceCheckUtils]: 50: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:09,261 INFO L273 TraceCheckUtils]: 51: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:09,261 INFO L273 TraceCheckUtils]: 52: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:09,261 INFO L273 TraceCheckUtils]: 53: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:09,261 INFO L273 TraceCheckUtils]: 54: Hoare triple {6486#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#false} is VALID [2018-11-23 12:03:09,261 INFO L273 TraceCheckUtils]: 55: Hoare triple {6486#false} assume !(~i~0 < 100000); {6486#false} is VALID [2018-11-23 12:03:09,262 INFO L273 TraceCheckUtils]: 56: Hoare triple {6486#false} havoc ~x~0;~x~0 := 0; {6486#false} is VALID [2018-11-23 12:03:09,262 INFO L273 TraceCheckUtils]: 57: Hoare triple {6486#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6486#false} is VALID [2018-11-23 12:03:09,262 INFO L256 TraceCheckUtils]: 58: Hoare triple {6486#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {6486#false} is VALID [2018-11-23 12:03:09,262 INFO L273 TraceCheckUtils]: 59: Hoare triple {6486#false} ~cond := #in~cond; {6486#false} is VALID [2018-11-23 12:03:09,262 INFO L273 TraceCheckUtils]: 60: Hoare triple {6486#false} assume 0 == ~cond; {6486#false} is VALID [2018-11-23 12:03:09,262 INFO L273 TraceCheckUtils]: 61: Hoare triple {6486#false} assume !false; {6486#false} is VALID [2018-11-23 12:03:09,265 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 12:03:09,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:09,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 12:03:09,291 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 62 [2018-11-23 12:03:09,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:09,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:03:09,323 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:09,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:03:09,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:03:09,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:03:09,325 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 19 states. [2018-11-23 12:03:09,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:09,785 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2018-11-23 12:03:09,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 12:03:09,785 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 62 [2018-11-23 12:03:09,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:09,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:03:09,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 93 transitions. [2018-11-23 12:03:09,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:03:09,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 93 transitions. [2018-11-23 12:03:09,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 93 transitions. [2018-11-23 12:03:10,296 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 12:03:10,298 INFO L225 Difference]: With dead ends: 115 [2018-11-23 12:03:10,299 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 12:03:10,299 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 12:03:10,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 12:03:10,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-23 12:03:10,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:10,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2018-11-23 12:03:10,421 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2018-11-23 12:03:10,421 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2018-11-23 12:03:10,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:10,424 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-11-23 12:03:10,425 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-11-23 12:03:10,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:10,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:10,425 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2018-11-23 12:03:10,425 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2018-11-23 12:03:10,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:10,427 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-11-23 12:03:10,427 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-11-23 12:03:10,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:10,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:10,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:10,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:10,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 12:03:10,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-11-23 12:03:10,429 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 62 [2018-11-23 12:03:10,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:10,430 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-11-23 12:03:10,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:03:10,430 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-11-23 12:03:10,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 12:03:10,431 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:10,431 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 12:03:10,431 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:10,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:10,432 INFO L82 PathProgramCache]: Analyzing trace with hash 2125345850, now seen corresponding path program 16 times [2018-11-23 12:03:10,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:10,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:10,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:10,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:10,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:10,899 INFO L256 TraceCheckUtils]: 0: Hoare triple {7165#true} call ULTIMATE.init(); {7165#true} is VALID [2018-11-23 12:03:10,900 INFO L273 TraceCheckUtils]: 1: Hoare triple {7165#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7165#true} is VALID [2018-11-23 12:03:10,900 INFO L273 TraceCheckUtils]: 2: Hoare triple {7165#true} assume true; {7165#true} is VALID [2018-11-23 12:03:10,900 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7165#true} {7165#true} #74#return; {7165#true} is VALID [2018-11-23 12:03:10,901 INFO L256 TraceCheckUtils]: 4: Hoare triple {7165#true} call #t~ret2 := main(); {7165#true} is VALID [2018-11-23 12:03:10,901 INFO L273 TraceCheckUtils]: 5: Hoare triple {7165#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7167#(= main_~i~0 0)} is VALID [2018-11-23 12:03:10,902 INFO L273 TraceCheckUtils]: 6: Hoare triple {7167#(= 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; {7168#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:10,903 INFO L273 TraceCheckUtils]: 7: Hoare triple {7168#(<= 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; {7169#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:10,904 INFO L273 TraceCheckUtils]: 8: Hoare triple {7169#(<= 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; {7170#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:10,904 INFO L273 TraceCheckUtils]: 9: Hoare triple {7170#(<= 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; {7171#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:10,905 INFO L273 TraceCheckUtils]: 10: Hoare triple {7171#(<= 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; {7172#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:10,906 INFO L273 TraceCheckUtils]: 11: Hoare triple {7172#(<= 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; {7173#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:10,907 INFO L273 TraceCheckUtils]: 12: Hoare triple {7173#(<= 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; {7174#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:10,908 INFO L273 TraceCheckUtils]: 13: Hoare triple {7174#(<= 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; {7175#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:10,909 INFO L273 TraceCheckUtils]: 14: Hoare triple {7175#(<= 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; {7176#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:10,910 INFO L273 TraceCheckUtils]: 15: Hoare triple {7176#(<= 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; {7177#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:10,911 INFO L273 TraceCheckUtils]: 16: Hoare triple {7177#(<= 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; {7178#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:10,912 INFO L273 TraceCheckUtils]: 17: Hoare triple {7178#(<= 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; {7179#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:10,913 INFO L273 TraceCheckUtils]: 18: Hoare triple {7179#(<= 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; {7180#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:10,914 INFO L273 TraceCheckUtils]: 19: Hoare triple {7180#(<= 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; {7181#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:10,915 INFO L273 TraceCheckUtils]: 20: Hoare triple {7181#(<= 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; {7182#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:10,916 INFO L273 TraceCheckUtils]: 21: Hoare triple {7182#(<= 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; {7183#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:10,917 INFO L273 TraceCheckUtils]: 22: Hoare triple {7183#(<= main_~i~0 16)} assume !(~i~0 < 100000); {7166#false} is VALID [2018-11-23 12:03:10,917 INFO L273 TraceCheckUtils]: 23: Hoare triple {7166#false} ~i~0 := 0; {7166#false} is VALID [2018-11-23 12:03:10,918 INFO L273 TraceCheckUtils]: 24: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,918 INFO L273 TraceCheckUtils]: 25: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,918 INFO L273 TraceCheckUtils]: 26: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,919 INFO L273 TraceCheckUtils]: 27: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,919 INFO L273 TraceCheckUtils]: 28: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,919 INFO L273 TraceCheckUtils]: 29: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,920 INFO L273 TraceCheckUtils]: 30: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,920 INFO L273 TraceCheckUtils]: 31: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,920 INFO L273 TraceCheckUtils]: 32: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,920 INFO L273 TraceCheckUtils]: 33: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,921 INFO L273 TraceCheckUtils]: 34: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,921 INFO L273 TraceCheckUtils]: 35: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,921 INFO L273 TraceCheckUtils]: 36: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,921 INFO L273 TraceCheckUtils]: 37: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,921 INFO L273 TraceCheckUtils]: 38: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,922 INFO L273 TraceCheckUtils]: 39: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,922 INFO L273 TraceCheckUtils]: 40: Hoare triple {7166#false} assume !(~i~0 < 100000); {7166#false} is VALID [2018-11-23 12:03:10,922 INFO L273 TraceCheckUtils]: 41: Hoare triple {7166#false} ~i~0 := 0; {7166#false} is VALID [2018-11-23 12:03:10,922 INFO L273 TraceCheckUtils]: 42: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,922 INFO L273 TraceCheckUtils]: 43: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,922 INFO L273 TraceCheckUtils]: 44: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,922 INFO L273 TraceCheckUtils]: 45: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,923 INFO L273 TraceCheckUtils]: 46: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,923 INFO L273 TraceCheckUtils]: 47: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,923 INFO L273 TraceCheckUtils]: 48: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,923 INFO L273 TraceCheckUtils]: 49: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,923 INFO L273 TraceCheckUtils]: 50: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,923 INFO L273 TraceCheckUtils]: 51: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,923 INFO L273 TraceCheckUtils]: 52: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,924 INFO L273 TraceCheckUtils]: 53: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,924 INFO L273 TraceCheckUtils]: 54: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,924 INFO L273 TraceCheckUtils]: 55: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,924 INFO L273 TraceCheckUtils]: 56: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,924 INFO L273 TraceCheckUtils]: 57: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:10,924 INFO L273 TraceCheckUtils]: 58: Hoare triple {7166#false} assume !(~i~0 < 100000); {7166#false} is VALID [2018-11-23 12:03:10,924 INFO L273 TraceCheckUtils]: 59: Hoare triple {7166#false} havoc ~x~0;~x~0 := 0; {7166#false} is VALID [2018-11-23 12:03:10,925 INFO L273 TraceCheckUtils]: 60: Hoare triple {7166#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7166#false} is VALID [2018-11-23 12:03:10,925 INFO L256 TraceCheckUtils]: 61: Hoare triple {7166#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {7166#false} is VALID [2018-11-23 12:03:10,925 INFO L273 TraceCheckUtils]: 62: Hoare triple {7166#false} ~cond := #in~cond; {7166#false} is VALID [2018-11-23 12:03:10,925 INFO L273 TraceCheckUtils]: 63: Hoare triple {7166#false} assume 0 == ~cond; {7166#false} is VALID [2018-11-23 12:03:10,925 INFO L273 TraceCheckUtils]: 64: Hoare triple {7166#false} assume !false; {7166#false} is VALID [2018-11-23 12:03:10,929 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 12:03:10,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:10,930 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:10,938 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:03:10,985 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:03:10,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:11,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:11,181 INFO L256 TraceCheckUtils]: 0: Hoare triple {7165#true} call ULTIMATE.init(); {7165#true} is VALID [2018-11-23 12:03:11,182 INFO L273 TraceCheckUtils]: 1: Hoare triple {7165#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7165#true} is VALID [2018-11-23 12:03:11,182 INFO L273 TraceCheckUtils]: 2: Hoare triple {7165#true} assume true; {7165#true} is VALID [2018-11-23 12:03:11,182 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7165#true} {7165#true} #74#return; {7165#true} is VALID [2018-11-23 12:03:11,182 INFO L256 TraceCheckUtils]: 4: Hoare triple {7165#true} call #t~ret2 := main(); {7165#true} is VALID [2018-11-23 12:03:11,183 INFO L273 TraceCheckUtils]: 5: Hoare triple {7165#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7202#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:11,183 INFO L273 TraceCheckUtils]: 6: Hoare triple {7202#(<= 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; {7168#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:11,184 INFO L273 TraceCheckUtils]: 7: Hoare triple {7168#(<= 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; {7169#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:11,184 INFO L273 TraceCheckUtils]: 8: Hoare triple {7169#(<= 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; {7170#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:11,185 INFO L273 TraceCheckUtils]: 9: Hoare triple {7170#(<= 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; {7171#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:11,185 INFO L273 TraceCheckUtils]: 10: Hoare triple {7171#(<= 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; {7172#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:11,186 INFO L273 TraceCheckUtils]: 11: Hoare triple {7172#(<= 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; {7173#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:11,187 INFO L273 TraceCheckUtils]: 12: Hoare triple {7173#(<= 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; {7174#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:11,207 INFO L273 TraceCheckUtils]: 13: Hoare triple {7174#(<= 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; {7175#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:11,208 INFO L273 TraceCheckUtils]: 14: Hoare triple {7175#(<= 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; {7176#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:11,208 INFO L273 TraceCheckUtils]: 15: Hoare triple {7176#(<= 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; {7177#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:11,209 INFO L273 TraceCheckUtils]: 16: Hoare triple {7177#(<= 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; {7178#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:11,209 INFO L273 TraceCheckUtils]: 17: Hoare triple {7178#(<= 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; {7179#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:11,210 INFO L273 TraceCheckUtils]: 18: Hoare triple {7179#(<= 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; {7180#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:11,211 INFO L273 TraceCheckUtils]: 19: Hoare triple {7180#(<= 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; {7181#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:11,212 INFO L273 TraceCheckUtils]: 20: Hoare triple {7181#(<= 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; {7182#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:11,213 INFO L273 TraceCheckUtils]: 21: Hoare triple {7182#(<= 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; {7183#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:11,214 INFO L273 TraceCheckUtils]: 22: Hoare triple {7183#(<= main_~i~0 16)} assume !(~i~0 < 100000); {7166#false} is VALID [2018-11-23 12:03:11,214 INFO L273 TraceCheckUtils]: 23: Hoare triple {7166#false} ~i~0 := 0; {7166#false} is VALID [2018-11-23 12:03:11,214 INFO L273 TraceCheckUtils]: 24: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,214 INFO L273 TraceCheckUtils]: 25: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,215 INFO L273 TraceCheckUtils]: 26: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,215 INFO L273 TraceCheckUtils]: 27: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,215 INFO L273 TraceCheckUtils]: 28: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,215 INFO L273 TraceCheckUtils]: 29: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,215 INFO L273 TraceCheckUtils]: 30: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,216 INFO L273 TraceCheckUtils]: 31: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,216 INFO L273 TraceCheckUtils]: 32: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,216 INFO L273 TraceCheckUtils]: 33: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,216 INFO L273 TraceCheckUtils]: 34: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,216 INFO L273 TraceCheckUtils]: 35: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,217 INFO L273 TraceCheckUtils]: 36: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,217 INFO L273 TraceCheckUtils]: 37: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,217 INFO L273 TraceCheckUtils]: 38: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,217 INFO L273 TraceCheckUtils]: 39: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,217 INFO L273 TraceCheckUtils]: 40: Hoare triple {7166#false} assume !(~i~0 < 100000); {7166#false} is VALID [2018-11-23 12:03:11,218 INFO L273 TraceCheckUtils]: 41: Hoare triple {7166#false} ~i~0 := 0; {7166#false} is VALID [2018-11-23 12:03:11,218 INFO L273 TraceCheckUtils]: 42: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,218 INFO L273 TraceCheckUtils]: 43: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,218 INFO L273 TraceCheckUtils]: 44: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,218 INFO L273 TraceCheckUtils]: 45: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,219 INFO L273 TraceCheckUtils]: 46: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,219 INFO L273 TraceCheckUtils]: 47: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,219 INFO L273 TraceCheckUtils]: 48: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,219 INFO L273 TraceCheckUtils]: 49: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,219 INFO L273 TraceCheckUtils]: 50: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,219 INFO L273 TraceCheckUtils]: 51: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,219 INFO L273 TraceCheckUtils]: 52: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,219 INFO L273 TraceCheckUtils]: 53: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,220 INFO L273 TraceCheckUtils]: 54: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,220 INFO L273 TraceCheckUtils]: 55: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,220 INFO L273 TraceCheckUtils]: 56: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,220 INFO L273 TraceCheckUtils]: 57: Hoare triple {7166#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7166#false} is VALID [2018-11-23 12:03:11,220 INFO L273 TraceCheckUtils]: 58: Hoare triple {7166#false} assume !(~i~0 < 100000); {7166#false} is VALID [2018-11-23 12:03:11,220 INFO L273 TraceCheckUtils]: 59: Hoare triple {7166#false} havoc ~x~0;~x~0 := 0; {7166#false} is VALID [2018-11-23 12:03:11,220 INFO L273 TraceCheckUtils]: 60: Hoare triple {7166#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7166#false} is VALID [2018-11-23 12:03:11,220 INFO L256 TraceCheckUtils]: 61: Hoare triple {7166#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {7166#false} is VALID [2018-11-23 12:03:11,220 INFO L273 TraceCheckUtils]: 62: Hoare triple {7166#false} ~cond := #in~cond; {7166#false} is VALID [2018-11-23 12:03:11,221 INFO L273 TraceCheckUtils]: 63: Hoare triple {7166#false} assume 0 == ~cond; {7166#false} is VALID [2018-11-23 12:03:11,221 INFO L273 TraceCheckUtils]: 64: Hoare triple {7166#false} assume !false; {7166#false} is VALID [2018-11-23 12:03:11,223 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 12:03:11,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:11,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:03:11,242 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 65 [2018-11-23 12:03:11,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:11,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:03:11,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:11,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:03:11,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:03:11,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:03:11,272 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 20 states. [2018-11-23 12:03:11,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:11,857 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-11-23 12:03:11,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:03:11,857 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 65 [2018-11-23 12:03:11,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:11,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:03:11,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 96 transitions. [2018-11-23 12:03:11,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:03:11,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 96 transitions. [2018-11-23 12:03:11,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 96 transitions. [2018-11-23 12:03:12,023 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:12,024 INFO L225 Difference]: With dead ends: 120 [2018-11-23 12:03:12,024 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 12:03:12,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:03:12,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 12:03:12,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-11-23 12:03:12,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:12,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 73 states. [2018-11-23 12:03:12,086 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 73 states. [2018-11-23 12:03:12,086 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 73 states. [2018-11-23 12:03:12,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:12,088 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-11-23 12:03:12,089 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-11-23 12:03:12,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:12,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:12,089 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 73 states. [2018-11-23 12:03:12,090 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 73 states. [2018-11-23 12:03:12,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:12,091 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-11-23 12:03:12,091 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-11-23 12:03:12,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:12,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:12,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:12,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:12,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 12:03:12,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-11-23 12:03:12,093 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 65 [2018-11-23 12:03:12,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:12,093 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-11-23 12:03:12,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:03:12,093 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-11-23 12:03:12,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 12:03:12,094 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:12,094 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 12:03:12,094 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:12,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:12,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1332687359, now seen corresponding path program 17 times [2018-11-23 12:03:12,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:12,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:12,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:12,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:12,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:12,492 INFO L256 TraceCheckUtils]: 0: Hoare triple {7877#true} call ULTIMATE.init(); {7877#true} is VALID [2018-11-23 12:03:12,492 INFO L273 TraceCheckUtils]: 1: Hoare triple {7877#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7877#true} is VALID [2018-11-23 12:03:12,492 INFO L273 TraceCheckUtils]: 2: Hoare triple {7877#true} assume true; {7877#true} is VALID [2018-11-23 12:03:12,493 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7877#true} {7877#true} #74#return; {7877#true} is VALID [2018-11-23 12:03:12,493 INFO L256 TraceCheckUtils]: 4: Hoare triple {7877#true} call #t~ret2 := main(); {7877#true} is VALID [2018-11-23 12:03:12,493 INFO L273 TraceCheckUtils]: 5: Hoare triple {7877#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7879#(= main_~i~0 0)} is VALID [2018-11-23 12:03:12,494 INFO L273 TraceCheckUtils]: 6: Hoare triple {7879#(= 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; {7880#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:12,495 INFO L273 TraceCheckUtils]: 7: Hoare triple {7880#(<= 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; {7881#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:12,496 INFO L273 TraceCheckUtils]: 8: Hoare triple {7881#(<= 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; {7882#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:12,497 INFO L273 TraceCheckUtils]: 9: Hoare triple {7882#(<= 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; {7883#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:12,498 INFO L273 TraceCheckUtils]: 10: Hoare triple {7883#(<= 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; {7884#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:12,499 INFO L273 TraceCheckUtils]: 11: Hoare triple {7884#(<= 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; {7885#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:12,500 INFO L273 TraceCheckUtils]: 12: Hoare triple {7885#(<= 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; {7886#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:12,501 INFO L273 TraceCheckUtils]: 13: Hoare triple {7886#(<= 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; {7887#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:12,502 INFO L273 TraceCheckUtils]: 14: Hoare triple {7887#(<= 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; {7888#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:12,503 INFO L273 TraceCheckUtils]: 15: Hoare triple {7888#(<= 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; {7889#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:12,504 INFO L273 TraceCheckUtils]: 16: Hoare triple {7889#(<= 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; {7890#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:12,505 INFO L273 TraceCheckUtils]: 17: Hoare triple {7890#(<= 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; {7891#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:12,506 INFO L273 TraceCheckUtils]: 18: Hoare triple {7891#(<= 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; {7892#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:12,506 INFO L273 TraceCheckUtils]: 19: Hoare triple {7892#(<= 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; {7893#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:12,507 INFO L273 TraceCheckUtils]: 20: Hoare triple {7893#(<= 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; {7894#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:12,508 INFO L273 TraceCheckUtils]: 21: Hoare triple {7894#(<= 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; {7895#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:12,509 INFO L273 TraceCheckUtils]: 22: Hoare triple {7895#(<= 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; {7896#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:12,510 INFO L273 TraceCheckUtils]: 23: Hoare triple {7896#(<= main_~i~0 17)} assume !(~i~0 < 100000); {7878#false} is VALID [2018-11-23 12:03:12,510 INFO L273 TraceCheckUtils]: 24: Hoare triple {7878#false} ~i~0 := 0; {7878#false} is VALID [2018-11-23 12:03:12,510 INFO L273 TraceCheckUtils]: 25: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,511 INFO L273 TraceCheckUtils]: 26: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,511 INFO L273 TraceCheckUtils]: 27: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,511 INFO L273 TraceCheckUtils]: 28: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,511 INFO L273 TraceCheckUtils]: 29: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,511 INFO L273 TraceCheckUtils]: 30: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,512 INFO L273 TraceCheckUtils]: 31: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,512 INFO L273 TraceCheckUtils]: 32: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,512 INFO L273 TraceCheckUtils]: 33: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,512 INFO L273 TraceCheckUtils]: 34: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,512 INFO L273 TraceCheckUtils]: 35: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,513 INFO L273 TraceCheckUtils]: 36: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,513 INFO L273 TraceCheckUtils]: 37: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,513 INFO L273 TraceCheckUtils]: 38: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,513 INFO L273 TraceCheckUtils]: 39: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,513 INFO L273 TraceCheckUtils]: 40: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,514 INFO L273 TraceCheckUtils]: 41: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,514 INFO L273 TraceCheckUtils]: 42: Hoare triple {7878#false} assume !(~i~0 < 100000); {7878#false} is VALID [2018-11-23 12:03:12,514 INFO L273 TraceCheckUtils]: 43: Hoare triple {7878#false} ~i~0 := 0; {7878#false} is VALID [2018-11-23 12:03:12,514 INFO L273 TraceCheckUtils]: 44: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,514 INFO L273 TraceCheckUtils]: 45: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,514 INFO L273 TraceCheckUtils]: 46: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,515 INFO L273 TraceCheckUtils]: 47: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,515 INFO L273 TraceCheckUtils]: 48: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,515 INFO L273 TraceCheckUtils]: 49: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,515 INFO L273 TraceCheckUtils]: 50: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,515 INFO L273 TraceCheckUtils]: 51: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,515 INFO L273 TraceCheckUtils]: 52: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,515 INFO L273 TraceCheckUtils]: 53: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,515 INFO L273 TraceCheckUtils]: 54: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,515 INFO L273 TraceCheckUtils]: 55: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,516 INFO L273 TraceCheckUtils]: 56: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,516 INFO L273 TraceCheckUtils]: 57: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,516 INFO L273 TraceCheckUtils]: 58: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,516 INFO L273 TraceCheckUtils]: 59: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,516 INFO L273 TraceCheckUtils]: 60: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:12,516 INFO L273 TraceCheckUtils]: 61: Hoare triple {7878#false} assume !(~i~0 < 100000); {7878#false} is VALID [2018-11-23 12:03:12,516 INFO L273 TraceCheckUtils]: 62: Hoare triple {7878#false} havoc ~x~0;~x~0 := 0; {7878#false} is VALID [2018-11-23 12:03:12,516 INFO L273 TraceCheckUtils]: 63: Hoare triple {7878#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7878#false} is VALID [2018-11-23 12:03:12,516 INFO L256 TraceCheckUtils]: 64: Hoare triple {7878#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {7878#false} is VALID [2018-11-23 12:03:12,517 INFO L273 TraceCheckUtils]: 65: Hoare triple {7878#false} ~cond := #in~cond; {7878#false} is VALID [2018-11-23 12:03:12,517 INFO L273 TraceCheckUtils]: 66: Hoare triple {7878#false} assume 0 == ~cond; {7878#false} is VALID [2018-11-23 12:03:12,517 INFO L273 TraceCheckUtils]: 67: Hoare triple {7878#false} assume !false; {7878#false} is VALID [2018-11-23 12:03:12,519 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 12:03:12,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:12,519 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:12,529 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:03:56,020 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-23 12:03:56,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:56,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:56,240 INFO L256 TraceCheckUtils]: 0: Hoare triple {7877#true} call ULTIMATE.init(); {7877#true} is VALID [2018-11-23 12:03:56,240 INFO L273 TraceCheckUtils]: 1: Hoare triple {7877#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7877#true} is VALID [2018-11-23 12:03:56,241 INFO L273 TraceCheckUtils]: 2: Hoare triple {7877#true} assume true; {7877#true} is VALID [2018-11-23 12:03:56,241 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7877#true} {7877#true} #74#return; {7877#true} is VALID [2018-11-23 12:03:56,241 INFO L256 TraceCheckUtils]: 4: Hoare triple {7877#true} call #t~ret2 := main(); {7877#true} is VALID [2018-11-23 12:03:56,242 INFO L273 TraceCheckUtils]: 5: Hoare triple {7877#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7915#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:56,242 INFO L273 TraceCheckUtils]: 6: Hoare triple {7915#(<= 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; {7880#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:56,243 INFO L273 TraceCheckUtils]: 7: Hoare triple {7880#(<= 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; {7881#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:56,244 INFO L273 TraceCheckUtils]: 8: Hoare triple {7881#(<= 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; {7882#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:56,244 INFO L273 TraceCheckUtils]: 9: Hoare triple {7882#(<= 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; {7883#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:56,245 INFO L273 TraceCheckUtils]: 10: Hoare triple {7883#(<= 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; {7884#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:56,246 INFO L273 TraceCheckUtils]: 11: Hoare triple {7884#(<= 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; {7885#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:56,246 INFO L273 TraceCheckUtils]: 12: Hoare triple {7885#(<= 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; {7886#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:56,247 INFO L273 TraceCheckUtils]: 13: Hoare triple {7886#(<= 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; {7887#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:56,248 INFO L273 TraceCheckUtils]: 14: Hoare triple {7887#(<= 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; {7888#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:56,249 INFO L273 TraceCheckUtils]: 15: Hoare triple {7888#(<= 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; {7889#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:56,250 INFO L273 TraceCheckUtils]: 16: Hoare triple {7889#(<= 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; {7890#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:56,251 INFO L273 TraceCheckUtils]: 17: Hoare triple {7890#(<= 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; {7891#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:56,252 INFO L273 TraceCheckUtils]: 18: Hoare triple {7891#(<= 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; {7892#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:56,253 INFO L273 TraceCheckUtils]: 19: Hoare triple {7892#(<= 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; {7893#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:56,254 INFO L273 TraceCheckUtils]: 20: Hoare triple {7893#(<= 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; {7894#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:56,255 INFO L273 TraceCheckUtils]: 21: Hoare triple {7894#(<= 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; {7895#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:56,256 INFO L273 TraceCheckUtils]: 22: Hoare triple {7895#(<= 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; {7896#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:56,257 INFO L273 TraceCheckUtils]: 23: Hoare triple {7896#(<= main_~i~0 17)} assume !(~i~0 < 100000); {7878#false} is VALID [2018-11-23 12:03:56,257 INFO L273 TraceCheckUtils]: 24: Hoare triple {7878#false} ~i~0 := 0; {7878#false} is VALID [2018-11-23 12:03:56,257 INFO L273 TraceCheckUtils]: 25: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,257 INFO L273 TraceCheckUtils]: 26: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,257 INFO L273 TraceCheckUtils]: 27: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,258 INFO L273 TraceCheckUtils]: 28: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,258 INFO L273 TraceCheckUtils]: 29: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,258 INFO L273 TraceCheckUtils]: 30: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,258 INFO L273 TraceCheckUtils]: 31: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,258 INFO L273 TraceCheckUtils]: 32: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,259 INFO L273 TraceCheckUtils]: 33: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,259 INFO L273 TraceCheckUtils]: 34: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,259 INFO L273 TraceCheckUtils]: 35: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,259 INFO L273 TraceCheckUtils]: 36: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,259 INFO L273 TraceCheckUtils]: 37: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,260 INFO L273 TraceCheckUtils]: 38: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,260 INFO L273 TraceCheckUtils]: 39: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,260 INFO L273 TraceCheckUtils]: 40: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,260 INFO L273 TraceCheckUtils]: 41: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,260 INFO L273 TraceCheckUtils]: 42: Hoare triple {7878#false} assume !(~i~0 < 100000); {7878#false} is VALID [2018-11-23 12:03:56,260 INFO L273 TraceCheckUtils]: 43: Hoare triple {7878#false} ~i~0 := 0; {7878#false} is VALID [2018-11-23 12:03:56,260 INFO L273 TraceCheckUtils]: 44: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,260 INFO L273 TraceCheckUtils]: 45: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,261 INFO L273 TraceCheckUtils]: 46: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,261 INFO L273 TraceCheckUtils]: 47: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,261 INFO L273 TraceCheckUtils]: 48: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,261 INFO L273 TraceCheckUtils]: 49: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,261 INFO L273 TraceCheckUtils]: 50: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,261 INFO L273 TraceCheckUtils]: 51: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,261 INFO L273 TraceCheckUtils]: 52: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,261 INFO L273 TraceCheckUtils]: 53: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,262 INFO L273 TraceCheckUtils]: 54: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,262 INFO L273 TraceCheckUtils]: 55: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,262 INFO L273 TraceCheckUtils]: 56: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,262 INFO L273 TraceCheckUtils]: 57: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,262 INFO L273 TraceCheckUtils]: 58: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,262 INFO L273 TraceCheckUtils]: 59: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,262 INFO L273 TraceCheckUtils]: 60: Hoare triple {7878#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7878#false} is VALID [2018-11-23 12:03:56,262 INFO L273 TraceCheckUtils]: 61: Hoare triple {7878#false} assume !(~i~0 < 100000); {7878#false} is VALID [2018-11-23 12:03:56,262 INFO L273 TraceCheckUtils]: 62: Hoare triple {7878#false} havoc ~x~0;~x~0 := 0; {7878#false} is VALID [2018-11-23 12:03:56,263 INFO L273 TraceCheckUtils]: 63: Hoare triple {7878#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7878#false} is VALID [2018-11-23 12:03:56,263 INFO L256 TraceCheckUtils]: 64: Hoare triple {7878#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {7878#false} is VALID [2018-11-23 12:03:56,263 INFO L273 TraceCheckUtils]: 65: Hoare triple {7878#false} ~cond := #in~cond; {7878#false} is VALID [2018-11-23 12:03:56,263 INFO L273 TraceCheckUtils]: 66: Hoare triple {7878#false} assume 0 == ~cond; {7878#false} is VALID [2018-11-23 12:03:56,263 INFO L273 TraceCheckUtils]: 67: Hoare triple {7878#false} assume !false; {7878#false} is VALID [2018-11-23 12:03:56,265 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 12:03:56,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:56,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 12:03:56,294 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2018-11-23 12:03:56,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:56,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 12:03:56,324 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:56,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 12:03:56,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 12:03:56,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:03:56,325 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 21 states. [2018-11-23 12:03:56,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:56,921 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-11-23 12:03:56,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 12:03:56,922 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2018-11-23 12:03:56,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:56,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:03:56,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 99 transitions. [2018-11-23 12:03:56,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:03:56,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 99 transitions. [2018-11-23 12:03:56,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 99 transitions. [2018-11-23 12:03:57,032 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 12:03:57,033 INFO L225 Difference]: With dead ends: 125 [2018-11-23 12:03:57,034 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 12:03:57,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:03:57,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 12:03:57,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-23 12:03:57,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:57,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 76 states. [2018-11-23 12:03:57,211 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-23 12:03:57,211 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-23 12:03:57,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:57,212 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-11-23 12:03:57,212 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-11-23 12:03:57,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:57,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:57,214 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-23 12:03:57,214 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-23 12:03:57,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:57,215 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-11-23 12:03:57,215 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-11-23 12:03:57,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:57,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:57,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:57,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:57,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 12:03:57,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-11-23 12:03:57,217 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 68 [2018-11-23 12:03:57,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:57,218 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-11-23 12:03:57,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 12:03:57,218 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-11-23 12:03:57,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 12:03:57,219 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:57,219 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 12:03:57,219 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:57,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:57,219 INFO L82 PathProgramCache]: Analyzing trace with hash -33021222, now seen corresponding path program 18 times [2018-11-23 12:03:57,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:57,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:57,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:57,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:57,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:58,895 INFO L256 TraceCheckUtils]: 0: Hoare triple {8621#true} call ULTIMATE.init(); {8621#true} is VALID [2018-11-23 12:03:58,896 INFO L273 TraceCheckUtils]: 1: Hoare triple {8621#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8621#true} is VALID [2018-11-23 12:03:58,896 INFO L273 TraceCheckUtils]: 2: Hoare triple {8621#true} assume true; {8621#true} is VALID [2018-11-23 12:03:58,896 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8621#true} {8621#true} #74#return; {8621#true} is VALID [2018-11-23 12:03:58,897 INFO L256 TraceCheckUtils]: 4: Hoare triple {8621#true} call #t~ret2 := main(); {8621#true} is VALID [2018-11-23 12:03:58,904 INFO L273 TraceCheckUtils]: 5: Hoare triple {8621#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8623#(= main_~i~0 0)} is VALID [2018-11-23 12:03:58,905 INFO L273 TraceCheckUtils]: 6: Hoare triple {8623#(= 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; {8624#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:58,905 INFO L273 TraceCheckUtils]: 7: Hoare triple {8624#(<= 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; {8625#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:58,906 INFO L273 TraceCheckUtils]: 8: Hoare triple {8625#(<= 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; {8626#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:58,907 INFO L273 TraceCheckUtils]: 9: Hoare triple {8626#(<= 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; {8627#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:58,907 INFO L273 TraceCheckUtils]: 10: Hoare triple {8627#(<= 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; {8628#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:58,908 INFO L273 TraceCheckUtils]: 11: Hoare triple {8628#(<= 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; {8629#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:58,908 INFO L273 TraceCheckUtils]: 12: Hoare triple {8629#(<= 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; {8630#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:58,909 INFO L273 TraceCheckUtils]: 13: Hoare triple {8630#(<= 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; {8631#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:58,910 INFO L273 TraceCheckUtils]: 14: Hoare triple {8631#(<= 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; {8632#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:58,911 INFO L273 TraceCheckUtils]: 15: Hoare triple {8632#(<= 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; {8633#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:58,912 INFO L273 TraceCheckUtils]: 16: Hoare triple {8633#(<= 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; {8634#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:58,913 INFO L273 TraceCheckUtils]: 17: Hoare triple {8634#(<= 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; {8635#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:58,914 INFO L273 TraceCheckUtils]: 18: Hoare triple {8635#(<= 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; {8636#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:58,915 INFO L273 TraceCheckUtils]: 19: Hoare triple {8636#(<= 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; {8637#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:58,916 INFO L273 TraceCheckUtils]: 20: Hoare triple {8637#(<= 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; {8638#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:58,917 INFO L273 TraceCheckUtils]: 21: Hoare triple {8638#(<= 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; {8639#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:58,918 INFO L273 TraceCheckUtils]: 22: Hoare triple {8639#(<= 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; {8640#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:58,919 INFO L273 TraceCheckUtils]: 23: Hoare triple {8640#(<= 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; {8641#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:58,919 INFO L273 TraceCheckUtils]: 24: Hoare triple {8641#(<= main_~i~0 18)} assume !(~i~0 < 100000); {8622#false} is VALID [2018-11-23 12:03:58,920 INFO L273 TraceCheckUtils]: 25: Hoare triple {8622#false} ~i~0 := 0; {8622#false} is VALID [2018-11-23 12:03:58,920 INFO L273 TraceCheckUtils]: 26: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,920 INFO L273 TraceCheckUtils]: 27: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,920 INFO L273 TraceCheckUtils]: 28: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,920 INFO L273 TraceCheckUtils]: 29: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,921 INFO L273 TraceCheckUtils]: 30: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,921 INFO L273 TraceCheckUtils]: 31: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,921 INFO L273 TraceCheckUtils]: 32: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,922 INFO L273 TraceCheckUtils]: 33: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,922 INFO L273 TraceCheckUtils]: 34: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,922 INFO L273 TraceCheckUtils]: 35: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,922 INFO L273 TraceCheckUtils]: 36: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,923 INFO L273 TraceCheckUtils]: 37: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,923 INFO L273 TraceCheckUtils]: 38: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,923 INFO L273 TraceCheckUtils]: 39: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,923 INFO L273 TraceCheckUtils]: 40: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,923 INFO L273 TraceCheckUtils]: 41: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,924 INFO L273 TraceCheckUtils]: 42: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,924 INFO L273 TraceCheckUtils]: 43: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,924 INFO L273 TraceCheckUtils]: 44: Hoare triple {8622#false} assume !(~i~0 < 100000); {8622#false} is VALID [2018-11-23 12:03:58,924 INFO L273 TraceCheckUtils]: 45: Hoare triple {8622#false} ~i~0 := 0; {8622#false} is VALID [2018-11-23 12:03:58,924 INFO L273 TraceCheckUtils]: 46: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,924 INFO L273 TraceCheckUtils]: 47: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,924 INFO L273 TraceCheckUtils]: 48: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,924 INFO L273 TraceCheckUtils]: 49: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,925 INFO L273 TraceCheckUtils]: 50: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,925 INFO L273 TraceCheckUtils]: 51: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,925 INFO L273 TraceCheckUtils]: 52: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,925 INFO L273 TraceCheckUtils]: 53: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,925 INFO L273 TraceCheckUtils]: 54: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,925 INFO L273 TraceCheckUtils]: 55: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,925 INFO L273 TraceCheckUtils]: 56: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,925 INFO L273 TraceCheckUtils]: 57: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,925 INFO L273 TraceCheckUtils]: 58: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,926 INFO L273 TraceCheckUtils]: 59: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,926 INFO L273 TraceCheckUtils]: 60: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,926 INFO L273 TraceCheckUtils]: 61: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,926 INFO L273 TraceCheckUtils]: 62: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,926 INFO L273 TraceCheckUtils]: 63: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:03:58,926 INFO L273 TraceCheckUtils]: 64: Hoare triple {8622#false} assume !(~i~0 < 100000); {8622#false} is VALID [2018-11-23 12:03:58,926 INFO L273 TraceCheckUtils]: 65: Hoare triple {8622#false} havoc ~x~0;~x~0 := 0; {8622#false} is VALID [2018-11-23 12:03:58,926 INFO L273 TraceCheckUtils]: 66: Hoare triple {8622#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8622#false} is VALID [2018-11-23 12:03:58,926 INFO L256 TraceCheckUtils]: 67: Hoare triple {8622#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {8622#false} is VALID [2018-11-23 12:03:58,927 INFO L273 TraceCheckUtils]: 68: Hoare triple {8622#false} ~cond := #in~cond; {8622#false} is VALID [2018-11-23 12:03:58,927 INFO L273 TraceCheckUtils]: 69: Hoare triple {8622#false} assume 0 == ~cond; {8622#false} is VALID [2018-11-23 12:03:58,927 INFO L273 TraceCheckUtils]: 70: Hoare triple {8622#false} assume !false; {8622#false} is VALID [2018-11-23 12:03:58,929 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 12:03:58,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:58,929 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:58,939 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:04:33,852 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-11-23 12:04:33,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:04:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:33,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:34,060 INFO L256 TraceCheckUtils]: 0: Hoare triple {8621#true} call ULTIMATE.init(); {8621#true} is VALID [2018-11-23 12:04:34,060 INFO L273 TraceCheckUtils]: 1: Hoare triple {8621#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8621#true} is VALID [2018-11-23 12:04:34,061 INFO L273 TraceCheckUtils]: 2: Hoare triple {8621#true} assume true; {8621#true} is VALID [2018-11-23 12:04:34,061 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8621#true} {8621#true} #74#return; {8621#true} is VALID [2018-11-23 12:04:34,061 INFO L256 TraceCheckUtils]: 4: Hoare triple {8621#true} call #t~ret2 := main(); {8621#true} is VALID [2018-11-23 12:04:34,062 INFO L273 TraceCheckUtils]: 5: Hoare triple {8621#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8660#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:34,063 INFO L273 TraceCheckUtils]: 6: Hoare triple {8660#(<= 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; {8624#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:34,063 INFO L273 TraceCheckUtils]: 7: Hoare triple {8624#(<= 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; {8625#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:34,064 INFO L273 TraceCheckUtils]: 8: Hoare triple {8625#(<= 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; {8626#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:34,064 INFO L273 TraceCheckUtils]: 9: Hoare triple {8626#(<= 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; {8627#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:34,065 INFO L273 TraceCheckUtils]: 10: Hoare triple {8627#(<= 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; {8628#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:34,066 INFO L273 TraceCheckUtils]: 11: Hoare triple {8628#(<= 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; {8629#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:34,067 INFO L273 TraceCheckUtils]: 12: Hoare triple {8629#(<= 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; {8630#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:34,067 INFO L273 TraceCheckUtils]: 13: Hoare triple {8630#(<= 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; {8631#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:34,068 INFO L273 TraceCheckUtils]: 14: Hoare triple {8631#(<= 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; {8632#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:34,069 INFO L273 TraceCheckUtils]: 15: Hoare triple {8632#(<= 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; {8633#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:34,070 INFO L273 TraceCheckUtils]: 16: Hoare triple {8633#(<= 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; {8634#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:34,071 INFO L273 TraceCheckUtils]: 17: Hoare triple {8634#(<= 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; {8635#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:34,072 INFO L273 TraceCheckUtils]: 18: Hoare triple {8635#(<= 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; {8636#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:34,073 INFO L273 TraceCheckUtils]: 19: Hoare triple {8636#(<= 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; {8637#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:34,074 INFO L273 TraceCheckUtils]: 20: Hoare triple {8637#(<= 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; {8638#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:34,075 INFO L273 TraceCheckUtils]: 21: Hoare triple {8638#(<= 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; {8639#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:34,076 INFO L273 TraceCheckUtils]: 22: Hoare triple {8639#(<= 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; {8640#(<= main_~i~0 17)} is VALID [2018-11-23 12:04:34,077 INFO L273 TraceCheckUtils]: 23: Hoare triple {8640#(<= 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; {8641#(<= main_~i~0 18)} is VALID [2018-11-23 12:04:34,078 INFO L273 TraceCheckUtils]: 24: Hoare triple {8641#(<= main_~i~0 18)} assume !(~i~0 < 100000); {8622#false} is VALID [2018-11-23 12:04:34,078 INFO L273 TraceCheckUtils]: 25: Hoare triple {8622#false} ~i~0 := 0; {8622#false} is VALID [2018-11-23 12:04:34,078 INFO L273 TraceCheckUtils]: 26: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,078 INFO L273 TraceCheckUtils]: 27: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,078 INFO L273 TraceCheckUtils]: 28: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,079 INFO L273 TraceCheckUtils]: 29: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,079 INFO L273 TraceCheckUtils]: 30: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,079 INFO L273 TraceCheckUtils]: 31: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,079 INFO L273 TraceCheckUtils]: 32: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,079 INFO L273 TraceCheckUtils]: 33: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,080 INFO L273 TraceCheckUtils]: 34: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,080 INFO L273 TraceCheckUtils]: 35: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,080 INFO L273 TraceCheckUtils]: 36: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,080 INFO L273 TraceCheckUtils]: 37: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,080 INFO L273 TraceCheckUtils]: 38: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,081 INFO L273 TraceCheckUtils]: 39: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,081 INFO L273 TraceCheckUtils]: 40: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,081 INFO L273 TraceCheckUtils]: 41: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,081 INFO L273 TraceCheckUtils]: 42: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,081 INFO L273 TraceCheckUtils]: 43: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,081 INFO L273 TraceCheckUtils]: 44: Hoare triple {8622#false} assume !(~i~0 < 100000); {8622#false} is VALID [2018-11-23 12:04:34,081 INFO L273 TraceCheckUtils]: 45: Hoare triple {8622#false} ~i~0 := 0; {8622#false} is VALID [2018-11-23 12:04:34,081 INFO L273 TraceCheckUtils]: 46: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,081 INFO L273 TraceCheckUtils]: 47: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,082 INFO L273 TraceCheckUtils]: 48: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,082 INFO L273 TraceCheckUtils]: 49: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,082 INFO L273 TraceCheckUtils]: 50: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,082 INFO L273 TraceCheckUtils]: 51: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,082 INFO L273 TraceCheckUtils]: 52: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,082 INFO L273 TraceCheckUtils]: 53: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,082 INFO L273 TraceCheckUtils]: 54: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,082 INFO L273 TraceCheckUtils]: 55: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,083 INFO L273 TraceCheckUtils]: 56: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,083 INFO L273 TraceCheckUtils]: 57: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,083 INFO L273 TraceCheckUtils]: 58: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,083 INFO L273 TraceCheckUtils]: 59: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,083 INFO L273 TraceCheckUtils]: 60: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,083 INFO L273 TraceCheckUtils]: 61: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,083 INFO L273 TraceCheckUtils]: 62: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,083 INFO L273 TraceCheckUtils]: 63: Hoare triple {8622#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8622#false} is VALID [2018-11-23 12:04:34,083 INFO L273 TraceCheckUtils]: 64: Hoare triple {8622#false} assume !(~i~0 < 100000); {8622#false} is VALID [2018-11-23 12:04:34,084 INFO L273 TraceCheckUtils]: 65: Hoare triple {8622#false} havoc ~x~0;~x~0 := 0; {8622#false} is VALID [2018-11-23 12:04:34,084 INFO L273 TraceCheckUtils]: 66: Hoare triple {8622#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8622#false} is VALID [2018-11-23 12:04:34,084 INFO L256 TraceCheckUtils]: 67: Hoare triple {8622#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {8622#false} is VALID [2018-11-23 12:04:34,084 INFO L273 TraceCheckUtils]: 68: Hoare triple {8622#false} ~cond := #in~cond; {8622#false} is VALID [2018-11-23 12:04:34,084 INFO L273 TraceCheckUtils]: 69: Hoare triple {8622#false} assume 0 == ~cond; {8622#false} is VALID [2018-11-23 12:04:34,084 INFO L273 TraceCheckUtils]: 70: Hoare triple {8622#false} assume !false; {8622#false} is VALID [2018-11-23 12:04:34,086 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 12:04:34,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:34,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 12:04:34,115 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 71 [2018-11-23 12:04:34,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:34,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 12:04:34,145 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:34,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 12:04:34,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 12:04:34,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:04:34,147 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 22 states. [2018-11-23 12:04:34,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:34,567 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-11-23 12:04:34,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 12:04:34,567 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 71 [2018-11-23 12:04:34,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:34,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:04:34,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 102 transitions. [2018-11-23 12:04:34,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:04:34,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 102 transitions. [2018-11-23 12:04:34,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 102 transitions. [2018-11-23 12:04:34,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:34,686 INFO L225 Difference]: With dead ends: 130 [2018-11-23 12:04:34,686 INFO L226 Difference]: Without dead ends: 79 [2018-11-23 12:04:34,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:04:34,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-23 12:04:34,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-11-23 12:04:34,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:34,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 79 states. [2018-11-23 12:04:34,747 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2018-11-23 12:04:34,747 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2018-11-23 12:04:34,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:34,749 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-11-23 12:04:34,749 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2018-11-23 12:04:34,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:34,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:34,751 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2018-11-23 12:04:34,751 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2018-11-23 12:04:34,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:34,753 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-11-23 12:04:34,753 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2018-11-23 12:04:34,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:34,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:34,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:34,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:34,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 12:04:34,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2018-11-23 12:04:34,755 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 71 [2018-11-23 12:04:34,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:34,756 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2018-11-23 12:04:34,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 12:04:34,756 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2018-11-23 12:04:34,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-23 12:04:34,757 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:34,757 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 12:04:34,757 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:34,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:34,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1723757855, now seen corresponding path program 19 times [2018-11-23 12:04:34,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:34,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:34,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:34,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:04:34,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:36,106 INFO L256 TraceCheckUtils]: 0: Hoare triple {9397#true} call ULTIMATE.init(); {9397#true} is VALID [2018-11-23 12:04:36,107 INFO L273 TraceCheckUtils]: 1: Hoare triple {9397#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9397#true} is VALID [2018-11-23 12:04:36,107 INFO L273 TraceCheckUtils]: 2: Hoare triple {9397#true} assume true; {9397#true} is VALID [2018-11-23 12:04:36,107 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9397#true} {9397#true} #74#return; {9397#true} is VALID [2018-11-23 12:04:36,108 INFO L256 TraceCheckUtils]: 4: Hoare triple {9397#true} call #t~ret2 := main(); {9397#true} is VALID [2018-11-23 12:04:36,108 INFO L273 TraceCheckUtils]: 5: Hoare triple {9397#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9399#(= main_~i~0 0)} is VALID [2018-11-23 12:04:36,109 INFO L273 TraceCheckUtils]: 6: Hoare triple {9399#(= 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; {9400#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:36,109 INFO L273 TraceCheckUtils]: 7: Hoare triple {9400#(<= 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; {9401#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:36,110 INFO L273 TraceCheckUtils]: 8: Hoare triple {9401#(<= 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; {9402#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:36,111 INFO L273 TraceCheckUtils]: 9: Hoare triple {9402#(<= 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; {9403#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:36,111 INFO L273 TraceCheckUtils]: 10: Hoare triple {9403#(<= 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; {9404#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:36,112 INFO L273 TraceCheckUtils]: 11: Hoare triple {9404#(<= 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; {9405#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:36,113 INFO L273 TraceCheckUtils]: 12: Hoare triple {9405#(<= 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; {9406#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:36,114 INFO L273 TraceCheckUtils]: 13: Hoare triple {9406#(<= 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; {9407#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:36,115 INFO L273 TraceCheckUtils]: 14: Hoare triple {9407#(<= 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; {9408#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:36,116 INFO L273 TraceCheckUtils]: 15: Hoare triple {9408#(<= 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; {9409#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:36,117 INFO L273 TraceCheckUtils]: 16: Hoare triple {9409#(<= 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; {9410#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:36,118 INFO L273 TraceCheckUtils]: 17: Hoare triple {9410#(<= 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; {9411#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:36,119 INFO L273 TraceCheckUtils]: 18: Hoare triple {9411#(<= 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; {9412#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:36,120 INFO L273 TraceCheckUtils]: 19: Hoare triple {9412#(<= 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; {9413#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:36,121 INFO L273 TraceCheckUtils]: 20: Hoare triple {9413#(<= 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; {9414#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:36,121 INFO L273 TraceCheckUtils]: 21: Hoare triple {9414#(<= 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; {9415#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:36,122 INFO L273 TraceCheckUtils]: 22: Hoare triple {9415#(<= 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; {9416#(<= main_~i~0 17)} is VALID [2018-11-23 12:04:36,123 INFO L273 TraceCheckUtils]: 23: Hoare triple {9416#(<= 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; {9417#(<= main_~i~0 18)} is VALID [2018-11-23 12:04:36,124 INFO L273 TraceCheckUtils]: 24: Hoare triple {9417#(<= 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; {9418#(<= main_~i~0 19)} is VALID [2018-11-23 12:04:36,125 INFO L273 TraceCheckUtils]: 25: Hoare triple {9418#(<= main_~i~0 19)} assume !(~i~0 < 100000); {9398#false} is VALID [2018-11-23 12:04:36,125 INFO L273 TraceCheckUtils]: 26: Hoare triple {9398#false} ~i~0 := 0; {9398#false} is VALID [2018-11-23 12:04:36,125 INFO L273 TraceCheckUtils]: 27: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,126 INFO L273 TraceCheckUtils]: 28: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,126 INFO L273 TraceCheckUtils]: 29: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,126 INFO L273 TraceCheckUtils]: 30: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,126 INFO L273 TraceCheckUtils]: 31: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,126 INFO L273 TraceCheckUtils]: 32: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,127 INFO L273 TraceCheckUtils]: 33: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,127 INFO L273 TraceCheckUtils]: 34: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,127 INFO L273 TraceCheckUtils]: 35: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,127 INFO L273 TraceCheckUtils]: 36: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,127 INFO L273 TraceCheckUtils]: 37: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,128 INFO L273 TraceCheckUtils]: 38: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,128 INFO L273 TraceCheckUtils]: 39: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,128 INFO L273 TraceCheckUtils]: 40: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,128 INFO L273 TraceCheckUtils]: 41: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,128 INFO L273 TraceCheckUtils]: 42: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,129 INFO L273 TraceCheckUtils]: 43: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,129 INFO L273 TraceCheckUtils]: 44: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,129 INFO L273 TraceCheckUtils]: 45: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,129 INFO L273 TraceCheckUtils]: 46: Hoare triple {9398#false} assume !(~i~0 < 100000); {9398#false} is VALID [2018-11-23 12:04:36,129 INFO L273 TraceCheckUtils]: 47: Hoare triple {9398#false} ~i~0 := 0; {9398#false} is VALID [2018-11-23 12:04:36,129 INFO L273 TraceCheckUtils]: 48: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,130 INFO L273 TraceCheckUtils]: 49: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,130 INFO L273 TraceCheckUtils]: 50: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,130 INFO L273 TraceCheckUtils]: 51: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,130 INFO L273 TraceCheckUtils]: 52: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,130 INFO L273 TraceCheckUtils]: 53: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,130 INFO L273 TraceCheckUtils]: 54: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,130 INFO L273 TraceCheckUtils]: 55: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,130 INFO L273 TraceCheckUtils]: 56: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,131 INFO L273 TraceCheckUtils]: 57: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,131 INFO L273 TraceCheckUtils]: 58: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,131 INFO L273 TraceCheckUtils]: 59: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,131 INFO L273 TraceCheckUtils]: 60: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,131 INFO L273 TraceCheckUtils]: 61: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,131 INFO L273 TraceCheckUtils]: 62: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,131 INFO L273 TraceCheckUtils]: 63: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,131 INFO L273 TraceCheckUtils]: 64: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,131 INFO L273 TraceCheckUtils]: 65: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,132 INFO L273 TraceCheckUtils]: 66: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,132 INFO L273 TraceCheckUtils]: 67: Hoare triple {9398#false} assume !(~i~0 < 100000); {9398#false} is VALID [2018-11-23 12:04:36,132 INFO L273 TraceCheckUtils]: 68: Hoare triple {9398#false} havoc ~x~0;~x~0 := 0; {9398#false} is VALID [2018-11-23 12:04:36,132 INFO L273 TraceCheckUtils]: 69: Hoare triple {9398#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9398#false} is VALID [2018-11-23 12:04:36,132 INFO L256 TraceCheckUtils]: 70: Hoare triple {9398#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {9398#false} is VALID [2018-11-23 12:04:36,132 INFO L273 TraceCheckUtils]: 71: Hoare triple {9398#false} ~cond := #in~cond; {9398#false} is VALID [2018-11-23 12:04:36,132 INFO L273 TraceCheckUtils]: 72: Hoare triple {9398#false} assume 0 == ~cond; {9398#false} is VALID [2018-11-23 12:04:36,132 INFO L273 TraceCheckUtils]: 73: Hoare triple {9398#false} assume !false; {9398#false} is VALID [2018-11-23 12:04:36,135 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 12:04:36,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:36,135 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:04:36,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:04:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:36,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:36,421 INFO L256 TraceCheckUtils]: 0: Hoare triple {9397#true} call ULTIMATE.init(); {9397#true} is VALID [2018-11-23 12:04:36,421 INFO L273 TraceCheckUtils]: 1: Hoare triple {9397#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9397#true} is VALID [2018-11-23 12:04:36,422 INFO L273 TraceCheckUtils]: 2: Hoare triple {9397#true} assume true; {9397#true} is VALID [2018-11-23 12:04:36,422 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9397#true} {9397#true} #74#return; {9397#true} is VALID [2018-11-23 12:04:36,422 INFO L256 TraceCheckUtils]: 4: Hoare triple {9397#true} call #t~ret2 := main(); {9397#true} is VALID [2018-11-23 12:04:36,423 INFO L273 TraceCheckUtils]: 5: Hoare triple {9397#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9437#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:36,424 INFO L273 TraceCheckUtils]: 6: Hoare triple {9437#(<= 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; {9400#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:36,424 INFO L273 TraceCheckUtils]: 7: Hoare triple {9400#(<= 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; {9401#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:36,425 INFO L273 TraceCheckUtils]: 8: Hoare triple {9401#(<= 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; {9402#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:36,426 INFO L273 TraceCheckUtils]: 9: Hoare triple {9402#(<= 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; {9403#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:36,426 INFO L273 TraceCheckUtils]: 10: Hoare triple {9403#(<= 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; {9404#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:36,427 INFO L273 TraceCheckUtils]: 11: Hoare triple {9404#(<= 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; {9405#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:36,428 INFO L273 TraceCheckUtils]: 12: Hoare triple {9405#(<= 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; {9406#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:36,429 INFO L273 TraceCheckUtils]: 13: Hoare triple {9406#(<= 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; {9407#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:36,430 INFO L273 TraceCheckUtils]: 14: Hoare triple {9407#(<= 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; {9408#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:36,431 INFO L273 TraceCheckUtils]: 15: Hoare triple {9408#(<= 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; {9409#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:36,432 INFO L273 TraceCheckUtils]: 16: Hoare triple {9409#(<= 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; {9410#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:36,433 INFO L273 TraceCheckUtils]: 17: Hoare triple {9410#(<= 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; {9411#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:36,434 INFO L273 TraceCheckUtils]: 18: Hoare triple {9411#(<= 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; {9412#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:36,435 INFO L273 TraceCheckUtils]: 19: Hoare triple {9412#(<= 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; {9413#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:36,436 INFO L273 TraceCheckUtils]: 20: Hoare triple {9413#(<= 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; {9414#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:36,437 INFO L273 TraceCheckUtils]: 21: Hoare triple {9414#(<= 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; {9415#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:36,438 INFO L273 TraceCheckUtils]: 22: Hoare triple {9415#(<= 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; {9416#(<= main_~i~0 17)} is VALID [2018-11-23 12:04:36,439 INFO L273 TraceCheckUtils]: 23: Hoare triple {9416#(<= 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; {9417#(<= main_~i~0 18)} is VALID [2018-11-23 12:04:36,440 INFO L273 TraceCheckUtils]: 24: Hoare triple {9417#(<= 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; {9418#(<= main_~i~0 19)} is VALID [2018-11-23 12:04:36,440 INFO L273 TraceCheckUtils]: 25: Hoare triple {9418#(<= main_~i~0 19)} assume !(~i~0 < 100000); {9398#false} is VALID [2018-11-23 12:04:36,441 INFO L273 TraceCheckUtils]: 26: Hoare triple {9398#false} ~i~0 := 0; {9398#false} is VALID [2018-11-23 12:04:36,441 INFO L273 TraceCheckUtils]: 27: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,441 INFO L273 TraceCheckUtils]: 28: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,441 INFO L273 TraceCheckUtils]: 29: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,441 INFO L273 TraceCheckUtils]: 30: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,442 INFO L273 TraceCheckUtils]: 31: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,442 INFO L273 TraceCheckUtils]: 32: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,442 INFO L273 TraceCheckUtils]: 33: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,442 INFO L273 TraceCheckUtils]: 34: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,442 INFO L273 TraceCheckUtils]: 35: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,443 INFO L273 TraceCheckUtils]: 36: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,443 INFO L273 TraceCheckUtils]: 37: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,443 INFO L273 TraceCheckUtils]: 38: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,443 INFO L273 TraceCheckUtils]: 39: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,443 INFO L273 TraceCheckUtils]: 40: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,444 INFO L273 TraceCheckUtils]: 41: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,444 INFO L273 TraceCheckUtils]: 42: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,444 INFO L273 TraceCheckUtils]: 43: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,444 INFO L273 TraceCheckUtils]: 44: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,444 INFO L273 TraceCheckUtils]: 45: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,445 INFO L273 TraceCheckUtils]: 46: Hoare triple {9398#false} assume !(~i~0 < 100000); {9398#false} is VALID [2018-11-23 12:04:36,445 INFO L273 TraceCheckUtils]: 47: Hoare triple {9398#false} ~i~0 := 0; {9398#false} is VALID [2018-11-23 12:04:36,445 INFO L273 TraceCheckUtils]: 48: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,445 INFO L273 TraceCheckUtils]: 49: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,445 INFO L273 TraceCheckUtils]: 50: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,446 INFO L273 TraceCheckUtils]: 51: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,446 INFO L273 TraceCheckUtils]: 52: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,446 INFO L273 TraceCheckUtils]: 53: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,446 INFO L273 TraceCheckUtils]: 54: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,446 INFO L273 TraceCheckUtils]: 55: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,446 INFO L273 TraceCheckUtils]: 56: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,446 INFO L273 TraceCheckUtils]: 57: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,446 INFO L273 TraceCheckUtils]: 58: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,447 INFO L273 TraceCheckUtils]: 59: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,447 INFO L273 TraceCheckUtils]: 60: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,447 INFO L273 TraceCheckUtils]: 61: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,447 INFO L273 TraceCheckUtils]: 62: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,447 INFO L273 TraceCheckUtils]: 63: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,447 INFO L273 TraceCheckUtils]: 64: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,447 INFO L273 TraceCheckUtils]: 65: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,447 INFO L273 TraceCheckUtils]: 66: Hoare triple {9398#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9398#false} is VALID [2018-11-23 12:04:36,448 INFO L273 TraceCheckUtils]: 67: Hoare triple {9398#false} assume !(~i~0 < 100000); {9398#false} is VALID [2018-11-23 12:04:36,448 INFO L273 TraceCheckUtils]: 68: Hoare triple {9398#false} havoc ~x~0;~x~0 := 0; {9398#false} is VALID [2018-11-23 12:04:36,448 INFO L273 TraceCheckUtils]: 69: Hoare triple {9398#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9398#false} is VALID [2018-11-23 12:04:36,448 INFO L256 TraceCheckUtils]: 70: Hoare triple {9398#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {9398#false} is VALID [2018-11-23 12:04:36,448 INFO L273 TraceCheckUtils]: 71: Hoare triple {9398#false} ~cond := #in~cond; {9398#false} is VALID [2018-11-23 12:04:36,448 INFO L273 TraceCheckUtils]: 72: Hoare triple {9398#false} assume 0 == ~cond; {9398#false} is VALID [2018-11-23 12:04:36,448 INFO L273 TraceCheckUtils]: 73: Hoare triple {9398#false} assume !false; {9398#false} is VALID [2018-11-23 12:04:36,451 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 12:04:36,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:36,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 12:04:36,471 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 74 [2018-11-23 12:04:36,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:36,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:04:36,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:36,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:04:36,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:04:36,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:04:36,505 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 23 states. [2018-11-23 12:04:37,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:37,239 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2018-11-23 12:04:37,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:04:37,239 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 74 [2018-11-23 12:04:37,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:37,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:04:37,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 105 transitions. [2018-11-23 12:04:37,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:04:37,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 105 transitions. [2018-11-23 12:04:37,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 105 transitions. [2018-11-23 12:04:37,376 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 12:04:37,378 INFO L225 Difference]: With dead ends: 135 [2018-11-23 12:04:37,378 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 12:04:37,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:04:37,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 12:04:37,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-23 12:04:37,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:37,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 82 states. [2018-11-23 12:04:37,452 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2018-11-23 12:04:37,452 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2018-11-23 12:04:37,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:37,454 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2018-11-23 12:04:37,454 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-11-23 12:04:37,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:37,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:37,455 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2018-11-23 12:04:37,455 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2018-11-23 12:04:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:37,457 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2018-11-23 12:04:37,457 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-11-23 12:04:37,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:37,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:37,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:37,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:37,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 12:04:37,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-11-23 12:04:37,459 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 74 [2018-11-23 12:04:37,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:37,460 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-11-23 12:04:37,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:04:37,460 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-11-23 12:04:37,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 12:04:37,460 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:37,461 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 12:04:37,461 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:37,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:37,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1471776390, now seen corresponding path program 20 times [2018-11-23 12:04:37,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:37,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:37,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:37,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:04:37,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:38,262 INFO L256 TraceCheckUtils]: 0: Hoare triple {10205#true} call ULTIMATE.init(); {10205#true} is VALID [2018-11-23 12:04:38,263 INFO L273 TraceCheckUtils]: 1: Hoare triple {10205#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10205#true} is VALID [2018-11-23 12:04:38,263 INFO L273 TraceCheckUtils]: 2: Hoare triple {10205#true} assume true; {10205#true} is VALID [2018-11-23 12:04:38,263 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10205#true} {10205#true} #74#return; {10205#true} is VALID [2018-11-23 12:04:38,263 INFO L256 TraceCheckUtils]: 4: Hoare triple {10205#true} call #t~ret2 := main(); {10205#true} is VALID [2018-11-23 12:04:38,264 INFO L273 TraceCheckUtils]: 5: Hoare triple {10205#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10207#(= main_~i~0 0)} is VALID [2018-11-23 12:04:38,265 INFO L273 TraceCheckUtils]: 6: Hoare triple {10207#(= 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; {10208#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:38,265 INFO L273 TraceCheckUtils]: 7: Hoare triple {10208#(<= 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; {10209#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:38,266 INFO L273 TraceCheckUtils]: 8: Hoare triple {10209#(<= 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; {10210#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:38,267 INFO L273 TraceCheckUtils]: 9: Hoare triple {10210#(<= 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; {10211#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:38,267 INFO L273 TraceCheckUtils]: 10: Hoare triple {10211#(<= 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; {10212#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:38,268 INFO L273 TraceCheckUtils]: 11: Hoare triple {10212#(<= 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; {10213#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:38,269 INFO L273 TraceCheckUtils]: 12: Hoare triple {10213#(<= 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; {10214#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:38,270 INFO L273 TraceCheckUtils]: 13: Hoare triple {10214#(<= 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; {10215#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:38,271 INFO L273 TraceCheckUtils]: 14: Hoare triple {10215#(<= 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; {10216#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:38,272 INFO L273 TraceCheckUtils]: 15: Hoare triple {10216#(<= 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; {10217#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:38,273 INFO L273 TraceCheckUtils]: 16: Hoare triple {10217#(<= 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; {10218#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:38,274 INFO L273 TraceCheckUtils]: 17: Hoare triple {10218#(<= 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; {10219#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:38,275 INFO L273 TraceCheckUtils]: 18: Hoare triple {10219#(<= 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; {10220#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:38,296 INFO L273 TraceCheckUtils]: 19: Hoare triple {10220#(<= 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; {10221#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:38,311 INFO L273 TraceCheckUtils]: 20: Hoare triple {10221#(<= 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; {10222#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:38,326 INFO L273 TraceCheckUtils]: 21: Hoare triple {10222#(<= 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; {10223#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:38,342 INFO L273 TraceCheckUtils]: 22: Hoare triple {10223#(<= 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; {10224#(<= main_~i~0 17)} is VALID [2018-11-23 12:04:38,356 INFO L273 TraceCheckUtils]: 23: Hoare triple {10224#(<= 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; {10225#(<= main_~i~0 18)} is VALID [2018-11-23 12:04:38,372 INFO L273 TraceCheckUtils]: 24: Hoare triple {10225#(<= 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; {10226#(<= main_~i~0 19)} is VALID [2018-11-23 12:04:38,381 INFO L273 TraceCheckUtils]: 25: Hoare triple {10226#(<= 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; {10227#(<= main_~i~0 20)} is VALID [2018-11-23 12:04:38,396 INFO L273 TraceCheckUtils]: 26: Hoare triple {10227#(<= main_~i~0 20)} assume !(~i~0 < 100000); {10206#false} is VALID [2018-11-23 12:04:38,396 INFO L273 TraceCheckUtils]: 27: Hoare triple {10206#false} ~i~0 := 0; {10206#false} is VALID [2018-11-23 12:04:38,396 INFO L273 TraceCheckUtils]: 28: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,397 INFO L273 TraceCheckUtils]: 29: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,397 INFO L273 TraceCheckUtils]: 30: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,397 INFO L273 TraceCheckUtils]: 31: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,397 INFO L273 TraceCheckUtils]: 32: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,397 INFO L273 TraceCheckUtils]: 33: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,398 INFO L273 TraceCheckUtils]: 34: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,398 INFO L273 TraceCheckUtils]: 35: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,398 INFO L273 TraceCheckUtils]: 36: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,398 INFO L273 TraceCheckUtils]: 37: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,398 INFO L273 TraceCheckUtils]: 38: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,398 INFO L273 TraceCheckUtils]: 39: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,399 INFO L273 TraceCheckUtils]: 40: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,399 INFO L273 TraceCheckUtils]: 41: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,399 INFO L273 TraceCheckUtils]: 42: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,399 INFO L273 TraceCheckUtils]: 43: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,399 INFO L273 TraceCheckUtils]: 44: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,400 INFO L273 TraceCheckUtils]: 45: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,400 INFO L273 TraceCheckUtils]: 46: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,400 INFO L273 TraceCheckUtils]: 47: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,400 INFO L273 TraceCheckUtils]: 48: Hoare triple {10206#false} assume !(~i~0 < 100000); {10206#false} is VALID [2018-11-23 12:04:38,400 INFO L273 TraceCheckUtils]: 49: Hoare triple {10206#false} ~i~0 := 0; {10206#false} is VALID [2018-11-23 12:04:38,401 INFO L273 TraceCheckUtils]: 50: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,401 INFO L273 TraceCheckUtils]: 51: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,401 INFO L273 TraceCheckUtils]: 52: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,401 INFO L273 TraceCheckUtils]: 53: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,401 INFO L273 TraceCheckUtils]: 54: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,401 INFO L273 TraceCheckUtils]: 55: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,402 INFO L273 TraceCheckUtils]: 56: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,402 INFO L273 TraceCheckUtils]: 57: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,402 INFO L273 TraceCheckUtils]: 58: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,402 INFO L273 TraceCheckUtils]: 59: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,402 INFO L273 TraceCheckUtils]: 60: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,403 INFO L273 TraceCheckUtils]: 61: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,403 INFO L273 TraceCheckUtils]: 62: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,403 INFO L273 TraceCheckUtils]: 63: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,403 INFO L273 TraceCheckUtils]: 64: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,403 INFO L273 TraceCheckUtils]: 65: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,403 INFO L273 TraceCheckUtils]: 66: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,404 INFO L273 TraceCheckUtils]: 67: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,404 INFO L273 TraceCheckUtils]: 68: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,404 INFO L273 TraceCheckUtils]: 69: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:38,404 INFO L273 TraceCheckUtils]: 70: Hoare triple {10206#false} assume !(~i~0 < 100000); {10206#false} is VALID [2018-11-23 12:04:38,404 INFO L273 TraceCheckUtils]: 71: Hoare triple {10206#false} havoc ~x~0;~x~0 := 0; {10206#false} is VALID [2018-11-23 12:04:38,404 INFO L273 TraceCheckUtils]: 72: Hoare triple {10206#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10206#false} is VALID [2018-11-23 12:04:38,405 INFO L256 TraceCheckUtils]: 73: Hoare triple {10206#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {10206#false} is VALID [2018-11-23 12:04:38,405 INFO L273 TraceCheckUtils]: 74: Hoare triple {10206#false} ~cond := #in~cond; {10206#false} is VALID [2018-11-23 12:04:38,405 INFO L273 TraceCheckUtils]: 75: Hoare triple {10206#false} assume 0 == ~cond; {10206#false} is VALID [2018-11-23 12:04:38,405 INFO L273 TraceCheckUtils]: 76: Hoare triple {10206#false} assume !false; {10206#false} is VALID [2018-11-23 12:04:38,410 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 12:04:38,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:38,411 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:04:38,427 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:04:38,501 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:04:38,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:04:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:38,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:39,300 INFO L256 TraceCheckUtils]: 0: Hoare triple {10205#true} call ULTIMATE.init(); {10205#true} is VALID [2018-11-23 12:04:39,300 INFO L273 TraceCheckUtils]: 1: Hoare triple {10205#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10205#true} is VALID [2018-11-23 12:04:39,300 INFO L273 TraceCheckUtils]: 2: Hoare triple {10205#true} assume true; {10205#true} is VALID [2018-11-23 12:04:39,301 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10205#true} {10205#true} #74#return; {10205#true} is VALID [2018-11-23 12:04:39,301 INFO L256 TraceCheckUtils]: 4: Hoare triple {10205#true} call #t~ret2 := main(); {10205#true} is VALID [2018-11-23 12:04:39,302 INFO L273 TraceCheckUtils]: 5: Hoare triple {10205#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10246#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:39,302 INFO L273 TraceCheckUtils]: 6: Hoare triple {10246#(<= 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; {10208#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:39,303 INFO L273 TraceCheckUtils]: 7: Hoare triple {10208#(<= 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; {10209#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:39,303 INFO L273 TraceCheckUtils]: 8: Hoare triple {10209#(<= 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; {10210#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:39,304 INFO L273 TraceCheckUtils]: 9: Hoare triple {10210#(<= 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; {10211#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:39,305 INFO L273 TraceCheckUtils]: 10: Hoare triple {10211#(<= 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; {10212#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:39,306 INFO L273 TraceCheckUtils]: 11: Hoare triple {10212#(<= 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; {10213#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:39,307 INFO L273 TraceCheckUtils]: 12: Hoare triple {10213#(<= 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; {10214#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:39,308 INFO L273 TraceCheckUtils]: 13: Hoare triple {10214#(<= 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; {10215#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:39,309 INFO L273 TraceCheckUtils]: 14: Hoare triple {10215#(<= 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; {10216#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:39,310 INFO L273 TraceCheckUtils]: 15: Hoare triple {10216#(<= 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; {10217#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:39,311 INFO L273 TraceCheckUtils]: 16: Hoare triple {10217#(<= 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; {10218#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:39,312 INFO L273 TraceCheckUtils]: 17: Hoare triple {10218#(<= 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; {10219#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:39,313 INFO L273 TraceCheckUtils]: 18: Hoare triple {10219#(<= 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; {10220#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:39,314 INFO L273 TraceCheckUtils]: 19: Hoare triple {10220#(<= 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; {10221#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:39,315 INFO L273 TraceCheckUtils]: 20: Hoare triple {10221#(<= 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; {10222#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:39,315 INFO L273 TraceCheckUtils]: 21: Hoare triple {10222#(<= 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; {10223#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:39,316 INFO L273 TraceCheckUtils]: 22: Hoare triple {10223#(<= 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; {10224#(<= main_~i~0 17)} is VALID [2018-11-23 12:04:39,317 INFO L273 TraceCheckUtils]: 23: Hoare triple {10224#(<= 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; {10225#(<= main_~i~0 18)} is VALID [2018-11-23 12:04:39,318 INFO L273 TraceCheckUtils]: 24: Hoare triple {10225#(<= 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; {10226#(<= main_~i~0 19)} is VALID [2018-11-23 12:04:39,319 INFO L273 TraceCheckUtils]: 25: Hoare triple {10226#(<= 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; {10227#(<= main_~i~0 20)} is VALID [2018-11-23 12:04:39,320 INFO L273 TraceCheckUtils]: 26: Hoare triple {10227#(<= main_~i~0 20)} assume !(~i~0 < 100000); {10206#false} is VALID [2018-11-23 12:04:39,320 INFO L273 TraceCheckUtils]: 27: Hoare triple {10206#false} ~i~0 := 0; {10206#false} is VALID [2018-11-23 12:04:39,320 INFO L273 TraceCheckUtils]: 28: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,321 INFO L273 TraceCheckUtils]: 29: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,321 INFO L273 TraceCheckUtils]: 30: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,321 INFO L273 TraceCheckUtils]: 31: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,321 INFO L273 TraceCheckUtils]: 32: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,321 INFO L273 TraceCheckUtils]: 33: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,322 INFO L273 TraceCheckUtils]: 34: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,322 INFO L273 TraceCheckUtils]: 35: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,322 INFO L273 TraceCheckUtils]: 36: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,322 INFO L273 TraceCheckUtils]: 37: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,322 INFO L273 TraceCheckUtils]: 38: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,322 INFO L273 TraceCheckUtils]: 39: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,323 INFO L273 TraceCheckUtils]: 40: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,323 INFO L273 TraceCheckUtils]: 41: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,323 INFO L273 TraceCheckUtils]: 42: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,323 INFO L273 TraceCheckUtils]: 43: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,323 INFO L273 TraceCheckUtils]: 44: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,323 INFO L273 TraceCheckUtils]: 45: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,323 INFO L273 TraceCheckUtils]: 46: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,323 INFO L273 TraceCheckUtils]: 47: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,323 INFO L273 TraceCheckUtils]: 48: Hoare triple {10206#false} assume !(~i~0 < 100000); {10206#false} is VALID [2018-11-23 12:04:39,324 INFO L273 TraceCheckUtils]: 49: Hoare triple {10206#false} ~i~0 := 0; {10206#false} is VALID [2018-11-23 12:04:39,324 INFO L273 TraceCheckUtils]: 50: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,324 INFO L273 TraceCheckUtils]: 51: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,324 INFO L273 TraceCheckUtils]: 52: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,324 INFO L273 TraceCheckUtils]: 53: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,324 INFO L273 TraceCheckUtils]: 54: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,324 INFO L273 TraceCheckUtils]: 55: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,324 INFO L273 TraceCheckUtils]: 56: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,324 INFO L273 TraceCheckUtils]: 57: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,325 INFO L273 TraceCheckUtils]: 58: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,325 INFO L273 TraceCheckUtils]: 59: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,325 INFO L273 TraceCheckUtils]: 60: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,325 INFO L273 TraceCheckUtils]: 61: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,325 INFO L273 TraceCheckUtils]: 62: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,325 INFO L273 TraceCheckUtils]: 63: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,325 INFO L273 TraceCheckUtils]: 64: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,325 INFO L273 TraceCheckUtils]: 65: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,325 INFO L273 TraceCheckUtils]: 66: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,326 INFO L273 TraceCheckUtils]: 67: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,326 INFO L273 TraceCheckUtils]: 68: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,326 INFO L273 TraceCheckUtils]: 69: Hoare triple {10206#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10206#false} is VALID [2018-11-23 12:04:39,326 INFO L273 TraceCheckUtils]: 70: Hoare triple {10206#false} assume !(~i~0 < 100000); {10206#false} is VALID [2018-11-23 12:04:39,326 INFO L273 TraceCheckUtils]: 71: Hoare triple {10206#false} havoc ~x~0;~x~0 := 0; {10206#false} is VALID [2018-11-23 12:04:39,326 INFO L273 TraceCheckUtils]: 72: Hoare triple {10206#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10206#false} is VALID [2018-11-23 12:04:39,326 INFO L256 TraceCheckUtils]: 73: Hoare triple {10206#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {10206#false} is VALID [2018-11-23 12:04:39,326 INFO L273 TraceCheckUtils]: 74: Hoare triple {10206#false} ~cond := #in~cond; {10206#false} is VALID [2018-11-23 12:04:39,326 INFO L273 TraceCheckUtils]: 75: Hoare triple {10206#false} assume 0 == ~cond; {10206#false} is VALID [2018-11-23 12:04:39,327 INFO L273 TraceCheckUtils]: 76: Hoare triple {10206#false} assume !false; {10206#false} is VALID [2018-11-23 12:04:39,329 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 12:04:39,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:39,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 12:04:39,351 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 77 [2018-11-23 12:04:39,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:39,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:04:39,381 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:39,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:04:39,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:04:39,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:04:39,382 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 24 states. [2018-11-23 12:04:40,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:40,028 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-11-23 12:04:40,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:04:40,028 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 77 [2018-11-23 12:04:40,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:40,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:04:40,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 108 transitions. [2018-11-23 12:04:40,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:04:40,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 108 transitions. [2018-11-23 12:04:40,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 108 transitions. [2018-11-23 12:04:40,148 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:40,150 INFO L225 Difference]: With dead ends: 140 [2018-11-23 12:04:40,150 INFO L226 Difference]: Without dead ends: 85 [2018-11-23 12:04:40,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:04:40,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-23 12:04:40,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-11-23 12:04:40,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:40,221 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 85 states. [2018-11-23 12:04:40,221 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 85 states. [2018-11-23 12:04:40,221 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 85 states. [2018-11-23 12:04:40,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:40,222 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-11-23 12:04:40,222 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2018-11-23 12:04:40,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:40,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:40,223 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 85 states. [2018-11-23 12:04:40,223 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 85 states. [2018-11-23 12:04:40,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:40,224 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-11-23 12:04:40,224 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2018-11-23 12:04:40,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:40,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:40,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:40,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:40,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 12:04:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2018-11-23 12:04:40,226 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 77 [2018-11-23 12:04:40,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:40,227 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2018-11-23 12:04:40,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:04:40,227 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2018-11-23 12:04:40,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 12:04:40,228 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:40,228 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 12:04:40,228 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:40,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:40,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1924341697, now seen corresponding path program 21 times [2018-11-23 12:04:40,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:40,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:40,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:40,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:04:40,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:40,730 INFO L256 TraceCheckUtils]: 0: Hoare triple {11045#true} call ULTIMATE.init(); {11045#true} is VALID [2018-11-23 12:04:40,730 INFO L273 TraceCheckUtils]: 1: Hoare triple {11045#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11045#true} is VALID [2018-11-23 12:04:40,730 INFO L273 TraceCheckUtils]: 2: Hoare triple {11045#true} assume true; {11045#true} is VALID [2018-11-23 12:04:40,730 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11045#true} {11045#true} #74#return; {11045#true} is VALID [2018-11-23 12:04:40,730 INFO L256 TraceCheckUtils]: 4: Hoare triple {11045#true} call #t~ret2 := main(); {11045#true} is VALID [2018-11-23 12:04:40,731 INFO L273 TraceCheckUtils]: 5: Hoare triple {11045#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11047#(= main_~i~0 0)} is VALID [2018-11-23 12:04:40,731 INFO L273 TraceCheckUtils]: 6: Hoare triple {11047#(= 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; {11048#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:40,732 INFO L273 TraceCheckUtils]: 7: Hoare triple {11048#(<= 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; {11049#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:40,733 INFO L273 TraceCheckUtils]: 8: Hoare triple {11049#(<= 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; {11050#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:40,734 INFO L273 TraceCheckUtils]: 9: Hoare triple {11050#(<= 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; {11051#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:40,735 INFO L273 TraceCheckUtils]: 10: Hoare triple {11051#(<= 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; {11052#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:40,736 INFO L273 TraceCheckUtils]: 11: Hoare triple {11052#(<= 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; {11053#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:40,741 INFO L273 TraceCheckUtils]: 12: Hoare triple {11053#(<= 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; {11054#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:40,742 INFO L273 TraceCheckUtils]: 13: Hoare triple {11054#(<= 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; {11055#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:40,742 INFO L273 TraceCheckUtils]: 14: Hoare triple {11055#(<= 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; {11056#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:40,743 INFO L273 TraceCheckUtils]: 15: Hoare triple {11056#(<= 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; {11057#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:40,743 INFO L273 TraceCheckUtils]: 16: Hoare triple {11057#(<= 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; {11058#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:40,744 INFO L273 TraceCheckUtils]: 17: Hoare triple {11058#(<= 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; {11059#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:40,745 INFO L273 TraceCheckUtils]: 18: Hoare triple {11059#(<= 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; {11060#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:40,746 INFO L273 TraceCheckUtils]: 19: Hoare triple {11060#(<= 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; {11061#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:40,746 INFO L273 TraceCheckUtils]: 20: Hoare triple {11061#(<= 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; {11062#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:40,747 INFO L273 TraceCheckUtils]: 21: Hoare triple {11062#(<= 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; {11063#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:40,748 INFO L273 TraceCheckUtils]: 22: Hoare triple {11063#(<= 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; {11064#(<= main_~i~0 17)} is VALID [2018-11-23 12:04:40,749 INFO L273 TraceCheckUtils]: 23: Hoare triple {11064#(<= 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; {11065#(<= main_~i~0 18)} is VALID [2018-11-23 12:04:40,750 INFO L273 TraceCheckUtils]: 24: Hoare triple {11065#(<= 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; {11066#(<= main_~i~0 19)} is VALID [2018-11-23 12:04:40,751 INFO L273 TraceCheckUtils]: 25: Hoare triple {11066#(<= 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; {11067#(<= main_~i~0 20)} is VALID [2018-11-23 12:04:40,752 INFO L273 TraceCheckUtils]: 26: Hoare triple {11067#(<= 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; {11068#(<= main_~i~0 21)} is VALID [2018-11-23 12:04:40,753 INFO L273 TraceCheckUtils]: 27: Hoare triple {11068#(<= main_~i~0 21)} assume !(~i~0 < 100000); {11046#false} is VALID [2018-11-23 12:04:40,753 INFO L273 TraceCheckUtils]: 28: Hoare triple {11046#false} ~i~0 := 0; {11046#false} is VALID [2018-11-23 12:04:40,753 INFO L273 TraceCheckUtils]: 29: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,754 INFO L273 TraceCheckUtils]: 30: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,754 INFO L273 TraceCheckUtils]: 31: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,754 INFO L273 TraceCheckUtils]: 32: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,754 INFO L273 TraceCheckUtils]: 33: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,755 INFO L273 TraceCheckUtils]: 34: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,755 INFO L273 TraceCheckUtils]: 35: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,755 INFO L273 TraceCheckUtils]: 36: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,756 INFO L273 TraceCheckUtils]: 37: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,756 INFO L273 TraceCheckUtils]: 38: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,756 INFO L273 TraceCheckUtils]: 39: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,756 INFO L273 TraceCheckUtils]: 40: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,757 INFO L273 TraceCheckUtils]: 41: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,757 INFO L273 TraceCheckUtils]: 42: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,757 INFO L273 TraceCheckUtils]: 43: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,757 INFO L273 TraceCheckUtils]: 44: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,757 INFO L273 TraceCheckUtils]: 45: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,758 INFO L273 TraceCheckUtils]: 46: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,758 INFO L273 TraceCheckUtils]: 47: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,758 INFO L273 TraceCheckUtils]: 48: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,758 INFO L273 TraceCheckUtils]: 49: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,758 INFO L273 TraceCheckUtils]: 50: Hoare triple {11046#false} assume !(~i~0 < 100000); {11046#false} is VALID [2018-11-23 12:04:40,758 INFO L273 TraceCheckUtils]: 51: Hoare triple {11046#false} ~i~0 := 0; {11046#false} is VALID [2018-11-23 12:04:40,759 INFO L273 TraceCheckUtils]: 52: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,759 INFO L273 TraceCheckUtils]: 53: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,759 INFO L273 TraceCheckUtils]: 54: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,759 INFO L273 TraceCheckUtils]: 55: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,759 INFO L273 TraceCheckUtils]: 56: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,759 INFO L273 TraceCheckUtils]: 57: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,760 INFO L273 TraceCheckUtils]: 58: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,760 INFO L273 TraceCheckUtils]: 59: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,760 INFO L273 TraceCheckUtils]: 60: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,760 INFO L273 TraceCheckUtils]: 61: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,760 INFO L273 TraceCheckUtils]: 62: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,760 INFO L273 TraceCheckUtils]: 63: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,761 INFO L273 TraceCheckUtils]: 64: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,761 INFO L273 TraceCheckUtils]: 65: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,761 INFO L273 TraceCheckUtils]: 66: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,761 INFO L273 TraceCheckUtils]: 67: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,761 INFO L273 TraceCheckUtils]: 68: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,761 INFO L273 TraceCheckUtils]: 69: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,762 INFO L273 TraceCheckUtils]: 70: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,762 INFO L273 TraceCheckUtils]: 71: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,762 INFO L273 TraceCheckUtils]: 72: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:40,762 INFO L273 TraceCheckUtils]: 73: Hoare triple {11046#false} assume !(~i~0 < 100000); {11046#false} is VALID [2018-11-23 12:04:40,762 INFO L273 TraceCheckUtils]: 74: Hoare triple {11046#false} havoc ~x~0;~x~0 := 0; {11046#false} is VALID [2018-11-23 12:04:40,762 INFO L273 TraceCheckUtils]: 75: Hoare triple {11046#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11046#false} is VALID [2018-11-23 12:04:40,762 INFO L256 TraceCheckUtils]: 76: Hoare triple {11046#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {11046#false} is VALID [2018-11-23 12:04:40,763 INFO L273 TraceCheckUtils]: 77: Hoare triple {11046#false} ~cond := #in~cond; {11046#false} is VALID [2018-11-23 12:04:40,763 INFO L273 TraceCheckUtils]: 78: Hoare triple {11046#false} assume 0 == ~cond; {11046#false} is VALID [2018-11-23 12:04:40,763 INFO L273 TraceCheckUtils]: 79: Hoare triple {11046#false} assume !false; {11046#false} is VALID [2018-11-23 12:04:40,767 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 12:04:40,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:40,767 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:04:40,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:04:51,853 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-23 12:04:51,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:04:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:51,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:52,229 INFO L256 TraceCheckUtils]: 0: Hoare triple {11045#true} call ULTIMATE.init(); {11045#true} is VALID [2018-11-23 12:04:52,229 INFO L273 TraceCheckUtils]: 1: Hoare triple {11045#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11045#true} is VALID [2018-11-23 12:04:52,230 INFO L273 TraceCheckUtils]: 2: Hoare triple {11045#true} assume true; {11045#true} is VALID [2018-11-23 12:04:52,230 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11045#true} {11045#true} #74#return; {11045#true} is VALID [2018-11-23 12:04:52,230 INFO L256 TraceCheckUtils]: 4: Hoare triple {11045#true} call #t~ret2 := main(); {11045#true} is VALID [2018-11-23 12:04:52,231 INFO L273 TraceCheckUtils]: 5: Hoare triple {11045#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11087#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:52,232 INFO L273 TraceCheckUtils]: 6: Hoare triple {11087#(<= 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; {11048#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:52,232 INFO L273 TraceCheckUtils]: 7: Hoare triple {11048#(<= 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; {11049#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:52,233 INFO L273 TraceCheckUtils]: 8: Hoare triple {11049#(<= 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; {11050#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:52,233 INFO L273 TraceCheckUtils]: 9: Hoare triple {11050#(<= 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; {11051#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:52,234 INFO L273 TraceCheckUtils]: 10: Hoare triple {11051#(<= 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; {11052#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:52,235 INFO L273 TraceCheckUtils]: 11: Hoare triple {11052#(<= 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; {11053#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:52,236 INFO L273 TraceCheckUtils]: 12: Hoare triple {11053#(<= 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; {11054#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:52,237 INFO L273 TraceCheckUtils]: 13: Hoare triple {11054#(<= 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; {11055#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:52,238 INFO L273 TraceCheckUtils]: 14: Hoare triple {11055#(<= 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; {11056#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:52,239 INFO L273 TraceCheckUtils]: 15: Hoare triple {11056#(<= 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; {11057#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:52,240 INFO L273 TraceCheckUtils]: 16: Hoare triple {11057#(<= 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; {11058#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:52,241 INFO L273 TraceCheckUtils]: 17: Hoare triple {11058#(<= 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; {11059#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:52,242 INFO L273 TraceCheckUtils]: 18: Hoare triple {11059#(<= 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; {11060#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:52,243 INFO L273 TraceCheckUtils]: 19: Hoare triple {11060#(<= 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; {11061#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:52,243 INFO L273 TraceCheckUtils]: 20: Hoare triple {11061#(<= 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; {11062#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:52,244 INFO L273 TraceCheckUtils]: 21: Hoare triple {11062#(<= 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; {11063#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:52,245 INFO L273 TraceCheckUtils]: 22: Hoare triple {11063#(<= 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; {11064#(<= main_~i~0 17)} is VALID [2018-11-23 12:04:52,246 INFO L273 TraceCheckUtils]: 23: Hoare triple {11064#(<= 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; {11065#(<= main_~i~0 18)} is VALID [2018-11-23 12:04:52,247 INFO L273 TraceCheckUtils]: 24: Hoare triple {11065#(<= 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; {11066#(<= main_~i~0 19)} is VALID [2018-11-23 12:04:52,248 INFO L273 TraceCheckUtils]: 25: Hoare triple {11066#(<= 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; {11067#(<= main_~i~0 20)} is VALID [2018-11-23 12:04:52,249 INFO L273 TraceCheckUtils]: 26: Hoare triple {11067#(<= 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; {11068#(<= main_~i~0 21)} is VALID [2018-11-23 12:04:52,250 INFO L273 TraceCheckUtils]: 27: Hoare triple {11068#(<= main_~i~0 21)} assume !(~i~0 < 100000); {11046#false} is VALID [2018-11-23 12:04:52,250 INFO L273 TraceCheckUtils]: 28: Hoare triple {11046#false} ~i~0 := 0; {11046#false} is VALID [2018-11-23 12:04:52,250 INFO L273 TraceCheckUtils]: 29: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,250 INFO L273 TraceCheckUtils]: 30: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,251 INFO L273 TraceCheckUtils]: 31: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,251 INFO L273 TraceCheckUtils]: 32: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,251 INFO L273 TraceCheckUtils]: 33: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,251 INFO L273 TraceCheckUtils]: 34: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,251 INFO L273 TraceCheckUtils]: 35: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,252 INFO L273 TraceCheckUtils]: 36: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,252 INFO L273 TraceCheckUtils]: 37: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,252 INFO L273 TraceCheckUtils]: 38: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,252 INFO L273 TraceCheckUtils]: 39: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,252 INFO L273 TraceCheckUtils]: 40: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,253 INFO L273 TraceCheckUtils]: 41: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,253 INFO L273 TraceCheckUtils]: 42: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,253 INFO L273 TraceCheckUtils]: 43: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,253 INFO L273 TraceCheckUtils]: 44: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,253 INFO L273 TraceCheckUtils]: 45: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,254 INFO L273 TraceCheckUtils]: 46: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,254 INFO L273 TraceCheckUtils]: 47: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,254 INFO L273 TraceCheckUtils]: 48: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,254 INFO L273 TraceCheckUtils]: 49: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,254 INFO L273 TraceCheckUtils]: 50: Hoare triple {11046#false} assume !(~i~0 < 100000); {11046#false} is VALID [2018-11-23 12:04:52,255 INFO L273 TraceCheckUtils]: 51: Hoare triple {11046#false} ~i~0 := 0; {11046#false} is VALID [2018-11-23 12:04:52,255 INFO L273 TraceCheckUtils]: 52: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,255 INFO L273 TraceCheckUtils]: 53: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,255 INFO L273 TraceCheckUtils]: 54: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,255 INFO L273 TraceCheckUtils]: 55: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,255 INFO L273 TraceCheckUtils]: 56: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,255 INFO L273 TraceCheckUtils]: 57: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,255 INFO L273 TraceCheckUtils]: 58: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,255 INFO L273 TraceCheckUtils]: 59: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,256 INFO L273 TraceCheckUtils]: 60: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,256 INFO L273 TraceCheckUtils]: 61: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,256 INFO L273 TraceCheckUtils]: 62: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,256 INFO L273 TraceCheckUtils]: 63: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,256 INFO L273 TraceCheckUtils]: 64: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,256 INFO L273 TraceCheckUtils]: 65: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,256 INFO L273 TraceCheckUtils]: 66: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,256 INFO L273 TraceCheckUtils]: 67: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,257 INFO L273 TraceCheckUtils]: 68: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,257 INFO L273 TraceCheckUtils]: 69: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,257 INFO L273 TraceCheckUtils]: 70: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,257 INFO L273 TraceCheckUtils]: 71: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,257 INFO L273 TraceCheckUtils]: 72: Hoare triple {11046#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11046#false} is VALID [2018-11-23 12:04:52,257 INFO L273 TraceCheckUtils]: 73: Hoare triple {11046#false} assume !(~i~0 < 100000); {11046#false} is VALID [2018-11-23 12:04:52,257 INFO L273 TraceCheckUtils]: 74: Hoare triple {11046#false} havoc ~x~0;~x~0 := 0; {11046#false} is VALID [2018-11-23 12:04:52,257 INFO L273 TraceCheckUtils]: 75: Hoare triple {11046#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11046#false} is VALID [2018-11-23 12:04:52,257 INFO L256 TraceCheckUtils]: 76: Hoare triple {11046#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {11046#false} is VALID [2018-11-23 12:04:52,258 INFO L273 TraceCheckUtils]: 77: Hoare triple {11046#false} ~cond := #in~cond; {11046#false} is VALID [2018-11-23 12:04:52,258 INFO L273 TraceCheckUtils]: 78: Hoare triple {11046#false} assume 0 == ~cond; {11046#false} is VALID [2018-11-23 12:04:52,258 INFO L273 TraceCheckUtils]: 79: Hoare triple {11046#false} assume !false; {11046#false} is VALID [2018-11-23 12:04:52,261 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 12:04:52,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:52,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 12:04:52,286 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 80 [2018-11-23 12:04:52,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:52,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 12:04:52,321 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:52,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 12:04:52,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 12:04:52,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:04:52,322 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand 25 states. [2018-11-23 12:04:53,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:53,033 INFO L93 Difference]: Finished difference Result 145 states and 153 transitions. [2018-11-23 12:04:53,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:04:53,033 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 80 [2018-11-23 12:04:53,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:53,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:04:53,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 111 transitions. [2018-11-23 12:04:53,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:04:53,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 111 transitions. [2018-11-23 12:04:53,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 111 transitions. [2018-11-23 12:04:53,152 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 12:04:53,154 INFO L225 Difference]: With dead ends: 145 [2018-11-23 12:04:53,154 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 12:04:53,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:04:53,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 12:04:53,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-11-23 12:04:53,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:53,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 88 states. [2018-11-23 12:04:53,224 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2018-11-23 12:04:53,224 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2018-11-23 12:04:53,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:53,226 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2018-11-23 12:04:53,226 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2018-11-23 12:04:53,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:53,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:53,227 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2018-11-23 12:04:53,227 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2018-11-23 12:04:53,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:53,228 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2018-11-23 12:04:53,228 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2018-11-23 12:04:53,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:53,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:53,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:53,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:53,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 12:04:53,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2018-11-23 12:04:53,230 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 80 [2018-11-23 12:04:53,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:53,231 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2018-11-23 12:04:53,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 12:04:53,231 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2018-11-23 12:04:53,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 12:04:53,231 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:53,232 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 12:04:53,232 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:53,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:53,232 INFO L82 PathProgramCache]: Analyzing trace with hash 473114, now seen corresponding path program 22 times [2018-11-23 12:04:53,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:53,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:53,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:53,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:04:53,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:53,765 INFO L256 TraceCheckUtils]: 0: Hoare triple {11917#true} call ULTIMATE.init(); {11917#true} is VALID [2018-11-23 12:04:53,765 INFO L273 TraceCheckUtils]: 1: Hoare triple {11917#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11917#true} is VALID [2018-11-23 12:04:53,765 INFO L273 TraceCheckUtils]: 2: Hoare triple {11917#true} assume true; {11917#true} is VALID [2018-11-23 12:04:53,765 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11917#true} {11917#true} #74#return; {11917#true} is VALID [2018-11-23 12:04:53,765 INFO L256 TraceCheckUtils]: 4: Hoare triple {11917#true} call #t~ret2 := main(); {11917#true} is VALID [2018-11-23 12:04:53,766 INFO L273 TraceCheckUtils]: 5: Hoare triple {11917#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11919#(= main_~i~0 0)} is VALID [2018-11-23 12:04:53,766 INFO L273 TraceCheckUtils]: 6: Hoare triple {11919#(= 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; {11920#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:53,767 INFO L273 TraceCheckUtils]: 7: Hoare triple {11920#(<= 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; {11921#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:53,768 INFO L273 TraceCheckUtils]: 8: Hoare triple {11921#(<= 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; {11922#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:53,769 INFO L273 TraceCheckUtils]: 9: Hoare triple {11922#(<= 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; {11923#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:53,770 INFO L273 TraceCheckUtils]: 10: Hoare triple {11923#(<= 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; {11924#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:53,771 INFO L273 TraceCheckUtils]: 11: Hoare triple {11924#(<= 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; {11925#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:53,772 INFO L273 TraceCheckUtils]: 12: Hoare triple {11925#(<= 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; {11926#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:53,772 INFO L273 TraceCheckUtils]: 13: Hoare triple {11926#(<= 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; {11927#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:53,773 INFO L273 TraceCheckUtils]: 14: Hoare triple {11927#(<= 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; {11928#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:53,774 INFO L273 TraceCheckUtils]: 15: Hoare triple {11928#(<= 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; {11929#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:53,775 INFO L273 TraceCheckUtils]: 16: Hoare triple {11929#(<= 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; {11930#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:53,776 INFO L273 TraceCheckUtils]: 17: Hoare triple {11930#(<= 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; {11931#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:53,777 INFO L273 TraceCheckUtils]: 18: Hoare triple {11931#(<= 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; {11932#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:53,778 INFO L273 TraceCheckUtils]: 19: Hoare triple {11932#(<= 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; {11933#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:53,779 INFO L273 TraceCheckUtils]: 20: Hoare triple {11933#(<= 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; {11934#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:53,780 INFO L273 TraceCheckUtils]: 21: Hoare triple {11934#(<= 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; {11935#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:53,781 INFO L273 TraceCheckUtils]: 22: Hoare triple {11935#(<= 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; {11936#(<= main_~i~0 17)} is VALID [2018-11-23 12:04:53,782 INFO L273 TraceCheckUtils]: 23: Hoare triple {11936#(<= 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; {11937#(<= main_~i~0 18)} is VALID [2018-11-23 12:04:53,783 INFO L273 TraceCheckUtils]: 24: Hoare triple {11937#(<= 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; {11938#(<= main_~i~0 19)} is VALID [2018-11-23 12:04:53,783 INFO L273 TraceCheckUtils]: 25: Hoare triple {11938#(<= 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; {11939#(<= main_~i~0 20)} is VALID [2018-11-23 12:04:53,784 INFO L273 TraceCheckUtils]: 26: Hoare triple {11939#(<= 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; {11940#(<= main_~i~0 21)} is VALID [2018-11-23 12:04:53,785 INFO L273 TraceCheckUtils]: 27: Hoare triple {11940#(<= 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; {11941#(<= main_~i~0 22)} is VALID [2018-11-23 12:04:53,786 INFO L273 TraceCheckUtils]: 28: Hoare triple {11941#(<= main_~i~0 22)} assume !(~i~0 < 100000); {11918#false} is VALID [2018-11-23 12:04:53,786 INFO L273 TraceCheckUtils]: 29: Hoare triple {11918#false} ~i~0 := 0; {11918#false} is VALID [2018-11-23 12:04:53,786 INFO L273 TraceCheckUtils]: 30: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,787 INFO L273 TraceCheckUtils]: 31: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,787 INFO L273 TraceCheckUtils]: 32: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,787 INFO L273 TraceCheckUtils]: 33: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,787 INFO L273 TraceCheckUtils]: 34: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,787 INFO L273 TraceCheckUtils]: 35: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,788 INFO L273 TraceCheckUtils]: 36: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,788 INFO L273 TraceCheckUtils]: 37: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,788 INFO L273 TraceCheckUtils]: 38: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,788 INFO L273 TraceCheckUtils]: 39: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,788 INFO L273 TraceCheckUtils]: 40: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,789 INFO L273 TraceCheckUtils]: 41: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,789 INFO L273 TraceCheckUtils]: 42: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,789 INFO L273 TraceCheckUtils]: 43: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,789 INFO L273 TraceCheckUtils]: 44: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,789 INFO L273 TraceCheckUtils]: 45: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,789 INFO L273 TraceCheckUtils]: 46: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,789 INFO L273 TraceCheckUtils]: 47: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,789 INFO L273 TraceCheckUtils]: 48: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,790 INFO L273 TraceCheckUtils]: 49: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,790 INFO L273 TraceCheckUtils]: 50: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,790 INFO L273 TraceCheckUtils]: 51: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,790 INFO L273 TraceCheckUtils]: 52: Hoare triple {11918#false} assume !(~i~0 < 100000); {11918#false} is VALID [2018-11-23 12:04:53,790 INFO L273 TraceCheckUtils]: 53: Hoare triple {11918#false} ~i~0 := 0; {11918#false} is VALID [2018-11-23 12:04:53,790 INFO L273 TraceCheckUtils]: 54: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,790 INFO L273 TraceCheckUtils]: 55: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,790 INFO L273 TraceCheckUtils]: 56: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,790 INFO L273 TraceCheckUtils]: 57: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,791 INFO L273 TraceCheckUtils]: 58: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,791 INFO L273 TraceCheckUtils]: 59: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,791 INFO L273 TraceCheckUtils]: 60: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,791 INFO L273 TraceCheckUtils]: 61: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,791 INFO L273 TraceCheckUtils]: 62: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,791 INFO L273 TraceCheckUtils]: 63: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,791 INFO L273 TraceCheckUtils]: 64: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,791 INFO L273 TraceCheckUtils]: 65: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,792 INFO L273 TraceCheckUtils]: 66: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,792 INFO L273 TraceCheckUtils]: 67: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,792 INFO L273 TraceCheckUtils]: 68: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,792 INFO L273 TraceCheckUtils]: 69: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,792 INFO L273 TraceCheckUtils]: 70: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,792 INFO L273 TraceCheckUtils]: 71: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,792 INFO L273 TraceCheckUtils]: 72: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,792 INFO L273 TraceCheckUtils]: 73: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,792 INFO L273 TraceCheckUtils]: 74: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,793 INFO L273 TraceCheckUtils]: 75: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:53,793 INFO L273 TraceCheckUtils]: 76: Hoare triple {11918#false} assume !(~i~0 < 100000); {11918#false} is VALID [2018-11-23 12:04:53,793 INFO L273 TraceCheckUtils]: 77: Hoare triple {11918#false} havoc ~x~0;~x~0 := 0; {11918#false} is VALID [2018-11-23 12:04:53,793 INFO L273 TraceCheckUtils]: 78: Hoare triple {11918#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11918#false} is VALID [2018-11-23 12:04:53,793 INFO L256 TraceCheckUtils]: 79: Hoare triple {11918#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {11918#false} is VALID [2018-11-23 12:04:53,793 INFO L273 TraceCheckUtils]: 80: Hoare triple {11918#false} ~cond := #in~cond; {11918#false} is VALID [2018-11-23 12:04:53,793 INFO L273 TraceCheckUtils]: 81: Hoare triple {11918#false} assume 0 == ~cond; {11918#false} is VALID [2018-11-23 12:04:53,793 INFO L273 TraceCheckUtils]: 82: Hoare triple {11918#false} assume !false; {11918#false} is VALID [2018-11-23 12:04:53,797 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 12:04:53,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:53,797 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:04:53,806 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:04:53,860 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:04:53,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:04:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:53,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:54,069 INFO L256 TraceCheckUtils]: 0: Hoare triple {11917#true} call ULTIMATE.init(); {11917#true} is VALID [2018-11-23 12:04:54,069 INFO L273 TraceCheckUtils]: 1: Hoare triple {11917#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11917#true} is VALID [2018-11-23 12:04:54,069 INFO L273 TraceCheckUtils]: 2: Hoare triple {11917#true} assume true; {11917#true} is VALID [2018-11-23 12:04:54,069 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11917#true} {11917#true} #74#return; {11917#true} is VALID [2018-11-23 12:04:54,070 INFO L256 TraceCheckUtils]: 4: Hoare triple {11917#true} call #t~ret2 := main(); {11917#true} is VALID [2018-11-23 12:04:54,071 INFO L273 TraceCheckUtils]: 5: Hoare triple {11917#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11960#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:54,071 INFO L273 TraceCheckUtils]: 6: Hoare triple {11960#(<= 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; {11920#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:54,072 INFO L273 TraceCheckUtils]: 7: Hoare triple {11920#(<= 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; {11921#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:54,073 INFO L273 TraceCheckUtils]: 8: Hoare triple {11921#(<= 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; {11922#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:54,073 INFO L273 TraceCheckUtils]: 9: Hoare triple {11922#(<= 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; {11923#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:54,074 INFO L273 TraceCheckUtils]: 10: Hoare triple {11923#(<= 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; {11924#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:54,074 INFO L273 TraceCheckUtils]: 11: Hoare triple {11924#(<= 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; {11925#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:54,075 INFO L273 TraceCheckUtils]: 12: Hoare triple {11925#(<= 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; {11926#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:54,076 INFO L273 TraceCheckUtils]: 13: Hoare triple {11926#(<= 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; {11927#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:54,077 INFO L273 TraceCheckUtils]: 14: Hoare triple {11927#(<= 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; {11928#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:54,078 INFO L273 TraceCheckUtils]: 15: Hoare triple {11928#(<= 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; {11929#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:54,079 INFO L273 TraceCheckUtils]: 16: Hoare triple {11929#(<= 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; {11930#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:54,080 INFO L273 TraceCheckUtils]: 17: Hoare triple {11930#(<= 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; {11931#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:54,081 INFO L273 TraceCheckUtils]: 18: Hoare triple {11931#(<= 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; {11932#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:54,082 INFO L273 TraceCheckUtils]: 19: Hoare triple {11932#(<= 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; {11933#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:54,082 INFO L273 TraceCheckUtils]: 20: Hoare triple {11933#(<= 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; {11934#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:54,083 INFO L273 TraceCheckUtils]: 21: Hoare triple {11934#(<= 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; {11935#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:54,084 INFO L273 TraceCheckUtils]: 22: Hoare triple {11935#(<= 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; {11936#(<= main_~i~0 17)} is VALID [2018-11-23 12:04:54,085 INFO L273 TraceCheckUtils]: 23: Hoare triple {11936#(<= 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; {11937#(<= main_~i~0 18)} is VALID [2018-11-23 12:04:54,086 INFO L273 TraceCheckUtils]: 24: Hoare triple {11937#(<= 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; {11938#(<= main_~i~0 19)} is VALID [2018-11-23 12:04:54,087 INFO L273 TraceCheckUtils]: 25: Hoare triple {11938#(<= 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; {11939#(<= main_~i~0 20)} is VALID [2018-11-23 12:04:54,088 INFO L273 TraceCheckUtils]: 26: Hoare triple {11939#(<= 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; {11940#(<= main_~i~0 21)} is VALID [2018-11-23 12:04:54,089 INFO L273 TraceCheckUtils]: 27: Hoare triple {11940#(<= 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; {11941#(<= main_~i~0 22)} is VALID [2018-11-23 12:04:54,090 INFO L273 TraceCheckUtils]: 28: Hoare triple {11941#(<= main_~i~0 22)} assume !(~i~0 < 100000); {11918#false} is VALID [2018-11-23 12:04:54,090 INFO L273 TraceCheckUtils]: 29: Hoare triple {11918#false} ~i~0 := 0; {11918#false} is VALID [2018-11-23 12:04:54,090 INFO L273 TraceCheckUtils]: 30: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,090 INFO L273 TraceCheckUtils]: 31: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,090 INFO L273 TraceCheckUtils]: 32: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,091 INFO L273 TraceCheckUtils]: 33: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,091 INFO L273 TraceCheckUtils]: 34: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,091 INFO L273 TraceCheckUtils]: 35: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,091 INFO L273 TraceCheckUtils]: 36: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,091 INFO L273 TraceCheckUtils]: 37: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,092 INFO L273 TraceCheckUtils]: 38: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,092 INFO L273 TraceCheckUtils]: 39: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,092 INFO L273 TraceCheckUtils]: 40: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,092 INFO L273 TraceCheckUtils]: 41: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,092 INFO L273 TraceCheckUtils]: 42: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,093 INFO L273 TraceCheckUtils]: 43: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,093 INFO L273 TraceCheckUtils]: 44: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,093 INFO L273 TraceCheckUtils]: 45: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,093 INFO L273 TraceCheckUtils]: 46: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,093 INFO L273 TraceCheckUtils]: 47: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,094 INFO L273 TraceCheckUtils]: 48: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,094 INFO L273 TraceCheckUtils]: 49: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,094 INFO L273 TraceCheckUtils]: 50: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,094 INFO L273 TraceCheckUtils]: 51: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,094 INFO L273 TraceCheckUtils]: 52: Hoare triple {11918#false} assume !(~i~0 < 100000); {11918#false} is VALID [2018-11-23 12:04:54,094 INFO L273 TraceCheckUtils]: 53: Hoare triple {11918#false} ~i~0 := 0; {11918#false} is VALID [2018-11-23 12:04:54,094 INFO L273 TraceCheckUtils]: 54: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,095 INFO L273 TraceCheckUtils]: 55: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,095 INFO L273 TraceCheckUtils]: 56: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,095 INFO L273 TraceCheckUtils]: 57: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,095 INFO L273 TraceCheckUtils]: 58: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,095 INFO L273 TraceCheckUtils]: 59: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,095 INFO L273 TraceCheckUtils]: 60: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,095 INFO L273 TraceCheckUtils]: 61: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,095 INFO L273 TraceCheckUtils]: 62: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,096 INFO L273 TraceCheckUtils]: 63: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,096 INFO L273 TraceCheckUtils]: 64: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,096 INFO L273 TraceCheckUtils]: 65: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,096 INFO L273 TraceCheckUtils]: 66: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,096 INFO L273 TraceCheckUtils]: 67: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,096 INFO L273 TraceCheckUtils]: 68: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,096 INFO L273 TraceCheckUtils]: 69: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,096 INFO L273 TraceCheckUtils]: 70: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,096 INFO L273 TraceCheckUtils]: 71: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,097 INFO L273 TraceCheckUtils]: 72: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,097 INFO L273 TraceCheckUtils]: 73: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,097 INFO L273 TraceCheckUtils]: 74: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,097 INFO L273 TraceCheckUtils]: 75: Hoare triple {11918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11918#false} is VALID [2018-11-23 12:04:54,097 INFO L273 TraceCheckUtils]: 76: Hoare triple {11918#false} assume !(~i~0 < 100000); {11918#false} is VALID [2018-11-23 12:04:54,097 INFO L273 TraceCheckUtils]: 77: Hoare triple {11918#false} havoc ~x~0;~x~0 := 0; {11918#false} is VALID [2018-11-23 12:04:54,097 INFO L273 TraceCheckUtils]: 78: Hoare triple {11918#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11918#false} is VALID [2018-11-23 12:04:54,097 INFO L256 TraceCheckUtils]: 79: Hoare triple {11918#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {11918#false} is VALID [2018-11-23 12:04:54,097 INFO L273 TraceCheckUtils]: 80: Hoare triple {11918#false} ~cond := #in~cond; {11918#false} is VALID [2018-11-23 12:04:54,098 INFO L273 TraceCheckUtils]: 81: Hoare triple {11918#false} assume 0 == ~cond; {11918#false} is VALID [2018-11-23 12:04:54,098 INFO L273 TraceCheckUtils]: 82: Hoare triple {11918#false} assume !false; {11918#false} is VALID [2018-11-23 12:04:54,101 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 12:04:54,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:54,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 12:04:54,121 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 83 [2018-11-23 12:04:54,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:54,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:04:54,156 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:54,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:04:54,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:04:54,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:04:54,157 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand 26 states. [2018-11-23 12:04:54,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:54,747 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2018-11-23 12:04:54,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:04:54,747 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 83 [2018-11-23 12:04:54,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:54,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:04:54,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 114 transitions. [2018-11-23 12:04:54,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:04:54,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 114 transitions. [2018-11-23 12:04:54,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 114 transitions. [2018-11-23 12:04:54,880 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:54,882 INFO L225 Difference]: With dead ends: 150 [2018-11-23 12:04:54,882 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 12:04:54,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:04:54,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 12:04:54,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-11-23 12:04:54,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:54,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 91 states. [2018-11-23 12:04:54,961 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 91 states. [2018-11-23 12:04:54,961 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 91 states. [2018-11-23 12:04:54,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:54,962 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2018-11-23 12:04:54,963 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2018-11-23 12:04:54,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:54,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:54,963 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 91 states. [2018-11-23 12:04:54,963 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 91 states. [2018-11-23 12:04:54,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:54,965 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2018-11-23 12:04:54,965 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2018-11-23 12:04:54,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:54,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:54,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:54,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:54,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 12:04:54,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2018-11-23 12:04:54,967 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 83 [2018-11-23 12:04:54,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:54,967 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2018-11-23 12:04:54,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:04:54,968 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2018-11-23 12:04:54,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 12:04:54,968 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:54,968 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 12:04:54,969 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:54,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:54,969 INFO L82 PathProgramCache]: Analyzing trace with hash -874017631, now seen corresponding path program 23 times [2018-11-23 12:04:54,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:54,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:54,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:54,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:04:54,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:55,815 INFO L256 TraceCheckUtils]: 0: Hoare triple {12821#true} call ULTIMATE.init(); {12821#true} is VALID [2018-11-23 12:04:55,815 INFO L273 TraceCheckUtils]: 1: Hoare triple {12821#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12821#true} is VALID [2018-11-23 12:04:55,816 INFO L273 TraceCheckUtils]: 2: Hoare triple {12821#true} assume true; {12821#true} is VALID [2018-11-23 12:04:55,816 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12821#true} {12821#true} #74#return; {12821#true} is VALID [2018-11-23 12:04:55,816 INFO L256 TraceCheckUtils]: 4: Hoare triple {12821#true} call #t~ret2 := main(); {12821#true} is VALID [2018-11-23 12:04:55,816 INFO L273 TraceCheckUtils]: 5: Hoare triple {12821#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12823#(= main_~i~0 0)} is VALID [2018-11-23 12:04:55,817 INFO L273 TraceCheckUtils]: 6: Hoare triple {12823#(= 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; {12824#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:55,818 INFO L273 TraceCheckUtils]: 7: Hoare triple {12824#(<= 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; {12825#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:55,819 INFO L273 TraceCheckUtils]: 8: Hoare triple {12825#(<= 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; {12826#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:55,819 INFO L273 TraceCheckUtils]: 9: Hoare triple {12826#(<= 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; {12827#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:55,820 INFO L273 TraceCheckUtils]: 10: Hoare triple {12827#(<= 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; {12828#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:55,820 INFO L273 TraceCheckUtils]: 11: Hoare triple {12828#(<= 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; {12829#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:55,821 INFO L273 TraceCheckUtils]: 12: Hoare triple {12829#(<= 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; {12830#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:55,822 INFO L273 TraceCheckUtils]: 13: Hoare triple {12830#(<= 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; {12831#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:55,823 INFO L273 TraceCheckUtils]: 14: Hoare triple {12831#(<= 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; {12832#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:55,824 INFO L273 TraceCheckUtils]: 15: Hoare triple {12832#(<= 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; {12833#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:55,825 INFO L273 TraceCheckUtils]: 16: Hoare triple {12833#(<= 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; {12834#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:55,826 INFO L273 TraceCheckUtils]: 17: Hoare triple {12834#(<= 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; {12835#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:55,827 INFO L273 TraceCheckUtils]: 18: Hoare triple {12835#(<= 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; {12836#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:55,828 INFO L273 TraceCheckUtils]: 19: Hoare triple {12836#(<= 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; {12837#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:55,828 INFO L273 TraceCheckUtils]: 20: Hoare triple {12837#(<= 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; {12838#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:55,829 INFO L273 TraceCheckUtils]: 21: Hoare triple {12838#(<= 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; {12839#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:55,830 INFO L273 TraceCheckUtils]: 22: Hoare triple {12839#(<= 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; {12840#(<= main_~i~0 17)} is VALID [2018-11-23 12:04:55,831 INFO L273 TraceCheckUtils]: 23: Hoare triple {12840#(<= 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; {12841#(<= main_~i~0 18)} is VALID [2018-11-23 12:04:55,832 INFO L273 TraceCheckUtils]: 24: Hoare triple {12841#(<= 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; {12842#(<= main_~i~0 19)} is VALID [2018-11-23 12:04:55,833 INFO L273 TraceCheckUtils]: 25: Hoare triple {12842#(<= 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; {12843#(<= main_~i~0 20)} is VALID [2018-11-23 12:04:55,834 INFO L273 TraceCheckUtils]: 26: Hoare triple {12843#(<= 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; {12844#(<= main_~i~0 21)} is VALID [2018-11-23 12:04:55,835 INFO L273 TraceCheckUtils]: 27: Hoare triple {12844#(<= 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; {12845#(<= main_~i~0 22)} is VALID [2018-11-23 12:04:55,836 INFO L273 TraceCheckUtils]: 28: Hoare triple {12845#(<= 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; {12846#(<= main_~i~0 23)} is VALID [2018-11-23 12:04:55,837 INFO L273 TraceCheckUtils]: 29: Hoare triple {12846#(<= main_~i~0 23)} assume !(~i~0 < 100000); {12822#false} is VALID [2018-11-23 12:04:55,837 INFO L273 TraceCheckUtils]: 30: Hoare triple {12822#false} ~i~0 := 0; {12822#false} is VALID [2018-11-23 12:04:55,837 INFO L273 TraceCheckUtils]: 31: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,837 INFO L273 TraceCheckUtils]: 32: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,837 INFO L273 TraceCheckUtils]: 33: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,838 INFO L273 TraceCheckUtils]: 34: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,838 INFO L273 TraceCheckUtils]: 35: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,838 INFO L273 TraceCheckUtils]: 36: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,838 INFO L273 TraceCheckUtils]: 37: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,838 INFO L273 TraceCheckUtils]: 38: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,839 INFO L273 TraceCheckUtils]: 39: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,839 INFO L273 TraceCheckUtils]: 40: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,839 INFO L273 TraceCheckUtils]: 41: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,839 INFO L273 TraceCheckUtils]: 42: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,839 INFO L273 TraceCheckUtils]: 43: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,840 INFO L273 TraceCheckUtils]: 44: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,840 INFO L273 TraceCheckUtils]: 45: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,840 INFO L273 TraceCheckUtils]: 46: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,840 INFO L273 TraceCheckUtils]: 47: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,840 INFO L273 TraceCheckUtils]: 48: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,840 INFO L273 TraceCheckUtils]: 49: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,840 INFO L273 TraceCheckUtils]: 50: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,840 INFO L273 TraceCheckUtils]: 51: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,840 INFO L273 TraceCheckUtils]: 52: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,841 INFO L273 TraceCheckUtils]: 53: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,841 INFO L273 TraceCheckUtils]: 54: Hoare triple {12822#false} assume !(~i~0 < 100000); {12822#false} is VALID [2018-11-23 12:04:55,841 INFO L273 TraceCheckUtils]: 55: Hoare triple {12822#false} ~i~0 := 0; {12822#false} is VALID [2018-11-23 12:04:55,841 INFO L273 TraceCheckUtils]: 56: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,841 INFO L273 TraceCheckUtils]: 57: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,841 INFO L273 TraceCheckUtils]: 58: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,841 INFO L273 TraceCheckUtils]: 59: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,841 INFO L273 TraceCheckUtils]: 60: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,842 INFO L273 TraceCheckUtils]: 61: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,842 INFO L273 TraceCheckUtils]: 62: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,842 INFO L273 TraceCheckUtils]: 63: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,842 INFO L273 TraceCheckUtils]: 64: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,842 INFO L273 TraceCheckUtils]: 65: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,842 INFO L273 TraceCheckUtils]: 66: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,842 INFO L273 TraceCheckUtils]: 67: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,842 INFO L273 TraceCheckUtils]: 68: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,842 INFO L273 TraceCheckUtils]: 69: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,843 INFO L273 TraceCheckUtils]: 70: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,843 INFO L273 TraceCheckUtils]: 71: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,843 INFO L273 TraceCheckUtils]: 72: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,843 INFO L273 TraceCheckUtils]: 73: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,843 INFO L273 TraceCheckUtils]: 74: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,843 INFO L273 TraceCheckUtils]: 75: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,843 INFO L273 TraceCheckUtils]: 76: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,843 INFO L273 TraceCheckUtils]: 77: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,843 INFO L273 TraceCheckUtils]: 78: Hoare triple {12822#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12822#false} is VALID [2018-11-23 12:04:55,844 INFO L273 TraceCheckUtils]: 79: Hoare triple {12822#false} assume !(~i~0 < 100000); {12822#false} is VALID [2018-11-23 12:04:55,844 INFO L273 TraceCheckUtils]: 80: Hoare triple {12822#false} havoc ~x~0;~x~0 := 0; {12822#false} is VALID [2018-11-23 12:04:55,844 INFO L273 TraceCheckUtils]: 81: Hoare triple {12822#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12822#false} is VALID [2018-11-23 12:04:55,844 INFO L256 TraceCheckUtils]: 82: Hoare triple {12822#false} call __VERIFIER_assert((if 44 == #t~mem1 then 1 else 0)); {12822#false} is VALID [2018-11-23 12:04:55,844 INFO L273 TraceCheckUtils]: 83: Hoare triple {12822#false} ~cond := #in~cond; {12822#false} is VALID [2018-11-23 12:04:55,844 INFO L273 TraceCheckUtils]: 84: Hoare triple {12822#false} assume 0 == ~cond; {12822#false} is VALID [2018-11-23 12:04:55,844 INFO L273 TraceCheckUtils]: 85: Hoare triple {12822#false} assume !false; {12822#false} is VALID [2018-11-23 12:04:55,848 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 12:04:55,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:55,848 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:04:55,856 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1