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/loop-acceleration/array_false-unreach-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:04:48,627 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:04:48,630 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:04:48,642 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:04:48,643 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:04:48,644 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:04:48,645 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:04:48,647 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:04:48,649 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:04:48,649 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:04:48,650 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:04:48,651 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:04:48,652 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:04:48,652 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:04:48,655 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:04:48,656 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:04:48,657 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:04:48,661 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:04:48,663 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:04:48,667 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:04:48,668 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:04:48,672 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:04:48,676 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:04:48,677 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:04:48,681 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:04:48,682 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:04:48,683 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:04:48,683 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:04:48,686 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:04:48,688 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:04:48,688 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:04:48,689 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:04:48,689 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:04:48,691 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:04:48,692 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:04:48,694 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:04:48,694 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 13:04:48,722 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:04:48,723 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:04:48,724 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:04:48,724 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:04:48,725 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:04:48,725 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:04:48,725 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:04:48,726 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:04:48,727 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:04:48,727 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:04:48,727 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:04:48,727 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:04:48,727 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:04:48,728 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:04:48,728 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:04:48,728 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:04:48,728 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:04:48,728 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:04:48,729 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:04:48,729 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:04:48,729 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:04:48,729 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:04:48,729 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:04:48,730 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:04:48,730 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:04:48,730 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:04:48,730 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:04:48,730 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:04:48,732 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:04:48,732 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:04:48,732 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:04:48,797 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:04:48,811 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:04:48,815 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:04:48,816 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:04:48,817 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:04:48,817 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_false-unreach-call1_true-termination.i [2018-11-23 13:04:48,878 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bfd9090c/8893bf70eab6464baa707c6401ee5327/FLAG15efaac26 [2018-11-23 13:04:49,294 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:04:49,294 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_false-unreach-call1_true-termination.i [2018-11-23 13:04:49,301 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bfd9090c/8893bf70eab6464baa707c6401ee5327/FLAG15efaac26 [2018-11-23 13:04:49,689 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bfd9090c/8893bf70eab6464baa707c6401ee5327 [2018-11-23 13:04:49,699 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:04:49,700 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:04:49,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:04:49,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:04:49,705 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:04:49,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:04:49" (1/1) ... [2018-11-23 13:04:49,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61bbf104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:49, skipping insertion in model container [2018-11-23 13:04:49,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:04:49" (1/1) ... [2018-11-23 13:04:49,720 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:04:49,741 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:04:49,966 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:04:49,972 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:04:49,997 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:04:50,021 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:04:50,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:50 WrapperNode [2018-11-23 13:04:50,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:04:50,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:04:50,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:04:50,023 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:04:50,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:50" (1/1) ... [2018-11-23 13:04:50,037 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:50" (1/1) ... [2018-11-23 13:04:50,045 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:04:50,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:04:50,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:04:50,046 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:04:50,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:50" (1/1) ... [2018-11-23 13:04:50,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:50" (1/1) ... [2018-11-23 13:04:50,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:50" (1/1) ... [2018-11-23 13:04:50,058 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:50" (1/1) ... [2018-11-23 13:04:50,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:50" (1/1) ... [2018-11-23 13:04:50,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:50" (1/1) ... [2018-11-23 13:04:50,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:50" (1/1) ... [2018-11-23 13:04:50,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:04:50,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:04:50,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:04:50,077 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:04:50,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:50" (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 13:04:50,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:04:50,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:04:50,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:04:50,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:04:50,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:04:50,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:04:50,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:04:50,201 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:04:50,201 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:04:50,201 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:04:50,201 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:04:50,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:04:50,638 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:04:50,638 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:04:50,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:50 BoogieIcfgContainer [2018-11-23 13:04:50,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:04:50,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:04:50,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:04:50,646 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:04:50,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:04:49" (1/3) ... [2018-11-23 13:04:50,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dea39cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:04:50, skipping insertion in model container [2018-11-23 13:04:50,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:50" (2/3) ... [2018-11-23 13:04:50,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dea39cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:04:50, skipping insertion in model container [2018-11-23 13:04:50,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:50" (3/3) ... [2018-11-23 13:04:50,650 INFO L112 eAbstractionObserver]: Analyzing ICFG array_false-unreach-call1_true-termination.i [2018-11-23 13:04:50,658 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:04:50,665 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:04:50,681 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:04:50,714 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:04:50,715 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:04:50,715 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:04:50,715 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:04:50,716 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:04:50,716 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:04:50,716 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:04:50,716 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:04:50,716 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:04:50,733 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-23 13:04:50,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:04:50,740 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:50,741 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:50,743 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:50,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:50,749 INFO L82 PathProgramCache]: Analyzing trace with hash -267856937, now seen corresponding path program 1 times [2018-11-23 13:04:50,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:50,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:50,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:50,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:50,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:50,884 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-23 13:04:50,888 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24#true} is VALID [2018-11-23 13:04:50,889 INFO L273 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-23 13:04:50,889 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #35#return; {24#true} is VALID [2018-11-23 13:04:50,890 INFO L256 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret2 := main(); {24#true} is VALID [2018-11-23 13:04:50,890 INFO L273 TraceCheckUtils]: 5: Hoare triple {24#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {24#true} is VALID [2018-11-23 13:04:50,893 INFO L273 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2018-11-23 13:04:50,893 INFO L273 TraceCheckUtils]: 7: Hoare triple {25#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {25#false} is VALID [2018-11-23 13:04:50,894 INFO L256 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {25#false} is VALID [2018-11-23 13:04:50,895 INFO L273 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2018-11-23 13:04:50,895 INFO L273 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2018-11-23 13:04:50,895 INFO L273 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-23 13:04:50,899 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 13:04:50,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:50,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:04:50,906 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 13:04:50,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:50,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:04:50,967 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:50,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:04:50,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:04:50,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:04:50,983 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-23 13:04:51,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:51,066 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 13:04:51,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:04:51,067 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 13:04:51,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:51,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:04:51,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2018-11-23 13:04:51,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:04:51,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2018-11-23 13:04:51,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 37 transitions. [2018-11-23 13:04:51,427 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 13:04:51,436 INFO L225 Difference]: With dead ends: 34 [2018-11-23 13:04:51,436 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 13:04:51,440 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 13:04:51,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 13:04:51,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 13:04:51,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:51,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 13:04:51,557 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:04:51,557 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:04:51,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:51,561 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:04:51,561 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:04:51,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:51,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:51,562 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:04:51,562 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:04:51,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:51,565 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:04:51,565 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:04:51,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:51,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:51,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:51,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:51,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:04:51,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 13:04:51,570 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-11-23 13:04:51,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:51,571 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 13:04:51,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:04:51,571 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:04:51,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:04:51,572 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:51,572 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:51,572 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:51,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:51,573 INFO L82 PathProgramCache]: Analyzing trace with hash -439631843, now seen corresponding path program 1 times [2018-11-23 13:04:51,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:51,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:51,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:51,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:51,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:51,787 INFO L256 TraceCheckUtils]: 0: Hoare triple {120#true} call ULTIMATE.init(); {120#true} is VALID [2018-11-23 13:04:51,788 INFO L273 TraceCheckUtils]: 1: Hoare triple {120#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {120#true} is VALID [2018-11-23 13:04:51,788 INFO L273 TraceCheckUtils]: 2: Hoare triple {120#true} assume true; {120#true} is VALID [2018-11-23 13:04:51,788 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {120#true} {120#true} #35#return; {120#true} is VALID [2018-11-23 13:04:51,789 INFO L256 TraceCheckUtils]: 4: Hoare triple {120#true} call #t~ret2 := main(); {120#true} is VALID [2018-11-23 13:04:51,789 INFO L273 TraceCheckUtils]: 5: Hoare triple {120#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {122#(= main_~i~0 0)} is VALID [2018-11-23 13:04:51,791 INFO L273 TraceCheckUtils]: 6: Hoare triple {122#(= main_~i~0 0)} assume !(~i~0 < 1024); {121#false} is VALID [2018-11-23 13:04:51,791 INFO L273 TraceCheckUtils]: 7: Hoare triple {121#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {121#false} is VALID [2018-11-23 13:04:51,791 INFO L256 TraceCheckUtils]: 8: Hoare triple {121#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {121#false} is VALID [2018-11-23 13:04:51,792 INFO L273 TraceCheckUtils]: 9: Hoare triple {121#false} ~cond := #in~cond; {121#false} is VALID [2018-11-23 13:04:51,792 INFO L273 TraceCheckUtils]: 10: Hoare triple {121#false} assume 0 == ~cond; {121#false} is VALID [2018-11-23 13:04:51,792 INFO L273 TraceCheckUtils]: 11: Hoare triple {121#false} assume !false; {121#false} is VALID [2018-11-23 13:04:51,793 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 13:04:51,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:51,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:04:51,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-23 13:04:51,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:51,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:04:51,858 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:51,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:04:51,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:04:51,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:04:51,859 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 3 states. [2018-11-23 13:04:51,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:51,960 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:04:51,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:04:51,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-23 13:04:51,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:51,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:04:51,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-23 13:04:51,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:04:51,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-23 13:04:51,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 22 transitions. [2018-11-23 13:04:52,157 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 13:04:52,158 INFO L225 Difference]: With dead ends: 22 [2018-11-23 13:04:52,159 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:04:52,160 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 13:04:52,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:04:52,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-23 13:04:52,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:52,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 15 states. [2018-11-23 13:04:52,176 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 15 states. [2018-11-23 13:04:52,176 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 15 states. [2018-11-23 13:04:52,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:52,178 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:04:52,178 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:04:52,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:52,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:52,179 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states. [2018-11-23 13:04:52,179 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states. [2018-11-23 13:04:52,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:52,181 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:04:52,181 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:04:52,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:52,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:52,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:52,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:52,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:04:52,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 13:04:52,183 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-23 13:04:52,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:52,184 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 13:04:52,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:04:52,184 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 13:04:52,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:04:52,185 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:52,185 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:52,185 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:52,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:52,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1874839487, now seen corresponding path program 1 times [2018-11-23 13:04:52,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:52,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:52,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:52,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:52,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:52,299 INFO L256 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {212#true} is VALID [2018-11-23 13:04:52,299 INFO L273 TraceCheckUtils]: 1: Hoare triple {212#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {212#true} is VALID [2018-11-23 13:04:52,300 INFO L273 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID [2018-11-23 13:04:52,300 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #35#return; {212#true} is VALID [2018-11-23 13:04:52,300 INFO L256 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret2 := main(); {212#true} is VALID [2018-11-23 13:04:52,304 INFO L273 TraceCheckUtils]: 5: Hoare triple {212#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {214#(= main_~i~0 0)} is VALID [2018-11-23 13:04:52,305 INFO L273 TraceCheckUtils]: 6: Hoare triple {214#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {214#(= main_~i~0 0)} is VALID [2018-11-23 13:04:52,307 INFO L273 TraceCheckUtils]: 7: Hoare triple {214#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {215#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:52,312 INFO L273 TraceCheckUtils]: 8: Hoare triple {215#(<= main_~i~0 1)} assume !(~i~0 < 1024); {213#false} is VALID [2018-11-23 13:04:52,312 INFO L273 TraceCheckUtils]: 9: Hoare triple {213#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {213#false} is VALID [2018-11-23 13:04:52,312 INFO L256 TraceCheckUtils]: 10: Hoare triple {213#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {213#false} is VALID [2018-11-23 13:04:52,312 INFO L273 TraceCheckUtils]: 11: Hoare triple {213#false} ~cond := #in~cond; {213#false} is VALID [2018-11-23 13:04:52,313 INFO L273 TraceCheckUtils]: 12: Hoare triple {213#false} assume 0 == ~cond; {213#false} is VALID [2018-11-23 13:04:52,313 INFO L273 TraceCheckUtils]: 13: Hoare triple {213#false} assume !false; {213#false} is VALID [2018-11-23 13:04:52,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:52,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:52,315 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 13:04:52,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:52,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:52,456 INFO L256 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {212#true} is VALID [2018-11-23 13:04:52,456 INFO L273 TraceCheckUtils]: 1: Hoare triple {212#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {212#true} is VALID [2018-11-23 13:04:52,456 INFO L273 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID [2018-11-23 13:04:52,457 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #35#return; {212#true} is VALID [2018-11-23 13:04:52,457 INFO L256 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret2 := main(); {212#true} is VALID [2018-11-23 13:04:52,458 INFO L273 TraceCheckUtils]: 5: Hoare triple {212#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {234#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:52,459 INFO L273 TraceCheckUtils]: 6: Hoare triple {234#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {234#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:52,459 INFO L273 TraceCheckUtils]: 7: Hoare triple {234#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {215#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:52,462 INFO L273 TraceCheckUtils]: 8: Hoare triple {215#(<= main_~i~0 1)} assume !(~i~0 < 1024); {213#false} is VALID [2018-11-23 13:04:52,462 INFO L273 TraceCheckUtils]: 9: Hoare triple {213#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {213#false} is VALID [2018-11-23 13:04:52,463 INFO L256 TraceCheckUtils]: 10: Hoare triple {213#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {213#false} is VALID [2018-11-23 13:04:52,463 INFO L273 TraceCheckUtils]: 11: Hoare triple {213#false} ~cond := #in~cond; {213#false} is VALID [2018-11-23 13:04:52,464 INFO L273 TraceCheckUtils]: 12: Hoare triple {213#false} assume 0 == ~cond; {213#false} is VALID [2018-11-23 13:04:52,464 INFO L273 TraceCheckUtils]: 13: Hoare triple {213#false} assume !false; {213#false} is VALID [2018-11-23 13:04:52,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:52,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:52,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 13:04:52,487 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 13:04:52,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:52,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:04:52,562 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 13:04:52,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:04:52,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:04:52,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:04:52,563 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2018-11-23 13:04:52,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:52,948 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-23 13:04:52,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:04:52,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 13:04:52,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:52,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:04:52,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2018-11-23 13:04:52,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:04:52,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2018-11-23 13:04:52,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 24 transitions. [2018-11-23 13:04:53,077 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:53,078 INFO L225 Difference]: With dead ends: 24 [2018-11-23 13:04:53,078 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 13:04:53,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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 13:04:53,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 13:04:53,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-23 13:04:53,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:53,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 17 states. [2018-11-23 13:04:53,139 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 17 states. [2018-11-23 13:04:53,139 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 17 states. [2018-11-23 13:04:53,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:53,141 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:04:53,141 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:04:53,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:53,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:53,142 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states. [2018-11-23 13:04:53,142 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states. [2018-11-23 13:04:53,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:53,145 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:04:53,145 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:04:53,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:53,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:53,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:53,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:53,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:04:53,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-23 13:04:53,148 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-11-23 13:04:53,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:53,148 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-23 13:04:53,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:04:53,148 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 13:04:53,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:04:53,149 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:53,149 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:53,150 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:53,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:53,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1288728289, now seen corresponding path program 2 times [2018-11-23 13:04:53,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:53,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:53,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:53,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:53,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:53,264 INFO L256 TraceCheckUtils]: 0: Hoare triple {355#true} call ULTIMATE.init(); {355#true} is VALID [2018-11-23 13:04:53,265 INFO L273 TraceCheckUtils]: 1: Hoare triple {355#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {355#true} is VALID [2018-11-23 13:04:53,265 INFO L273 TraceCheckUtils]: 2: Hoare triple {355#true} assume true; {355#true} is VALID [2018-11-23 13:04:53,266 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {355#true} {355#true} #35#return; {355#true} is VALID [2018-11-23 13:04:53,266 INFO L256 TraceCheckUtils]: 4: Hoare triple {355#true} call #t~ret2 := main(); {355#true} is VALID [2018-11-23 13:04:53,267 INFO L273 TraceCheckUtils]: 5: Hoare triple {355#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {357#(= main_~i~0 0)} is VALID [2018-11-23 13:04:53,267 INFO L273 TraceCheckUtils]: 6: Hoare triple {357#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {357#(= main_~i~0 0)} is VALID [2018-11-23 13:04:53,273 INFO L273 TraceCheckUtils]: 7: Hoare triple {357#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {358#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:53,277 INFO L273 TraceCheckUtils]: 8: Hoare triple {358#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {358#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:53,277 INFO L273 TraceCheckUtils]: 9: Hoare triple {358#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {359#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:53,280 INFO L273 TraceCheckUtils]: 10: Hoare triple {359#(<= main_~i~0 2)} assume !(~i~0 < 1024); {356#false} is VALID [2018-11-23 13:04:53,280 INFO L273 TraceCheckUtils]: 11: Hoare triple {356#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {356#false} is VALID [2018-11-23 13:04:53,280 INFO L256 TraceCheckUtils]: 12: Hoare triple {356#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {356#false} is VALID [2018-11-23 13:04:53,281 INFO L273 TraceCheckUtils]: 13: Hoare triple {356#false} ~cond := #in~cond; {356#false} is VALID [2018-11-23 13:04:53,281 INFO L273 TraceCheckUtils]: 14: Hoare triple {356#false} assume 0 == ~cond; {356#false} is VALID [2018-11-23 13:04:53,281 INFO L273 TraceCheckUtils]: 15: Hoare triple {356#false} assume !false; {356#false} is VALID [2018-11-23 13:04:53,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:53,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:53,283 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 13:04:53,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:04:53,317 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:04:53,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:53,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:53,558 INFO L256 TraceCheckUtils]: 0: Hoare triple {355#true} call ULTIMATE.init(); {355#true} is VALID [2018-11-23 13:04:53,558 INFO L273 TraceCheckUtils]: 1: Hoare triple {355#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {355#true} is VALID [2018-11-23 13:04:53,559 INFO L273 TraceCheckUtils]: 2: Hoare triple {355#true} assume true; {355#true} is VALID [2018-11-23 13:04:53,559 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {355#true} {355#true} #35#return; {355#true} is VALID [2018-11-23 13:04:53,559 INFO L256 TraceCheckUtils]: 4: Hoare triple {355#true} call #t~ret2 := main(); {355#true} is VALID [2018-11-23 13:04:53,560 INFO L273 TraceCheckUtils]: 5: Hoare triple {355#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {378#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:53,561 INFO L273 TraceCheckUtils]: 6: Hoare triple {378#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {378#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:53,561 INFO L273 TraceCheckUtils]: 7: Hoare triple {378#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {358#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:53,563 INFO L273 TraceCheckUtils]: 8: Hoare triple {358#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {358#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:53,564 INFO L273 TraceCheckUtils]: 9: Hoare triple {358#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {359#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:53,565 INFO L273 TraceCheckUtils]: 10: Hoare triple {359#(<= main_~i~0 2)} assume !(~i~0 < 1024); {356#false} is VALID [2018-11-23 13:04:53,565 INFO L273 TraceCheckUtils]: 11: Hoare triple {356#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {356#false} is VALID [2018-11-23 13:04:53,565 INFO L256 TraceCheckUtils]: 12: Hoare triple {356#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {356#false} is VALID [2018-11-23 13:04:53,566 INFO L273 TraceCheckUtils]: 13: Hoare triple {356#false} ~cond := #in~cond; {356#false} is VALID [2018-11-23 13:04:53,566 INFO L273 TraceCheckUtils]: 14: Hoare triple {356#false} assume 0 == ~cond; {356#false} is VALID [2018-11-23 13:04:53,567 INFO L273 TraceCheckUtils]: 15: Hoare triple {356#false} assume !false; {356#false} is VALID [2018-11-23 13:04:53,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:53,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:53,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 13:04:53,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 13:04:53,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:53,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:04:53,651 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:53,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:04:53,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:04:53,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:04:53,652 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2018-11-23 13:04:53,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:53,855 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:04:53,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:04:53,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 13:04:53,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:53,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:04:53,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2018-11-23 13:04:53,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:04:53,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2018-11-23 13:04:53,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2018-11-23 13:04:53,929 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:53,930 INFO L225 Difference]: With dead ends: 26 [2018-11-23 13:04:53,931 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 13:04:53,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 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 13:04:53,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 13:04:53,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-23 13:04:53,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:53,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 19 states. [2018-11-23 13:04:53,946 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 19 states. [2018-11-23 13:04:53,946 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 19 states. [2018-11-23 13:04:53,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:53,948 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:04:53,948 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 13:04:53,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:53,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:53,949 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 20 states. [2018-11-23 13:04:53,949 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 20 states. [2018-11-23 13:04:53,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:53,951 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:04:53,951 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 13:04:53,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:53,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:53,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:53,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:53,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:04:53,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-23 13:04:53,954 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-11-23 13:04:53,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:53,956 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-23 13:04:53,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:04:53,956 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 13:04:53,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:04:53,957 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:53,957 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:53,957 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:53,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:53,966 INFO L82 PathProgramCache]: Analyzing trace with hash 676582787, now seen corresponding path program 3 times [2018-11-23 13:04:53,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:53,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:53,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:53,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:53,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:54,087 INFO L256 TraceCheckUtils]: 0: Hoare triple {515#true} call ULTIMATE.init(); {515#true} is VALID [2018-11-23 13:04:54,088 INFO L273 TraceCheckUtils]: 1: Hoare triple {515#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {515#true} is VALID [2018-11-23 13:04:54,089 INFO L273 TraceCheckUtils]: 2: Hoare triple {515#true} assume true; {515#true} is VALID [2018-11-23 13:04:54,089 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {515#true} {515#true} #35#return; {515#true} is VALID [2018-11-23 13:04:54,090 INFO L256 TraceCheckUtils]: 4: Hoare triple {515#true} call #t~ret2 := main(); {515#true} is VALID [2018-11-23 13:04:54,091 INFO L273 TraceCheckUtils]: 5: Hoare triple {515#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {517#(= main_~i~0 0)} is VALID [2018-11-23 13:04:54,092 INFO L273 TraceCheckUtils]: 6: Hoare triple {517#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {517#(= main_~i~0 0)} is VALID [2018-11-23 13:04:54,097 INFO L273 TraceCheckUtils]: 7: Hoare triple {517#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {518#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:54,097 INFO L273 TraceCheckUtils]: 8: Hoare triple {518#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {518#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:54,099 INFO L273 TraceCheckUtils]: 9: Hoare triple {518#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {519#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:54,099 INFO L273 TraceCheckUtils]: 10: Hoare triple {519#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {519#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:54,102 INFO L273 TraceCheckUtils]: 11: Hoare triple {519#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {520#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:54,103 INFO L273 TraceCheckUtils]: 12: Hoare triple {520#(<= main_~i~0 3)} assume !(~i~0 < 1024); {516#false} is VALID [2018-11-23 13:04:54,103 INFO L273 TraceCheckUtils]: 13: Hoare triple {516#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {516#false} is VALID [2018-11-23 13:04:54,103 INFO L256 TraceCheckUtils]: 14: Hoare triple {516#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {516#false} is VALID [2018-11-23 13:04:54,104 INFO L273 TraceCheckUtils]: 15: Hoare triple {516#false} ~cond := #in~cond; {516#false} is VALID [2018-11-23 13:04:54,104 INFO L273 TraceCheckUtils]: 16: Hoare triple {516#false} assume 0 == ~cond; {516#false} is VALID [2018-11-23 13:04:54,104 INFO L273 TraceCheckUtils]: 17: Hoare triple {516#false} assume !false; {516#false} is VALID [2018-11-23 13:04:54,105 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:54,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:54,105 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 13:04:54,115 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:04:54,147 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 13:04:54,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:54,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:54,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:54,258 INFO L256 TraceCheckUtils]: 0: Hoare triple {515#true} call ULTIMATE.init(); {515#true} is VALID [2018-11-23 13:04:54,258 INFO L273 TraceCheckUtils]: 1: Hoare triple {515#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {515#true} is VALID [2018-11-23 13:04:54,259 INFO L273 TraceCheckUtils]: 2: Hoare triple {515#true} assume true; {515#true} is VALID [2018-11-23 13:04:54,259 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {515#true} {515#true} #35#return; {515#true} is VALID [2018-11-23 13:04:54,259 INFO L256 TraceCheckUtils]: 4: Hoare triple {515#true} call #t~ret2 := main(); {515#true} is VALID [2018-11-23 13:04:54,265 INFO L273 TraceCheckUtils]: 5: Hoare triple {515#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {539#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:54,266 INFO L273 TraceCheckUtils]: 6: Hoare triple {539#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {539#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:54,267 INFO L273 TraceCheckUtils]: 7: Hoare triple {539#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {518#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:54,267 INFO L273 TraceCheckUtils]: 8: Hoare triple {518#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {518#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:54,270 INFO L273 TraceCheckUtils]: 9: Hoare triple {518#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {519#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:54,270 INFO L273 TraceCheckUtils]: 10: Hoare triple {519#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {519#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:54,272 INFO L273 TraceCheckUtils]: 11: Hoare triple {519#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {520#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:54,273 INFO L273 TraceCheckUtils]: 12: Hoare triple {520#(<= main_~i~0 3)} assume !(~i~0 < 1024); {516#false} is VALID [2018-11-23 13:04:54,273 INFO L273 TraceCheckUtils]: 13: Hoare triple {516#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {516#false} is VALID [2018-11-23 13:04:54,273 INFO L256 TraceCheckUtils]: 14: Hoare triple {516#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {516#false} is VALID [2018-11-23 13:04:54,274 INFO L273 TraceCheckUtils]: 15: Hoare triple {516#false} ~cond := #in~cond; {516#false} is VALID [2018-11-23 13:04:54,274 INFO L273 TraceCheckUtils]: 16: Hoare triple {516#false} assume 0 == ~cond; {516#false} is VALID [2018-11-23 13:04:54,274 INFO L273 TraceCheckUtils]: 17: Hoare triple {516#false} assume !false; {516#false} is VALID [2018-11-23 13:04:54,275 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:54,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:54,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 13:04:54,294 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-23 13:04:54,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:54,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:04:54,319 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:54,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:04:54,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:04:54,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:04:54,321 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 7 states. [2018-11-23 13:04:54,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:54,455 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-23 13:04:54,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:04:54,456 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-23 13:04:54,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:54,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:04:54,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2018-11-23 13:04:54,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:04:54,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2018-11-23 13:04:54,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2018-11-23 13:04:54,508 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 13:04:54,509 INFO L225 Difference]: With dead ends: 28 [2018-11-23 13:04:54,510 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 13:04:54,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 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 13:04:54,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 13:04:54,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-23 13:04:54,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:54,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2018-11-23 13:04:54,533 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2018-11-23 13:04:54,533 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2018-11-23 13:04:54,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:54,534 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:04:54,534 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-23 13:04:54,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:54,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:54,535 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2018-11-23 13:04:54,535 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2018-11-23 13:04:54,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:54,537 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:04:54,537 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-23 13:04:54,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:54,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:54,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:54,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:54,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:04:54,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-23 13:04:54,539 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-11-23 13:04:54,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:54,540 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-23 13:04:54,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:04:54,540 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 13:04:54,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:04:54,541 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:54,541 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:54,541 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:54,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:54,542 INFO L82 PathProgramCache]: Analyzing trace with hash 815274917, now seen corresponding path program 4 times [2018-11-23 13:04:54,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:54,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:54,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:54,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:54,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:54,674 INFO L256 TraceCheckUtils]: 0: Hoare triple {692#true} call ULTIMATE.init(); {692#true} is VALID [2018-11-23 13:04:54,674 INFO L273 TraceCheckUtils]: 1: Hoare triple {692#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {692#true} is VALID [2018-11-23 13:04:54,675 INFO L273 TraceCheckUtils]: 2: Hoare triple {692#true} assume true; {692#true} is VALID [2018-11-23 13:04:54,675 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {692#true} {692#true} #35#return; {692#true} is VALID [2018-11-23 13:04:54,676 INFO L256 TraceCheckUtils]: 4: Hoare triple {692#true} call #t~ret2 := main(); {692#true} is VALID [2018-11-23 13:04:54,690 INFO L273 TraceCheckUtils]: 5: Hoare triple {692#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {694#(= main_~i~0 0)} is VALID [2018-11-23 13:04:54,695 INFO L273 TraceCheckUtils]: 6: Hoare triple {694#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {694#(= main_~i~0 0)} is VALID [2018-11-23 13:04:54,696 INFO L273 TraceCheckUtils]: 7: Hoare triple {694#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {695#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:54,699 INFO L273 TraceCheckUtils]: 8: Hoare triple {695#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {695#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:54,700 INFO L273 TraceCheckUtils]: 9: Hoare triple {695#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {696#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:54,709 INFO L273 TraceCheckUtils]: 10: Hoare triple {696#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {696#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:54,710 INFO L273 TraceCheckUtils]: 11: Hoare triple {696#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {697#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:54,712 INFO L273 TraceCheckUtils]: 12: Hoare triple {697#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {697#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:54,713 INFO L273 TraceCheckUtils]: 13: Hoare triple {697#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {698#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:54,713 INFO L273 TraceCheckUtils]: 14: Hoare triple {698#(<= main_~i~0 4)} assume !(~i~0 < 1024); {693#false} is VALID [2018-11-23 13:04:54,714 INFO L273 TraceCheckUtils]: 15: Hoare triple {693#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {693#false} is VALID [2018-11-23 13:04:54,714 INFO L256 TraceCheckUtils]: 16: Hoare triple {693#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {693#false} is VALID [2018-11-23 13:04:54,714 INFO L273 TraceCheckUtils]: 17: Hoare triple {693#false} ~cond := #in~cond; {693#false} is VALID [2018-11-23 13:04:54,714 INFO L273 TraceCheckUtils]: 18: Hoare triple {693#false} assume 0 == ~cond; {693#false} is VALID [2018-11-23 13:04:54,715 INFO L273 TraceCheckUtils]: 19: Hoare triple {693#false} assume !false; {693#false} is VALID [2018-11-23 13:04:54,715 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:54,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:54,716 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 13:04:54,725 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:04:54,741 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:04:54,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:54,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:54,928 INFO L256 TraceCheckUtils]: 0: Hoare triple {692#true} call ULTIMATE.init(); {692#true} is VALID [2018-11-23 13:04:54,929 INFO L273 TraceCheckUtils]: 1: Hoare triple {692#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {692#true} is VALID [2018-11-23 13:04:54,929 INFO L273 TraceCheckUtils]: 2: Hoare triple {692#true} assume true; {692#true} is VALID [2018-11-23 13:04:54,929 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {692#true} {692#true} #35#return; {692#true} is VALID [2018-11-23 13:04:54,929 INFO L256 TraceCheckUtils]: 4: Hoare triple {692#true} call #t~ret2 := main(); {692#true} is VALID [2018-11-23 13:04:54,930 INFO L273 TraceCheckUtils]: 5: Hoare triple {692#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {717#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:54,931 INFO L273 TraceCheckUtils]: 6: Hoare triple {717#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {717#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:54,931 INFO L273 TraceCheckUtils]: 7: Hoare triple {717#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {695#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:54,932 INFO L273 TraceCheckUtils]: 8: Hoare triple {695#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {695#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:54,932 INFO L273 TraceCheckUtils]: 9: Hoare triple {695#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {696#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:54,933 INFO L273 TraceCheckUtils]: 10: Hoare triple {696#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {696#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:54,933 INFO L273 TraceCheckUtils]: 11: Hoare triple {696#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {697#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:54,934 INFO L273 TraceCheckUtils]: 12: Hoare triple {697#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {697#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:54,935 INFO L273 TraceCheckUtils]: 13: Hoare triple {697#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {698#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:54,936 INFO L273 TraceCheckUtils]: 14: Hoare triple {698#(<= main_~i~0 4)} assume !(~i~0 < 1024); {693#false} is VALID [2018-11-23 13:04:54,936 INFO L273 TraceCheckUtils]: 15: Hoare triple {693#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {693#false} is VALID [2018-11-23 13:04:54,937 INFO L256 TraceCheckUtils]: 16: Hoare triple {693#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {693#false} is VALID [2018-11-23 13:04:54,937 INFO L273 TraceCheckUtils]: 17: Hoare triple {693#false} ~cond := #in~cond; {693#false} is VALID [2018-11-23 13:04:54,937 INFO L273 TraceCheckUtils]: 18: Hoare triple {693#false} assume 0 == ~cond; {693#false} is VALID [2018-11-23 13:04:54,938 INFO L273 TraceCheckUtils]: 19: Hoare triple {693#false} assume !false; {693#false} is VALID [2018-11-23 13:04:54,939 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:54,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:54,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 13:04:54,959 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-23 13:04:54,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:54,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:04:54,990 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 13:04:54,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:04:54,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:04:54,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:04:54,991 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2018-11-23 13:04:55,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:55,102 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-23 13:04:55,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:04:55,103 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-23 13:04:55,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:55,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:04:55,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2018-11-23 13:04:55,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:04:55,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2018-11-23 13:04:55,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 30 transitions. [2018-11-23 13:04:55,153 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:55,154 INFO L225 Difference]: With dead ends: 30 [2018-11-23 13:04:55,155 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 13:04:55,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 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 13:04:55,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 13:04:55,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 13:04:55,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:55,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2018-11-23 13:04:55,175 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2018-11-23 13:04:55,176 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2018-11-23 13:04:55,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:55,177 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-23 13:04:55,178 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 13:04:55,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:55,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:55,178 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2018-11-23 13:04:55,179 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2018-11-23 13:04:55,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:55,180 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-23 13:04:55,180 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 13:04:55,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:55,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:55,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:55,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:55,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:04:55,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-23 13:04:55,183 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-11-23 13:04:55,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:55,183 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-23 13:04:55,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:04:55,184 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-23 13:04:55,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:04:55,185 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:55,185 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:55,185 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:55,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:55,185 INFO L82 PathProgramCache]: Analyzing trace with hash 954425671, now seen corresponding path program 5 times [2018-11-23 13:04:55,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:55,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:55,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:55,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:55,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:55,332 INFO L256 TraceCheckUtils]: 0: Hoare triple {886#true} call ULTIMATE.init(); {886#true} is VALID [2018-11-23 13:04:55,333 INFO L273 TraceCheckUtils]: 1: Hoare triple {886#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {886#true} is VALID [2018-11-23 13:04:55,333 INFO L273 TraceCheckUtils]: 2: Hoare triple {886#true} assume true; {886#true} is VALID [2018-11-23 13:04:55,333 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {886#true} {886#true} #35#return; {886#true} is VALID [2018-11-23 13:04:55,334 INFO L256 TraceCheckUtils]: 4: Hoare triple {886#true} call #t~ret2 := main(); {886#true} is VALID [2018-11-23 13:04:55,335 INFO L273 TraceCheckUtils]: 5: Hoare triple {886#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {888#(= main_~i~0 0)} is VALID [2018-11-23 13:04:55,335 INFO L273 TraceCheckUtils]: 6: Hoare triple {888#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {888#(= main_~i~0 0)} is VALID [2018-11-23 13:04:55,336 INFO L273 TraceCheckUtils]: 7: Hoare triple {888#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {889#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:55,336 INFO L273 TraceCheckUtils]: 8: Hoare triple {889#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {889#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:55,337 INFO L273 TraceCheckUtils]: 9: Hoare triple {889#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {890#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:55,338 INFO L273 TraceCheckUtils]: 10: Hoare triple {890#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {890#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:55,339 INFO L273 TraceCheckUtils]: 11: Hoare triple {890#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {891#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:55,339 INFO L273 TraceCheckUtils]: 12: Hoare triple {891#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {891#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:55,340 INFO L273 TraceCheckUtils]: 13: Hoare triple {891#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {892#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:55,341 INFO L273 TraceCheckUtils]: 14: Hoare triple {892#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {892#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:55,342 INFO L273 TraceCheckUtils]: 15: Hoare triple {892#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {893#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:55,343 INFO L273 TraceCheckUtils]: 16: Hoare triple {893#(<= main_~i~0 5)} assume !(~i~0 < 1024); {887#false} is VALID [2018-11-23 13:04:55,343 INFO L273 TraceCheckUtils]: 17: Hoare triple {887#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {887#false} is VALID [2018-11-23 13:04:55,344 INFO L256 TraceCheckUtils]: 18: Hoare triple {887#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {887#false} is VALID [2018-11-23 13:04:55,344 INFO L273 TraceCheckUtils]: 19: Hoare triple {887#false} ~cond := #in~cond; {887#false} is VALID [2018-11-23 13:04:55,344 INFO L273 TraceCheckUtils]: 20: Hoare triple {887#false} assume 0 == ~cond; {887#false} is VALID [2018-11-23 13:04:55,345 INFO L273 TraceCheckUtils]: 21: Hoare triple {887#false} assume !false; {887#false} is VALID [2018-11-23 13:04:55,347 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:55,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:55,347 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 13:04:55,357 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:04:55,417 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 13:04:55,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:55,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:55,651 INFO L256 TraceCheckUtils]: 0: Hoare triple {886#true} call ULTIMATE.init(); {886#true} is VALID [2018-11-23 13:04:55,651 INFO L273 TraceCheckUtils]: 1: Hoare triple {886#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {886#true} is VALID [2018-11-23 13:04:55,652 INFO L273 TraceCheckUtils]: 2: Hoare triple {886#true} assume true; {886#true} is VALID [2018-11-23 13:04:55,652 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {886#true} {886#true} #35#return; {886#true} is VALID [2018-11-23 13:04:55,652 INFO L256 TraceCheckUtils]: 4: Hoare triple {886#true} call #t~ret2 := main(); {886#true} is VALID [2018-11-23 13:04:55,654 INFO L273 TraceCheckUtils]: 5: Hoare triple {886#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {912#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:55,654 INFO L273 TraceCheckUtils]: 6: Hoare triple {912#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {912#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:55,656 INFO L273 TraceCheckUtils]: 7: Hoare triple {912#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {889#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:55,659 INFO L273 TraceCheckUtils]: 8: Hoare triple {889#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {889#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:55,659 INFO L273 TraceCheckUtils]: 9: Hoare triple {889#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {890#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:55,660 INFO L273 TraceCheckUtils]: 10: Hoare triple {890#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {890#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:55,662 INFO L273 TraceCheckUtils]: 11: Hoare triple {890#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {891#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:55,667 INFO L273 TraceCheckUtils]: 12: Hoare triple {891#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {891#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:55,668 INFO L273 TraceCheckUtils]: 13: Hoare triple {891#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {892#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:55,668 INFO L273 TraceCheckUtils]: 14: Hoare triple {892#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {892#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:55,670 INFO L273 TraceCheckUtils]: 15: Hoare triple {892#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {893#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:55,670 INFO L273 TraceCheckUtils]: 16: Hoare triple {893#(<= main_~i~0 5)} assume !(~i~0 < 1024); {887#false} is VALID [2018-11-23 13:04:55,670 INFO L273 TraceCheckUtils]: 17: Hoare triple {887#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {887#false} is VALID [2018-11-23 13:04:55,671 INFO L256 TraceCheckUtils]: 18: Hoare triple {887#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {887#false} is VALID [2018-11-23 13:04:55,671 INFO L273 TraceCheckUtils]: 19: Hoare triple {887#false} ~cond := #in~cond; {887#false} is VALID [2018-11-23 13:04:55,672 INFO L273 TraceCheckUtils]: 20: Hoare triple {887#false} assume 0 == ~cond; {887#false} is VALID [2018-11-23 13:04:55,672 INFO L273 TraceCheckUtils]: 21: Hoare triple {887#false} assume !false; {887#false} is VALID [2018-11-23 13:04:55,674 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:55,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:55,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 13:04:55,699 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 13:04:55,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:55,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:04:55,746 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 13:04:55,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:04:55,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:04:55,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:04:55,747 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2018-11-23 13:04:55,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:55,908 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:04:55,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:04:55,909 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 13:04:55,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:55,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:04:55,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2018-11-23 13:04:55,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:04:55,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2018-11-23 13:04:55,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 32 transitions. [2018-11-23 13:04:55,986 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 13:04:55,987 INFO L225 Difference]: With dead ends: 32 [2018-11-23 13:04:55,987 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 13:04:55,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 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 13:04:55,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 13:04:56,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-23 13:04:56,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:56,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2018-11-23 13:04:56,009 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2018-11-23 13:04:56,009 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2018-11-23 13:04:56,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:56,011 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:04:56,011 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 13:04:56,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:56,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:56,011 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2018-11-23 13:04:56,011 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2018-11-23 13:04:56,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:56,013 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:04:56,013 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 13:04:56,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:56,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:56,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:56,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:56,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:04:56,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-11-23 13:04:56,016 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-11-23 13:04:56,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:56,016 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-11-23 13:04:56,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:04:56,016 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-23 13:04:56,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:04:56,017 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:56,017 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:56,017 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:56,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:56,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1534314089, now seen corresponding path program 6 times [2018-11-23 13:04:56,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:56,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:56,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:56,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:56,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:56,176 INFO L256 TraceCheckUtils]: 0: Hoare triple {1097#true} call ULTIMATE.init(); {1097#true} is VALID [2018-11-23 13:04:56,176 INFO L273 TraceCheckUtils]: 1: Hoare triple {1097#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1097#true} is VALID [2018-11-23 13:04:56,177 INFO L273 TraceCheckUtils]: 2: Hoare triple {1097#true} assume true; {1097#true} is VALID [2018-11-23 13:04:56,177 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1097#true} {1097#true} #35#return; {1097#true} is VALID [2018-11-23 13:04:56,177 INFO L256 TraceCheckUtils]: 4: Hoare triple {1097#true} call #t~ret2 := main(); {1097#true} is VALID [2018-11-23 13:04:56,179 INFO L273 TraceCheckUtils]: 5: Hoare triple {1097#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {1099#(= main_~i~0 0)} is VALID [2018-11-23 13:04:56,180 INFO L273 TraceCheckUtils]: 6: Hoare triple {1099#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1099#(= main_~i~0 0)} is VALID [2018-11-23 13:04:56,181 INFO L273 TraceCheckUtils]: 7: Hoare triple {1099#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1100#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:56,181 INFO L273 TraceCheckUtils]: 8: Hoare triple {1100#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1100#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:56,182 INFO L273 TraceCheckUtils]: 9: Hoare triple {1100#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1101#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:56,184 INFO L273 TraceCheckUtils]: 10: Hoare triple {1101#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1101#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:56,185 INFO L273 TraceCheckUtils]: 11: Hoare triple {1101#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1102#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:56,185 INFO L273 TraceCheckUtils]: 12: Hoare triple {1102#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1102#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:56,186 INFO L273 TraceCheckUtils]: 13: Hoare triple {1102#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1103#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:56,187 INFO L273 TraceCheckUtils]: 14: Hoare triple {1103#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1103#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:56,188 INFO L273 TraceCheckUtils]: 15: Hoare triple {1103#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1104#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:56,189 INFO L273 TraceCheckUtils]: 16: Hoare triple {1104#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1104#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:56,190 INFO L273 TraceCheckUtils]: 17: Hoare triple {1104#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1105#(<= main_~i~0 6)} is VALID [2018-11-23 13:04:56,191 INFO L273 TraceCheckUtils]: 18: Hoare triple {1105#(<= main_~i~0 6)} assume !(~i~0 < 1024); {1098#false} is VALID [2018-11-23 13:04:56,192 INFO L273 TraceCheckUtils]: 19: Hoare triple {1098#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1098#false} is VALID [2018-11-23 13:04:56,192 INFO L256 TraceCheckUtils]: 20: Hoare triple {1098#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {1098#false} is VALID [2018-11-23 13:04:56,193 INFO L273 TraceCheckUtils]: 21: Hoare triple {1098#false} ~cond := #in~cond; {1098#false} is VALID [2018-11-23 13:04:56,193 INFO L273 TraceCheckUtils]: 22: Hoare triple {1098#false} assume 0 == ~cond; {1098#false} is VALID [2018-11-23 13:04:56,194 INFO L273 TraceCheckUtils]: 23: Hoare triple {1098#false} assume !false; {1098#false} is VALID [2018-11-23 13:04:56,196 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:56,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:56,196 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 13:04:56,208 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:04:56,239 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 13:04:56,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:56,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:56,418 INFO L256 TraceCheckUtils]: 0: Hoare triple {1097#true} call ULTIMATE.init(); {1097#true} is VALID [2018-11-23 13:04:56,418 INFO L273 TraceCheckUtils]: 1: Hoare triple {1097#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1097#true} is VALID [2018-11-23 13:04:56,418 INFO L273 TraceCheckUtils]: 2: Hoare triple {1097#true} assume true; {1097#true} is VALID [2018-11-23 13:04:56,419 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1097#true} {1097#true} #35#return; {1097#true} is VALID [2018-11-23 13:04:56,419 INFO L256 TraceCheckUtils]: 4: Hoare triple {1097#true} call #t~ret2 := main(); {1097#true} is VALID [2018-11-23 13:04:56,420 INFO L273 TraceCheckUtils]: 5: Hoare triple {1097#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {1124#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:56,420 INFO L273 TraceCheckUtils]: 6: Hoare triple {1124#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1124#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:56,421 INFO L273 TraceCheckUtils]: 7: Hoare triple {1124#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1100#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:56,421 INFO L273 TraceCheckUtils]: 8: Hoare triple {1100#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1100#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:56,422 INFO L273 TraceCheckUtils]: 9: Hoare triple {1100#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1101#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:56,422 INFO L273 TraceCheckUtils]: 10: Hoare triple {1101#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1101#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:56,423 INFO L273 TraceCheckUtils]: 11: Hoare triple {1101#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1102#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:56,424 INFO L273 TraceCheckUtils]: 12: Hoare triple {1102#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1102#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:56,425 INFO L273 TraceCheckUtils]: 13: Hoare triple {1102#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1103#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:56,425 INFO L273 TraceCheckUtils]: 14: Hoare triple {1103#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1103#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:56,426 INFO L273 TraceCheckUtils]: 15: Hoare triple {1103#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1104#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:56,427 INFO L273 TraceCheckUtils]: 16: Hoare triple {1104#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1104#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:56,428 INFO L273 TraceCheckUtils]: 17: Hoare triple {1104#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1105#(<= main_~i~0 6)} is VALID [2018-11-23 13:04:56,429 INFO L273 TraceCheckUtils]: 18: Hoare triple {1105#(<= main_~i~0 6)} assume !(~i~0 < 1024); {1098#false} is VALID [2018-11-23 13:04:56,429 INFO L273 TraceCheckUtils]: 19: Hoare triple {1098#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1098#false} is VALID [2018-11-23 13:04:56,430 INFO L256 TraceCheckUtils]: 20: Hoare triple {1098#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {1098#false} is VALID [2018-11-23 13:04:56,430 INFO L273 TraceCheckUtils]: 21: Hoare triple {1098#false} ~cond := #in~cond; {1098#false} is VALID [2018-11-23 13:04:56,430 INFO L273 TraceCheckUtils]: 22: Hoare triple {1098#false} assume 0 == ~cond; {1098#false} is VALID [2018-11-23 13:04:56,431 INFO L273 TraceCheckUtils]: 23: Hoare triple {1098#false} assume !false; {1098#false} is VALID [2018-11-23 13:04:56,433 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:56,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:56,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 13:04:56,454 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-23 13:04:56,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:56,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:04:56,484 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 13:04:56,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:04:56,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:04:56,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:04:56,485 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 10 states. [2018-11-23 13:04:56,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:56,590 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 13:04:56,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:04:56,591 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-23 13:04:56,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:56,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:04:56,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2018-11-23 13:04:56,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:04:56,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2018-11-23 13:04:56,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 34 transitions. [2018-11-23 13:04:56,644 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 13:04:56,645 INFO L225 Difference]: With dead ends: 34 [2018-11-23 13:04:56,646 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:04:56,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:04:56,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:04:56,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 13:04:56,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:56,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-23 13:04:56,777 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-23 13:04:56,777 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-23 13:04:56,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:56,779 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-23 13:04:56,779 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:04:56,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:56,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:56,780 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-23 13:04:56,780 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-23 13:04:56,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:56,782 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-23 13:04:56,782 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:04:56,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:56,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:56,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:56,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:56,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:04:56,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-23 13:04:56,785 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-11-23 13:04:56,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:56,785 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-23 13:04:56,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:04:56,785 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 13:04:56,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 13:04:56,786 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:56,786 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:56,786 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:56,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:56,787 INFO L82 PathProgramCache]: Analyzing trace with hash 461335307, now seen corresponding path program 7 times [2018-11-23 13:04:56,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:56,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:56,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:56,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:56,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:57,019 INFO L256 TraceCheckUtils]: 0: Hoare triple {1325#true} call ULTIMATE.init(); {1325#true} is VALID [2018-11-23 13:04:57,020 INFO L273 TraceCheckUtils]: 1: Hoare triple {1325#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1325#true} is VALID [2018-11-23 13:04:57,021 INFO L273 TraceCheckUtils]: 2: Hoare triple {1325#true} assume true; {1325#true} is VALID [2018-11-23 13:04:57,021 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1325#true} {1325#true} #35#return; {1325#true} is VALID [2018-11-23 13:04:57,022 INFO L256 TraceCheckUtils]: 4: Hoare triple {1325#true} call #t~ret2 := main(); {1325#true} is VALID [2018-11-23 13:04:57,022 INFO L273 TraceCheckUtils]: 5: Hoare triple {1325#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {1327#(= main_~i~0 0)} is VALID [2018-11-23 13:04:57,023 INFO L273 TraceCheckUtils]: 6: Hoare triple {1327#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1327#(= main_~i~0 0)} is VALID [2018-11-23 13:04:57,023 INFO L273 TraceCheckUtils]: 7: Hoare triple {1327#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1328#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:57,024 INFO L273 TraceCheckUtils]: 8: Hoare triple {1328#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1328#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:57,024 INFO L273 TraceCheckUtils]: 9: Hoare triple {1328#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1329#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:57,025 INFO L273 TraceCheckUtils]: 10: Hoare triple {1329#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1329#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:57,025 INFO L273 TraceCheckUtils]: 11: Hoare triple {1329#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1330#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:57,026 INFO L273 TraceCheckUtils]: 12: Hoare triple {1330#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1330#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:57,026 INFO L273 TraceCheckUtils]: 13: Hoare triple {1330#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1331#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:57,027 INFO L273 TraceCheckUtils]: 14: Hoare triple {1331#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1331#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:57,028 INFO L273 TraceCheckUtils]: 15: Hoare triple {1331#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1332#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:57,029 INFO L273 TraceCheckUtils]: 16: Hoare triple {1332#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1332#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:57,030 INFO L273 TraceCheckUtils]: 17: Hoare triple {1332#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1333#(<= main_~i~0 6)} is VALID [2018-11-23 13:04:57,031 INFO L273 TraceCheckUtils]: 18: Hoare triple {1333#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1333#(<= main_~i~0 6)} is VALID [2018-11-23 13:04:57,031 INFO L273 TraceCheckUtils]: 19: Hoare triple {1333#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1334#(<= main_~i~0 7)} is VALID [2018-11-23 13:04:57,032 INFO L273 TraceCheckUtils]: 20: Hoare triple {1334#(<= main_~i~0 7)} assume !(~i~0 < 1024); {1326#false} is VALID [2018-11-23 13:04:57,033 INFO L273 TraceCheckUtils]: 21: Hoare triple {1326#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1326#false} is VALID [2018-11-23 13:04:57,033 INFO L256 TraceCheckUtils]: 22: Hoare triple {1326#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {1326#false} is VALID [2018-11-23 13:04:57,033 INFO L273 TraceCheckUtils]: 23: Hoare triple {1326#false} ~cond := #in~cond; {1326#false} is VALID [2018-11-23 13:04:57,034 INFO L273 TraceCheckUtils]: 24: Hoare triple {1326#false} assume 0 == ~cond; {1326#false} is VALID [2018-11-23 13:04:57,034 INFO L273 TraceCheckUtils]: 25: Hoare triple {1326#false} assume !false; {1326#false} is VALID [2018-11-23 13:04:57,036 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:57,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:57,036 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 13:04:57,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:57,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:57,302 INFO L256 TraceCheckUtils]: 0: Hoare triple {1325#true} call ULTIMATE.init(); {1325#true} is VALID [2018-11-23 13:04:57,302 INFO L273 TraceCheckUtils]: 1: Hoare triple {1325#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1325#true} is VALID [2018-11-23 13:04:57,302 INFO L273 TraceCheckUtils]: 2: Hoare triple {1325#true} assume true; {1325#true} is VALID [2018-11-23 13:04:57,302 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1325#true} {1325#true} #35#return; {1325#true} is VALID [2018-11-23 13:04:57,303 INFO L256 TraceCheckUtils]: 4: Hoare triple {1325#true} call #t~ret2 := main(); {1325#true} is VALID [2018-11-23 13:04:57,306 INFO L273 TraceCheckUtils]: 5: Hoare triple {1325#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {1353#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:57,306 INFO L273 TraceCheckUtils]: 6: Hoare triple {1353#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1353#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:57,307 INFO L273 TraceCheckUtils]: 7: Hoare triple {1353#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1328#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:57,307 INFO L273 TraceCheckUtils]: 8: Hoare triple {1328#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1328#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:57,308 INFO L273 TraceCheckUtils]: 9: Hoare triple {1328#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1329#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:57,309 INFO L273 TraceCheckUtils]: 10: Hoare triple {1329#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1329#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:57,312 INFO L273 TraceCheckUtils]: 11: Hoare triple {1329#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1330#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:57,312 INFO L273 TraceCheckUtils]: 12: Hoare triple {1330#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1330#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:57,313 INFO L273 TraceCheckUtils]: 13: Hoare triple {1330#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1331#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:57,314 INFO L273 TraceCheckUtils]: 14: Hoare triple {1331#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1331#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:57,314 INFO L273 TraceCheckUtils]: 15: Hoare triple {1331#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1332#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:57,315 INFO L273 TraceCheckUtils]: 16: Hoare triple {1332#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1332#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:57,315 INFO L273 TraceCheckUtils]: 17: Hoare triple {1332#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1333#(<= main_~i~0 6)} is VALID [2018-11-23 13:04:57,316 INFO L273 TraceCheckUtils]: 18: Hoare triple {1333#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1333#(<= main_~i~0 6)} is VALID [2018-11-23 13:04:57,317 INFO L273 TraceCheckUtils]: 19: Hoare triple {1333#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1334#(<= main_~i~0 7)} is VALID [2018-11-23 13:04:57,318 INFO L273 TraceCheckUtils]: 20: Hoare triple {1334#(<= main_~i~0 7)} assume !(~i~0 < 1024); {1326#false} is VALID [2018-11-23 13:04:57,318 INFO L273 TraceCheckUtils]: 21: Hoare triple {1326#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1326#false} is VALID [2018-11-23 13:04:57,319 INFO L256 TraceCheckUtils]: 22: Hoare triple {1326#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {1326#false} is VALID [2018-11-23 13:04:57,319 INFO L273 TraceCheckUtils]: 23: Hoare triple {1326#false} ~cond := #in~cond; {1326#false} is VALID [2018-11-23 13:04:57,319 INFO L273 TraceCheckUtils]: 24: Hoare triple {1326#false} assume 0 == ~cond; {1326#false} is VALID [2018-11-23 13:04:57,320 INFO L273 TraceCheckUtils]: 25: Hoare triple {1326#false} assume !false; {1326#false} is VALID [2018-11-23 13:04:57,321 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:57,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:57,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 13:04:57,349 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-11-23 13:04:57,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:57,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:04:57,414 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 13:04:57,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:04:57,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:04:57,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:04:57,416 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 11 states. [2018-11-23 13:04:57,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:57,568 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-23 13:04:57,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:04:57,569 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-11-23 13:04:57,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:57,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:04:57,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 36 transitions. [2018-11-23 13:04:57,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:04:57,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 36 transitions. [2018-11-23 13:04:57,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 36 transitions. [2018-11-23 13:04:57,617 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 13:04:57,618 INFO L225 Difference]: With dead ends: 36 [2018-11-23 13:04:57,618 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 13:04:57,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 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 13:04:57,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 13:04:57,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 13:04:57,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:57,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 13:04:57,659 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 13:04:57,659 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 13:04:57,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:57,660 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-23 13:04:57,661 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 13:04:57,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:57,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:57,661 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 13:04:57,662 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 13:04:57,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:57,663 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-23 13:04:57,663 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 13:04:57,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:57,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:57,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:57,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:57,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:04:57,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-23 13:04:57,666 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-11-23 13:04:57,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:57,666 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-23 13:04:57,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:04:57,666 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-23 13:04:57,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:04:57,667 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:57,667 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:57,668 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:57,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:57,668 INFO L82 PathProgramCache]: Analyzing trace with hash 120876845, now seen corresponding path program 8 times [2018-11-23 13:04:57,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:57,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:57,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:57,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:57,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:57,974 INFO L256 TraceCheckUtils]: 0: Hoare triple {1570#true} call ULTIMATE.init(); {1570#true} is VALID [2018-11-23 13:04:57,975 INFO L273 TraceCheckUtils]: 1: Hoare triple {1570#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1570#true} is VALID [2018-11-23 13:04:57,975 INFO L273 TraceCheckUtils]: 2: Hoare triple {1570#true} assume true; {1570#true} is VALID [2018-11-23 13:04:57,975 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1570#true} {1570#true} #35#return; {1570#true} is VALID [2018-11-23 13:04:57,976 INFO L256 TraceCheckUtils]: 4: Hoare triple {1570#true} call #t~ret2 := main(); {1570#true} is VALID [2018-11-23 13:04:57,977 INFO L273 TraceCheckUtils]: 5: Hoare triple {1570#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {1572#(= main_~i~0 0)} is VALID [2018-11-23 13:04:57,978 INFO L273 TraceCheckUtils]: 6: Hoare triple {1572#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1572#(= main_~i~0 0)} is VALID [2018-11-23 13:04:57,978 INFO L273 TraceCheckUtils]: 7: Hoare triple {1572#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1573#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:57,979 INFO L273 TraceCheckUtils]: 8: Hoare triple {1573#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1573#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:57,979 INFO L273 TraceCheckUtils]: 9: Hoare triple {1573#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1574#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:57,980 INFO L273 TraceCheckUtils]: 10: Hoare triple {1574#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1574#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:57,981 INFO L273 TraceCheckUtils]: 11: Hoare triple {1574#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1575#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:57,981 INFO L273 TraceCheckUtils]: 12: Hoare triple {1575#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1575#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:57,982 INFO L273 TraceCheckUtils]: 13: Hoare triple {1575#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1576#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:57,982 INFO L273 TraceCheckUtils]: 14: Hoare triple {1576#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1576#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:58,000 INFO L273 TraceCheckUtils]: 15: Hoare triple {1576#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1577#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:58,008 INFO L273 TraceCheckUtils]: 16: Hoare triple {1577#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1577#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:58,008 INFO L273 TraceCheckUtils]: 17: Hoare triple {1577#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1578#(<= main_~i~0 6)} is VALID [2018-11-23 13:04:58,009 INFO L273 TraceCheckUtils]: 18: Hoare triple {1578#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1578#(<= main_~i~0 6)} is VALID [2018-11-23 13:04:58,011 INFO L273 TraceCheckUtils]: 19: Hoare triple {1578#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1579#(<= main_~i~0 7)} is VALID [2018-11-23 13:04:58,011 INFO L273 TraceCheckUtils]: 20: Hoare triple {1579#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1579#(<= main_~i~0 7)} is VALID [2018-11-23 13:04:58,012 INFO L273 TraceCheckUtils]: 21: Hoare triple {1579#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1580#(<= main_~i~0 8)} is VALID [2018-11-23 13:04:58,012 INFO L273 TraceCheckUtils]: 22: Hoare triple {1580#(<= main_~i~0 8)} assume !(~i~0 < 1024); {1571#false} is VALID [2018-11-23 13:04:58,013 INFO L273 TraceCheckUtils]: 23: Hoare triple {1571#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1571#false} is VALID [2018-11-23 13:04:58,013 INFO L256 TraceCheckUtils]: 24: Hoare triple {1571#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {1571#false} is VALID [2018-11-23 13:04:58,013 INFO L273 TraceCheckUtils]: 25: Hoare triple {1571#false} ~cond := #in~cond; {1571#false} is VALID [2018-11-23 13:04:58,014 INFO L273 TraceCheckUtils]: 26: Hoare triple {1571#false} assume 0 == ~cond; {1571#false} is VALID [2018-11-23 13:04:58,014 INFO L273 TraceCheckUtils]: 27: Hoare triple {1571#false} assume !false; {1571#false} is VALID [2018-11-23 13:04:58,016 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:58,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:58,017 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 13:04:58,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:04:58,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:04:58,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:58,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:58,496 INFO L256 TraceCheckUtils]: 0: Hoare triple {1570#true} call ULTIMATE.init(); {1570#true} is VALID [2018-11-23 13:04:58,497 INFO L273 TraceCheckUtils]: 1: Hoare triple {1570#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1570#true} is VALID [2018-11-23 13:04:58,497 INFO L273 TraceCheckUtils]: 2: Hoare triple {1570#true} assume true; {1570#true} is VALID [2018-11-23 13:04:58,497 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1570#true} {1570#true} #35#return; {1570#true} is VALID [2018-11-23 13:04:58,497 INFO L256 TraceCheckUtils]: 4: Hoare triple {1570#true} call #t~ret2 := main(); {1570#true} is VALID [2018-11-23 13:04:58,498 INFO L273 TraceCheckUtils]: 5: Hoare triple {1570#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {1599#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:58,499 INFO L273 TraceCheckUtils]: 6: Hoare triple {1599#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1599#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:58,500 INFO L273 TraceCheckUtils]: 7: Hoare triple {1599#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1573#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:58,500 INFO L273 TraceCheckUtils]: 8: Hoare triple {1573#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1573#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:58,506 INFO L273 TraceCheckUtils]: 9: Hoare triple {1573#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1574#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:58,507 INFO L273 TraceCheckUtils]: 10: Hoare triple {1574#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1574#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:58,507 INFO L273 TraceCheckUtils]: 11: Hoare triple {1574#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1575#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:58,508 INFO L273 TraceCheckUtils]: 12: Hoare triple {1575#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1575#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:58,508 INFO L273 TraceCheckUtils]: 13: Hoare triple {1575#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1576#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:58,509 INFO L273 TraceCheckUtils]: 14: Hoare triple {1576#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1576#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:58,509 INFO L273 TraceCheckUtils]: 15: Hoare triple {1576#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1577#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:58,510 INFO L273 TraceCheckUtils]: 16: Hoare triple {1577#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1577#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:58,510 INFO L273 TraceCheckUtils]: 17: Hoare triple {1577#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1578#(<= main_~i~0 6)} is VALID [2018-11-23 13:04:58,511 INFO L273 TraceCheckUtils]: 18: Hoare triple {1578#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1578#(<= main_~i~0 6)} is VALID [2018-11-23 13:04:58,512 INFO L273 TraceCheckUtils]: 19: Hoare triple {1578#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1579#(<= main_~i~0 7)} is VALID [2018-11-23 13:04:58,513 INFO L273 TraceCheckUtils]: 20: Hoare triple {1579#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1579#(<= main_~i~0 7)} is VALID [2018-11-23 13:04:58,514 INFO L273 TraceCheckUtils]: 21: Hoare triple {1579#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1580#(<= main_~i~0 8)} is VALID [2018-11-23 13:04:58,515 INFO L273 TraceCheckUtils]: 22: Hoare triple {1580#(<= main_~i~0 8)} assume !(~i~0 < 1024); {1571#false} is VALID [2018-11-23 13:04:58,515 INFO L273 TraceCheckUtils]: 23: Hoare triple {1571#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1571#false} is VALID [2018-11-23 13:04:58,515 INFO L256 TraceCheckUtils]: 24: Hoare triple {1571#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {1571#false} is VALID [2018-11-23 13:04:58,515 INFO L273 TraceCheckUtils]: 25: Hoare triple {1571#false} ~cond := #in~cond; {1571#false} is VALID [2018-11-23 13:04:58,516 INFO L273 TraceCheckUtils]: 26: Hoare triple {1571#false} assume 0 == ~cond; {1571#false} is VALID [2018-11-23 13:04:58,516 INFO L273 TraceCheckUtils]: 27: Hoare triple {1571#false} assume !false; {1571#false} is VALID [2018-11-23 13:04:58,518 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:58,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:58,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 13:04:58,539 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-11-23 13:04:58,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:58,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 13:04:58,573 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 13:04:58,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:04:58,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:04:58,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:04:58,574 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 12 states. [2018-11-23 13:04:58,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:58,910 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-23 13:04:58,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:04:58,910 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-11-23 13:04:58,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:58,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:04:58,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2018-11-23 13:04:58,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:04:58,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2018-11-23 13:04:58,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 38 transitions. [2018-11-23 13:04:59,052 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 13:04:59,053 INFO L225 Difference]: With dead ends: 38 [2018-11-23 13:04:59,053 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 13:04:59,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:04:59,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 13:04:59,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 13:04:59,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:59,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-23 13:04:59,066 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-23 13:04:59,066 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-23 13:04:59,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:59,068 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:04:59,068 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 13:04:59,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:59,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:59,069 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-23 13:04:59,069 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-23 13:04:59,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:59,070 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:04:59,070 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 13:04:59,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:59,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:59,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:59,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:59,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:04:59,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-11-23 13:04:59,072 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-11-23 13:04:59,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:59,072 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-11-23 13:04:59,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:04:59,073 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-23 13:04:59,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 13:04:59,073 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:59,073 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:59,074 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:59,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:59,074 INFO L82 PathProgramCache]: Analyzing trace with hash -642190641, now seen corresponding path program 9 times [2018-11-23 13:04:59,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:59,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:59,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:59,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:59,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:59,340 INFO L256 TraceCheckUtils]: 0: Hoare triple {1832#true} call ULTIMATE.init(); {1832#true} is VALID [2018-11-23 13:04:59,340 INFO L273 TraceCheckUtils]: 1: Hoare triple {1832#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1832#true} is VALID [2018-11-23 13:04:59,341 INFO L273 TraceCheckUtils]: 2: Hoare triple {1832#true} assume true; {1832#true} is VALID [2018-11-23 13:04:59,341 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1832#true} {1832#true} #35#return; {1832#true} is VALID [2018-11-23 13:04:59,341 INFO L256 TraceCheckUtils]: 4: Hoare triple {1832#true} call #t~ret2 := main(); {1832#true} is VALID [2018-11-23 13:04:59,342 INFO L273 TraceCheckUtils]: 5: Hoare triple {1832#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {1834#(= main_~i~0 0)} is VALID [2018-11-23 13:04:59,343 INFO L273 TraceCheckUtils]: 6: Hoare triple {1834#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1834#(= main_~i~0 0)} is VALID [2018-11-23 13:04:59,343 INFO L273 TraceCheckUtils]: 7: Hoare triple {1834#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1835#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:59,344 INFO L273 TraceCheckUtils]: 8: Hoare triple {1835#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1835#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:59,345 INFO L273 TraceCheckUtils]: 9: Hoare triple {1835#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1836#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:59,345 INFO L273 TraceCheckUtils]: 10: Hoare triple {1836#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1836#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:59,346 INFO L273 TraceCheckUtils]: 11: Hoare triple {1836#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1837#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:59,347 INFO L273 TraceCheckUtils]: 12: Hoare triple {1837#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1837#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:59,348 INFO L273 TraceCheckUtils]: 13: Hoare triple {1837#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1838#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:59,348 INFO L273 TraceCheckUtils]: 14: Hoare triple {1838#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1838#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:59,349 INFO L273 TraceCheckUtils]: 15: Hoare triple {1838#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1839#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:59,350 INFO L273 TraceCheckUtils]: 16: Hoare triple {1839#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1839#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:59,350 INFO L273 TraceCheckUtils]: 17: Hoare triple {1839#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1840#(<= main_~i~0 6)} is VALID [2018-11-23 13:04:59,351 INFO L273 TraceCheckUtils]: 18: Hoare triple {1840#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1840#(<= main_~i~0 6)} is VALID [2018-11-23 13:04:59,352 INFO L273 TraceCheckUtils]: 19: Hoare triple {1840#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1841#(<= main_~i~0 7)} is VALID [2018-11-23 13:04:59,354 INFO L273 TraceCheckUtils]: 20: Hoare triple {1841#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1841#(<= main_~i~0 7)} is VALID [2018-11-23 13:04:59,356 INFO L273 TraceCheckUtils]: 21: Hoare triple {1841#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1842#(<= main_~i~0 8)} is VALID [2018-11-23 13:04:59,359 INFO L273 TraceCheckUtils]: 22: Hoare triple {1842#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1842#(<= main_~i~0 8)} is VALID [2018-11-23 13:04:59,362 INFO L273 TraceCheckUtils]: 23: Hoare triple {1842#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1843#(<= main_~i~0 9)} is VALID [2018-11-23 13:04:59,365 INFO L273 TraceCheckUtils]: 24: Hoare triple {1843#(<= main_~i~0 9)} assume !(~i~0 < 1024); {1833#false} is VALID [2018-11-23 13:04:59,365 INFO L273 TraceCheckUtils]: 25: Hoare triple {1833#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1833#false} is VALID [2018-11-23 13:04:59,365 INFO L256 TraceCheckUtils]: 26: Hoare triple {1833#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {1833#false} is VALID [2018-11-23 13:04:59,366 INFO L273 TraceCheckUtils]: 27: Hoare triple {1833#false} ~cond := #in~cond; {1833#false} is VALID [2018-11-23 13:04:59,366 INFO L273 TraceCheckUtils]: 28: Hoare triple {1833#false} assume 0 == ~cond; {1833#false} is VALID [2018-11-23 13:04:59,366 INFO L273 TraceCheckUtils]: 29: Hoare triple {1833#false} assume !false; {1833#false} is VALID [2018-11-23 13:04:59,367 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:59,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:59,367 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 13:04:59,375 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:04:59,428 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 13:04:59,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:59,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:59,605 INFO L256 TraceCheckUtils]: 0: Hoare triple {1832#true} call ULTIMATE.init(); {1832#true} is VALID [2018-11-23 13:04:59,605 INFO L273 TraceCheckUtils]: 1: Hoare triple {1832#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1832#true} is VALID [2018-11-23 13:04:59,606 INFO L273 TraceCheckUtils]: 2: Hoare triple {1832#true} assume true; {1832#true} is VALID [2018-11-23 13:04:59,606 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1832#true} {1832#true} #35#return; {1832#true} is VALID [2018-11-23 13:04:59,606 INFO L256 TraceCheckUtils]: 4: Hoare triple {1832#true} call #t~ret2 := main(); {1832#true} is VALID [2018-11-23 13:04:59,607 INFO L273 TraceCheckUtils]: 5: Hoare triple {1832#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {1862#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:59,608 INFO L273 TraceCheckUtils]: 6: Hoare triple {1862#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1862#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:59,608 INFO L273 TraceCheckUtils]: 7: Hoare triple {1862#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1835#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:59,608 INFO L273 TraceCheckUtils]: 8: Hoare triple {1835#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1835#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:59,609 INFO L273 TraceCheckUtils]: 9: Hoare triple {1835#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1836#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:59,609 INFO L273 TraceCheckUtils]: 10: Hoare triple {1836#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1836#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:59,610 INFO L273 TraceCheckUtils]: 11: Hoare triple {1836#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1837#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:59,610 INFO L273 TraceCheckUtils]: 12: Hoare triple {1837#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1837#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:59,610 INFO L273 TraceCheckUtils]: 13: Hoare triple {1837#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1838#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:59,611 INFO L273 TraceCheckUtils]: 14: Hoare triple {1838#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1838#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:59,612 INFO L273 TraceCheckUtils]: 15: Hoare triple {1838#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1839#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:59,612 INFO L273 TraceCheckUtils]: 16: Hoare triple {1839#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1839#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:59,618 INFO L273 TraceCheckUtils]: 17: Hoare triple {1839#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1840#(<= main_~i~0 6)} is VALID [2018-11-23 13:04:59,618 INFO L273 TraceCheckUtils]: 18: Hoare triple {1840#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1840#(<= main_~i~0 6)} is VALID [2018-11-23 13:04:59,619 INFO L273 TraceCheckUtils]: 19: Hoare triple {1840#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1841#(<= main_~i~0 7)} is VALID [2018-11-23 13:04:59,619 INFO L273 TraceCheckUtils]: 20: Hoare triple {1841#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1841#(<= main_~i~0 7)} is VALID [2018-11-23 13:04:59,619 INFO L273 TraceCheckUtils]: 21: Hoare triple {1841#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1842#(<= main_~i~0 8)} is VALID [2018-11-23 13:04:59,620 INFO L273 TraceCheckUtils]: 22: Hoare triple {1842#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1842#(<= main_~i~0 8)} is VALID [2018-11-23 13:04:59,620 INFO L273 TraceCheckUtils]: 23: Hoare triple {1842#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1843#(<= main_~i~0 9)} is VALID [2018-11-23 13:04:59,621 INFO L273 TraceCheckUtils]: 24: Hoare triple {1843#(<= main_~i~0 9)} assume !(~i~0 < 1024); {1833#false} is VALID [2018-11-23 13:04:59,621 INFO L273 TraceCheckUtils]: 25: Hoare triple {1833#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {1833#false} is VALID [2018-11-23 13:04:59,621 INFO L256 TraceCheckUtils]: 26: Hoare triple {1833#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {1833#false} is VALID [2018-11-23 13:04:59,621 INFO L273 TraceCheckUtils]: 27: Hoare triple {1833#false} ~cond := #in~cond; {1833#false} is VALID [2018-11-23 13:04:59,621 INFO L273 TraceCheckUtils]: 28: Hoare triple {1833#false} assume 0 == ~cond; {1833#false} is VALID [2018-11-23 13:04:59,621 INFO L273 TraceCheckUtils]: 29: Hoare triple {1833#false} assume !false; {1833#false} is VALID [2018-11-23 13:04:59,623 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:59,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:59,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 13:04:59,643 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-11-23 13:04:59,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:59,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:04:59,674 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 13:04:59,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:04:59,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:04:59,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:04:59,676 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 13 states. [2018-11-23 13:04:59,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:59,817 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-23 13:04:59,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:04:59,818 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-11-23 13:04:59,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:59,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:04:59,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 40 transitions. [2018-11-23 13:04:59,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:04:59,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 40 transitions. [2018-11-23 13:04:59,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 40 transitions. [2018-11-23 13:04:59,975 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 13:04:59,976 INFO L225 Difference]: With dead ends: 40 [2018-11-23 13:04:59,977 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 13:04:59,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:04:59,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 13:04:59,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 13:04:59,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:59,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 13:04:59,995 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 13:04:59,995 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 13:04:59,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:59,997 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 13:04:59,997 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-23 13:04:59,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:59,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:59,998 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 13:04:59,998 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 13:04:59,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:59,999 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 13:05:00,000 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-23 13:05:00,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:00,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:00,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:00,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:00,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:05:00,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-23 13:05:00,002 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-11-23 13:05:00,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:00,002 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-23 13:05:00,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:05:00,002 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 13:05:00,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 13:05:00,003 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:00,003 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:00,003 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:00,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:00,004 INFO L82 PathProgramCache]: Analyzing trace with hash 489362929, now seen corresponding path program 10 times [2018-11-23 13:05:00,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:00,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:00,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:00,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:00,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:00,236 INFO L256 TraceCheckUtils]: 0: Hoare triple {2111#true} call ULTIMATE.init(); {2111#true} is VALID [2018-11-23 13:05:00,237 INFO L273 TraceCheckUtils]: 1: Hoare triple {2111#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2111#true} is VALID [2018-11-23 13:05:00,237 INFO L273 TraceCheckUtils]: 2: Hoare triple {2111#true} assume true; {2111#true} is VALID [2018-11-23 13:05:00,237 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2111#true} {2111#true} #35#return; {2111#true} is VALID [2018-11-23 13:05:00,237 INFO L256 TraceCheckUtils]: 4: Hoare triple {2111#true} call #t~ret2 := main(); {2111#true} is VALID [2018-11-23 13:05:00,238 INFO L273 TraceCheckUtils]: 5: Hoare triple {2111#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {2113#(= main_~i~0 0)} is VALID [2018-11-23 13:05:00,239 INFO L273 TraceCheckUtils]: 6: Hoare triple {2113#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2113#(= main_~i~0 0)} is VALID [2018-11-23 13:05:00,239 INFO L273 TraceCheckUtils]: 7: Hoare triple {2113#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2114#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:00,240 INFO L273 TraceCheckUtils]: 8: Hoare triple {2114#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2114#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:00,240 INFO L273 TraceCheckUtils]: 9: Hoare triple {2114#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2115#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:00,241 INFO L273 TraceCheckUtils]: 10: Hoare triple {2115#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2115#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:00,241 INFO L273 TraceCheckUtils]: 11: Hoare triple {2115#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2116#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:00,242 INFO L273 TraceCheckUtils]: 12: Hoare triple {2116#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2116#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:00,242 INFO L273 TraceCheckUtils]: 13: Hoare triple {2116#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2117#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:00,261 INFO L273 TraceCheckUtils]: 14: Hoare triple {2117#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2117#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:00,274 INFO L273 TraceCheckUtils]: 15: Hoare triple {2117#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2118#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:00,283 INFO L273 TraceCheckUtils]: 16: Hoare triple {2118#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2118#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:00,288 INFO L273 TraceCheckUtils]: 17: Hoare triple {2118#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2119#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:00,288 INFO L273 TraceCheckUtils]: 18: Hoare triple {2119#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2119#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:00,289 INFO L273 TraceCheckUtils]: 19: Hoare triple {2119#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2120#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:00,289 INFO L273 TraceCheckUtils]: 20: Hoare triple {2120#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2120#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:00,290 INFO L273 TraceCheckUtils]: 21: Hoare triple {2120#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2121#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:00,290 INFO L273 TraceCheckUtils]: 22: Hoare triple {2121#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2121#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:00,291 INFO L273 TraceCheckUtils]: 23: Hoare triple {2121#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2122#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:00,291 INFO L273 TraceCheckUtils]: 24: Hoare triple {2122#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2122#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:00,292 INFO L273 TraceCheckUtils]: 25: Hoare triple {2122#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2123#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:00,292 INFO L273 TraceCheckUtils]: 26: Hoare triple {2123#(<= main_~i~0 10)} assume !(~i~0 < 1024); {2112#false} is VALID [2018-11-23 13:05:00,292 INFO L273 TraceCheckUtils]: 27: Hoare triple {2112#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {2112#false} is VALID [2018-11-23 13:05:00,293 INFO L256 TraceCheckUtils]: 28: Hoare triple {2112#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {2112#false} is VALID [2018-11-23 13:05:00,293 INFO L273 TraceCheckUtils]: 29: Hoare triple {2112#false} ~cond := #in~cond; {2112#false} is VALID [2018-11-23 13:05:00,293 INFO L273 TraceCheckUtils]: 30: Hoare triple {2112#false} assume 0 == ~cond; {2112#false} is VALID [2018-11-23 13:05:00,293 INFO L273 TraceCheckUtils]: 31: Hoare triple {2112#false} assume !false; {2112#false} is VALID [2018-11-23 13:05:00,295 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:00,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:00,295 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 13:05:00,305 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:05:00,320 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:05:00,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:00,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:00,451 INFO L256 TraceCheckUtils]: 0: Hoare triple {2111#true} call ULTIMATE.init(); {2111#true} is VALID [2018-11-23 13:05:00,452 INFO L273 TraceCheckUtils]: 1: Hoare triple {2111#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2111#true} is VALID [2018-11-23 13:05:00,452 INFO L273 TraceCheckUtils]: 2: Hoare triple {2111#true} assume true; {2111#true} is VALID [2018-11-23 13:05:00,452 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2111#true} {2111#true} #35#return; {2111#true} is VALID [2018-11-23 13:05:00,453 INFO L256 TraceCheckUtils]: 4: Hoare triple {2111#true} call #t~ret2 := main(); {2111#true} is VALID [2018-11-23 13:05:00,453 INFO L273 TraceCheckUtils]: 5: Hoare triple {2111#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {2142#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:00,454 INFO L273 TraceCheckUtils]: 6: Hoare triple {2142#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2142#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:00,454 INFO L273 TraceCheckUtils]: 7: Hoare triple {2142#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2114#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:00,455 INFO L273 TraceCheckUtils]: 8: Hoare triple {2114#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2114#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:00,456 INFO L273 TraceCheckUtils]: 9: Hoare triple {2114#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2115#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:00,456 INFO L273 TraceCheckUtils]: 10: Hoare triple {2115#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2115#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:00,457 INFO L273 TraceCheckUtils]: 11: Hoare triple {2115#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2116#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:00,457 INFO L273 TraceCheckUtils]: 12: Hoare triple {2116#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2116#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:00,458 INFO L273 TraceCheckUtils]: 13: Hoare triple {2116#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2117#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:00,459 INFO L273 TraceCheckUtils]: 14: Hoare triple {2117#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2117#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:00,460 INFO L273 TraceCheckUtils]: 15: Hoare triple {2117#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2118#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:00,460 INFO L273 TraceCheckUtils]: 16: Hoare triple {2118#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2118#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:00,461 INFO L273 TraceCheckUtils]: 17: Hoare triple {2118#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2119#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:00,462 INFO L273 TraceCheckUtils]: 18: Hoare triple {2119#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2119#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:00,462 INFO L273 TraceCheckUtils]: 19: Hoare triple {2119#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2120#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:00,463 INFO L273 TraceCheckUtils]: 20: Hoare triple {2120#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2120#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:00,464 INFO L273 TraceCheckUtils]: 21: Hoare triple {2120#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2121#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:00,464 INFO L273 TraceCheckUtils]: 22: Hoare triple {2121#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2121#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:00,465 INFO L273 TraceCheckUtils]: 23: Hoare triple {2121#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2122#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:00,466 INFO L273 TraceCheckUtils]: 24: Hoare triple {2122#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2122#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:00,466 INFO L273 TraceCheckUtils]: 25: Hoare triple {2122#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2123#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:00,467 INFO L273 TraceCheckUtils]: 26: Hoare triple {2123#(<= main_~i~0 10)} assume !(~i~0 < 1024); {2112#false} is VALID [2018-11-23 13:05:00,467 INFO L273 TraceCheckUtils]: 27: Hoare triple {2112#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {2112#false} is VALID [2018-11-23 13:05:00,468 INFO L256 TraceCheckUtils]: 28: Hoare triple {2112#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {2112#false} is VALID [2018-11-23 13:05:00,468 INFO L273 TraceCheckUtils]: 29: Hoare triple {2112#false} ~cond := #in~cond; {2112#false} is VALID [2018-11-23 13:05:00,468 INFO L273 TraceCheckUtils]: 30: Hoare triple {2112#false} assume 0 == ~cond; {2112#false} is VALID [2018-11-23 13:05:00,468 INFO L273 TraceCheckUtils]: 31: Hoare triple {2112#false} assume !false; {2112#false} is VALID [2018-11-23 13:05:00,470 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:00,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:00,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 13:05:00,499 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-11-23 13:05:00,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:00,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 13:05:00,578 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 13:05:00,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:05:00,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:05:00,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:05:00,580 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 14 states. [2018-11-23 13:05:01,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:01,019 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-23 13:05:01,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:05:01,020 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-11-23 13:05:01,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:01,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:05:01,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 42 transitions. [2018-11-23 13:05:01,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:05:01,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 42 transitions. [2018-11-23 13:05:01,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 42 transitions. [2018-11-23 13:05:01,080 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 13:05:01,081 INFO L225 Difference]: With dead ends: 42 [2018-11-23 13:05:01,081 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 13:05:01,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 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 13:05:01,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 13:05:01,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-23 13:05:01,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:01,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2018-11-23 13:05:01,100 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2018-11-23 13:05:01,100 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2018-11-23 13:05:01,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:01,102 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-23 13:05:01,102 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-23 13:05:01,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:01,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:01,103 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2018-11-23 13:05:01,103 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2018-11-23 13:05:01,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:01,104 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-23 13:05:01,105 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-23 13:05:01,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:01,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:01,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:01,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:01,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:05:01,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-11-23 13:05:01,106 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-11-23 13:05:01,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:01,107 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-11-23 13:05:01,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:05:01,107 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-23 13:05:01,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 13:05:01,107 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:01,108 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:01,108 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:01,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:01,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1285617811, now seen corresponding path program 11 times [2018-11-23 13:05:01,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:01,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:01,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:01,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:01,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:01,361 INFO L256 TraceCheckUtils]: 0: Hoare triple {2407#true} call ULTIMATE.init(); {2407#true} is VALID [2018-11-23 13:05:01,361 INFO L273 TraceCheckUtils]: 1: Hoare triple {2407#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2407#true} is VALID [2018-11-23 13:05:01,361 INFO L273 TraceCheckUtils]: 2: Hoare triple {2407#true} assume true; {2407#true} is VALID [2018-11-23 13:05:01,362 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2407#true} {2407#true} #35#return; {2407#true} is VALID [2018-11-23 13:05:01,362 INFO L256 TraceCheckUtils]: 4: Hoare triple {2407#true} call #t~ret2 := main(); {2407#true} is VALID [2018-11-23 13:05:01,363 INFO L273 TraceCheckUtils]: 5: Hoare triple {2407#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {2409#(= main_~i~0 0)} is VALID [2018-11-23 13:05:01,363 INFO L273 TraceCheckUtils]: 6: Hoare triple {2409#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2409#(= main_~i~0 0)} is VALID [2018-11-23 13:05:01,363 INFO L273 TraceCheckUtils]: 7: Hoare triple {2409#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2410#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:01,364 INFO L273 TraceCheckUtils]: 8: Hoare triple {2410#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2410#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:01,364 INFO L273 TraceCheckUtils]: 9: Hoare triple {2410#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2411#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:01,365 INFO L273 TraceCheckUtils]: 10: Hoare triple {2411#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2411#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:01,365 INFO L273 TraceCheckUtils]: 11: Hoare triple {2411#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2412#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:01,366 INFO L273 TraceCheckUtils]: 12: Hoare triple {2412#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2412#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:01,366 INFO L273 TraceCheckUtils]: 13: Hoare triple {2412#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2413#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:01,367 INFO L273 TraceCheckUtils]: 14: Hoare triple {2413#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2413#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:01,368 INFO L273 TraceCheckUtils]: 15: Hoare triple {2413#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2414#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:01,369 INFO L273 TraceCheckUtils]: 16: Hoare triple {2414#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2414#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:01,369 INFO L273 TraceCheckUtils]: 17: Hoare triple {2414#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2415#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:01,370 INFO L273 TraceCheckUtils]: 18: Hoare triple {2415#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2415#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:01,371 INFO L273 TraceCheckUtils]: 19: Hoare triple {2415#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2416#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:01,372 INFO L273 TraceCheckUtils]: 20: Hoare triple {2416#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2416#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:01,373 INFO L273 TraceCheckUtils]: 21: Hoare triple {2416#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2417#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:01,373 INFO L273 TraceCheckUtils]: 22: Hoare triple {2417#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2417#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:01,374 INFO L273 TraceCheckUtils]: 23: Hoare triple {2417#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2418#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:01,375 INFO L273 TraceCheckUtils]: 24: Hoare triple {2418#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2418#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:01,376 INFO L273 TraceCheckUtils]: 25: Hoare triple {2418#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2419#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:01,377 INFO L273 TraceCheckUtils]: 26: Hoare triple {2419#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2419#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:01,377 INFO L273 TraceCheckUtils]: 27: Hoare triple {2419#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2420#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:01,392 INFO L273 TraceCheckUtils]: 28: Hoare triple {2420#(<= main_~i~0 11)} assume !(~i~0 < 1024); {2408#false} is VALID [2018-11-23 13:05:01,392 INFO L273 TraceCheckUtils]: 29: Hoare triple {2408#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {2408#false} is VALID [2018-11-23 13:05:01,393 INFO L256 TraceCheckUtils]: 30: Hoare triple {2408#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {2408#false} is VALID [2018-11-23 13:05:01,393 INFO L273 TraceCheckUtils]: 31: Hoare triple {2408#false} ~cond := #in~cond; {2408#false} is VALID [2018-11-23 13:05:01,393 INFO L273 TraceCheckUtils]: 32: Hoare triple {2408#false} assume 0 == ~cond; {2408#false} is VALID [2018-11-23 13:05:01,393 INFO L273 TraceCheckUtils]: 33: Hoare triple {2408#false} assume !false; {2408#false} is VALID [2018-11-23 13:05:01,395 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:01,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:01,395 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 13:05:01,403 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:05:01,448 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 13:05:01,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:01,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:01,764 INFO L256 TraceCheckUtils]: 0: Hoare triple {2407#true} call ULTIMATE.init(); {2407#true} is VALID [2018-11-23 13:05:01,765 INFO L273 TraceCheckUtils]: 1: Hoare triple {2407#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2407#true} is VALID [2018-11-23 13:05:01,765 INFO L273 TraceCheckUtils]: 2: Hoare triple {2407#true} assume true; {2407#true} is VALID [2018-11-23 13:05:01,765 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2407#true} {2407#true} #35#return; {2407#true} is VALID [2018-11-23 13:05:01,765 INFO L256 TraceCheckUtils]: 4: Hoare triple {2407#true} call #t~ret2 := main(); {2407#true} is VALID [2018-11-23 13:05:01,766 INFO L273 TraceCheckUtils]: 5: Hoare triple {2407#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {2439#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:01,766 INFO L273 TraceCheckUtils]: 6: Hoare triple {2439#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2439#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:01,766 INFO L273 TraceCheckUtils]: 7: Hoare triple {2439#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2410#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:01,767 INFO L273 TraceCheckUtils]: 8: Hoare triple {2410#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2410#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:01,767 INFO L273 TraceCheckUtils]: 9: Hoare triple {2410#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2411#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:01,768 INFO L273 TraceCheckUtils]: 10: Hoare triple {2411#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2411#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:01,768 INFO L273 TraceCheckUtils]: 11: Hoare triple {2411#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2412#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:01,769 INFO L273 TraceCheckUtils]: 12: Hoare triple {2412#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2412#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:01,770 INFO L273 TraceCheckUtils]: 13: Hoare triple {2412#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2413#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:01,770 INFO L273 TraceCheckUtils]: 14: Hoare triple {2413#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2413#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:01,771 INFO L273 TraceCheckUtils]: 15: Hoare triple {2413#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2414#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:01,772 INFO L273 TraceCheckUtils]: 16: Hoare triple {2414#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2414#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:01,772 INFO L273 TraceCheckUtils]: 17: Hoare triple {2414#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2415#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:01,773 INFO L273 TraceCheckUtils]: 18: Hoare triple {2415#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2415#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:01,774 INFO L273 TraceCheckUtils]: 19: Hoare triple {2415#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2416#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:01,774 INFO L273 TraceCheckUtils]: 20: Hoare triple {2416#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2416#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:01,775 INFO L273 TraceCheckUtils]: 21: Hoare triple {2416#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2417#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:01,776 INFO L273 TraceCheckUtils]: 22: Hoare triple {2417#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2417#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:01,776 INFO L273 TraceCheckUtils]: 23: Hoare triple {2417#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2418#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:01,777 INFO L273 TraceCheckUtils]: 24: Hoare triple {2418#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2418#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:01,778 INFO L273 TraceCheckUtils]: 25: Hoare triple {2418#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2419#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:01,778 INFO L273 TraceCheckUtils]: 26: Hoare triple {2419#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2419#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:01,779 INFO L273 TraceCheckUtils]: 27: Hoare triple {2419#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2420#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:01,780 INFO L273 TraceCheckUtils]: 28: Hoare triple {2420#(<= main_~i~0 11)} assume !(~i~0 < 1024); {2408#false} is VALID [2018-11-23 13:05:01,780 INFO L273 TraceCheckUtils]: 29: Hoare triple {2408#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {2408#false} is VALID [2018-11-23 13:05:01,780 INFO L256 TraceCheckUtils]: 30: Hoare triple {2408#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {2408#false} is VALID [2018-11-23 13:05:01,780 INFO L273 TraceCheckUtils]: 31: Hoare triple {2408#false} ~cond := #in~cond; {2408#false} is VALID [2018-11-23 13:05:01,781 INFO L273 TraceCheckUtils]: 32: Hoare triple {2408#false} assume 0 == ~cond; {2408#false} is VALID [2018-11-23 13:05:01,781 INFO L273 TraceCheckUtils]: 33: Hoare triple {2408#false} assume !false; {2408#false} is VALID [2018-11-23 13:05:01,782 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:01,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:01,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 13:05:01,804 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-11-23 13:05:01,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:01,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 13:05:01,838 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 13:05:01,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 13:05:01,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:05:01,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:05:01,839 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 15 states. [2018-11-23 13:05:02,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:02,042 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-23 13:05:02,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:05:02,042 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-11-23 13:05:02,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:02,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:05:02,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 44 transitions. [2018-11-23 13:05:02,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:05:02,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 44 transitions. [2018-11-23 13:05:02,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 44 transitions. [2018-11-23 13:05:02,098 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:02,100 INFO L225 Difference]: With dead ends: 44 [2018-11-23 13:05:02,100 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 13:05:02,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 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 13:05:02,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 13:05:02,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-11-23 13:05:02,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:02,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 37 states. [2018-11-23 13:05:02,117 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 37 states. [2018-11-23 13:05:02,117 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 37 states. [2018-11-23 13:05:02,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:02,118 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-23 13:05:02,118 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-23 13:05:02,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:02,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:02,119 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 38 states. [2018-11-23 13:05:02,119 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 38 states. [2018-11-23 13:05:02,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:02,120 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-23 13:05:02,120 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-23 13:05:02,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:02,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:02,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:02,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:02,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 13:05:02,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-11-23 13:05:02,121 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-11-23 13:05:02,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:02,122 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-11-23 13:05:02,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 13:05:02,122 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-23 13:05:02,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 13:05:02,123 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:02,123 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:02,123 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:02,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:02,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1982380725, now seen corresponding path program 12 times [2018-11-23 13:05:02,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:02,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:02,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:02,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:02,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:02,619 INFO L256 TraceCheckUtils]: 0: Hoare triple {2720#true} call ULTIMATE.init(); {2720#true} is VALID [2018-11-23 13:05:02,620 INFO L273 TraceCheckUtils]: 1: Hoare triple {2720#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2720#true} is VALID [2018-11-23 13:05:02,620 INFO L273 TraceCheckUtils]: 2: Hoare triple {2720#true} assume true; {2720#true} is VALID [2018-11-23 13:05:02,620 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2720#true} {2720#true} #35#return; {2720#true} is VALID [2018-11-23 13:05:02,620 INFO L256 TraceCheckUtils]: 4: Hoare triple {2720#true} call #t~ret2 := main(); {2720#true} is VALID [2018-11-23 13:05:02,621 INFO L273 TraceCheckUtils]: 5: Hoare triple {2720#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {2722#(= main_~i~0 0)} is VALID [2018-11-23 13:05:02,621 INFO L273 TraceCheckUtils]: 6: Hoare triple {2722#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2722#(= main_~i~0 0)} is VALID [2018-11-23 13:05:02,622 INFO L273 TraceCheckUtils]: 7: Hoare triple {2722#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2723#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:02,622 INFO L273 TraceCheckUtils]: 8: Hoare triple {2723#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2723#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:02,622 INFO L273 TraceCheckUtils]: 9: Hoare triple {2723#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2724#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:02,623 INFO L273 TraceCheckUtils]: 10: Hoare triple {2724#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2724#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:02,623 INFO L273 TraceCheckUtils]: 11: Hoare triple {2724#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2725#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:02,624 INFO L273 TraceCheckUtils]: 12: Hoare triple {2725#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2725#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:02,625 INFO L273 TraceCheckUtils]: 13: Hoare triple {2725#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2726#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:02,625 INFO L273 TraceCheckUtils]: 14: Hoare triple {2726#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2726#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:02,626 INFO L273 TraceCheckUtils]: 15: Hoare triple {2726#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2727#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:02,627 INFO L273 TraceCheckUtils]: 16: Hoare triple {2727#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2727#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:02,627 INFO L273 TraceCheckUtils]: 17: Hoare triple {2727#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2728#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:02,628 INFO L273 TraceCheckUtils]: 18: Hoare triple {2728#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2728#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:02,629 INFO L273 TraceCheckUtils]: 19: Hoare triple {2728#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2729#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:02,629 INFO L273 TraceCheckUtils]: 20: Hoare triple {2729#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2729#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:02,630 INFO L273 TraceCheckUtils]: 21: Hoare triple {2729#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2730#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:02,631 INFO L273 TraceCheckUtils]: 22: Hoare triple {2730#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2730#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:02,631 INFO L273 TraceCheckUtils]: 23: Hoare triple {2730#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2731#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:02,632 INFO L273 TraceCheckUtils]: 24: Hoare triple {2731#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2731#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:02,633 INFO L273 TraceCheckUtils]: 25: Hoare triple {2731#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2732#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:02,633 INFO L273 TraceCheckUtils]: 26: Hoare triple {2732#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2732#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:02,634 INFO L273 TraceCheckUtils]: 27: Hoare triple {2732#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2733#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:02,634 INFO L273 TraceCheckUtils]: 28: Hoare triple {2733#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2733#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:02,635 INFO L273 TraceCheckUtils]: 29: Hoare triple {2733#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2734#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:02,636 INFO L273 TraceCheckUtils]: 30: Hoare triple {2734#(<= main_~i~0 12)} assume !(~i~0 < 1024); {2721#false} is VALID [2018-11-23 13:05:02,636 INFO L273 TraceCheckUtils]: 31: Hoare triple {2721#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {2721#false} is VALID [2018-11-23 13:05:02,636 INFO L256 TraceCheckUtils]: 32: Hoare triple {2721#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {2721#false} is VALID [2018-11-23 13:05:02,637 INFO L273 TraceCheckUtils]: 33: Hoare triple {2721#false} ~cond := #in~cond; {2721#false} is VALID [2018-11-23 13:05:02,637 INFO L273 TraceCheckUtils]: 34: Hoare triple {2721#false} assume 0 == ~cond; {2721#false} is VALID [2018-11-23 13:05:02,637 INFO L273 TraceCheckUtils]: 35: Hoare triple {2721#false} assume !false; {2721#false} is VALID [2018-11-23 13:05:02,639 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:02,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:02,640 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 13:05:02,654 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:05:02,781 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 13:05:02,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:02,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:02,961 INFO L256 TraceCheckUtils]: 0: Hoare triple {2720#true} call ULTIMATE.init(); {2720#true} is VALID [2018-11-23 13:05:02,962 INFO L273 TraceCheckUtils]: 1: Hoare triple {2720#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2720#true} is VALID [2018-11-23 13:05:02,962 INFO L273 TraceCheckUtils]: 2: Hoare triple {2720#true} assume true; {2720#true} is VALID [2018-11-23 13:05:02,962 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2720#true} {2720#true} #35#return; {2720#true} is VALID [2018-11-23 13:05:02,963 INFO L256 TraceCheckUtils]: 4: Hoare triple {2720#true} call #t~ret2 := main(); {2720#true} is VALID [2018-11-23 13:05:02,967 INFO L273 TraceCheckUtils]: 5: Hoare triple {2720#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {2753#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:02,967 INFO L273 TraceCheckUtils]: 6: Hoare triple {2753#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2753#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:02,968 INFO L273 TraceCheckUtils]: 7: Hoare triple {2753#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2723#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:02,968 INFO L273 TraceCheckUtils]: 8: Hoare triple {2723#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2723#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:02,969 INFO L273 TraceCheckUtils]: 9: Hoare triple {2723#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2724#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:02,969 INFO L273 TraceCheckUtils]: 10: Hoare triple {2724#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2724#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:02,970 INFO L273 TraceCheckUtils]: 11: Hoare triple {2724#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2725#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:02,970 INFO L273 TraceCheckUtils]: 12: Hoare triple {2725#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2725#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:02,970 INFO L273 TraceCheckUtils]: 13: Hoare triple {2725#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2726#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:02,971 INFO L273 TraceCheckUtils]: 14: Hoare triple {2726#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2726#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:02,972 INFO L273 TraceCheckUtils]: 15: Hoare triple {2726#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2727#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:02,973 INFO L273 TraceCheckUtils]: 16: Hoare triple {2727#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2727#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:02,973 INFO L273 TraceCheckUtils]: 17: Hoare triple {2727#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2728#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:02,974 INFO L273 TraceCheckUtils]: 18: Hoare triple {2728#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2728#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:02,975 INFO L273 TraceCheckUtils]: 19: Hoare triple {2728#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2729#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:02,976 INFO L273 TraceCheckUtils]: 20: Hoare triple {2729#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2729#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:02,976 INFO L273 TraceCheckUtils]: 21: Hoare triple {2729#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2730#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:02,977 INFO L273 TraceCheckUtils]: 22: Hoare triple {2730#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2730#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:02,978 INFO L273 TraceCheckUtils]: 23: Hoare triple {2730#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2731#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:02,979 INFO L273 TraceCheckUtils]: 24: Hoare triple {2731#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2731#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:02,980 INFO L273 TraceCheckUtils]: 25: Hoare triple {2731#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2732#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:02,980 INFO L273 TraceCheckUtils]: 26: Hoare triple {2732#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2732#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:02,981 INFO L273 TraceCheckUtils]: 27: Hoare triple {2732#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2733#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:02,982 INFO L273 TraceCheckUtils]: 28: Hoare triple {2733#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2733#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:02,983 INFO L273 TraceCheckUtils]: 29: Hoare triple {2733#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2734#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:02,983 INFO L273 TraceCheckUtils]: 30: Hoare triple {2734#(<= main_~i~0 12)} assume !(~i~0 < 1024); {2721#false} is VALID [2018-11-23 13:05:02,984 INFO L273 TraceCheckUtils]: 31: Hoare triple {2721#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {2721#false} is VALID [2018-11-23 13:05:02,984 INFO L256 TraceCheckUtils]: 32: Hoare triple {2721#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {2721#false} is VALID [2018-11-23 13:05:02,984 INFO L273 TraceCheckUtils]: 33: Hoare triple {2721#false} ~cond := #in~cond; {2721#false} is VALID [2018-11-23 13:05:02,984 INFO L273 TraceCheckUtils]: 34: Hoare triple {2721#false} assume 0 == ~cond; {2721#false} is VALID [2018-11-23 13:05:02,985 INFO L273 TraceCheckUtils]: 35: Hoare triple {2721#false} assume !false; {2721#false} is VALID [2018-11-23 13:05:02,986 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:03,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:03,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 13:05:03,006 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2018-11-23 13:05:03,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:03,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 13:05:03,043 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 13:05:03,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 13:05:03,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 13:05:03,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:05:03,044 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 16 states. [2018-11-23 13:05:03,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:03,242 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-23 13:05:03,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 13:05:03,242 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2018-11-23 13:05:03,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:03,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:05:03,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 46 transitions. [2018-11-23 13:05:03,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:05:03,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 46 transitions. [2018-11-23 13:05:03,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 46 transitions. [2018-11-23 13:05:03,298 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 13:05:03,299 INFO L225 Difference]: With dead ends: 46 [2018-11-23 13:05:03,299 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 13:05:03,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:05:03,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 13:05:03,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 13:05:03,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:03,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2018-11-23 13:05:03,318 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2018-11-23 13:05:03,318 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2018-11-23 13:05:03,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:03,319 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-23 13:05:03,319 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-23 13:05:03,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:03,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:03,320 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2018-11-23 13:05:03,320 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2018-11-23 13:05:03,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:03,321 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-23 13:05:03,321 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-23 13:05:03,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:03,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:03,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:03,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:03,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:05:03,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-23 13:05:03,322 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-11-23 13:05:03,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:03,322 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-11-23 13:05:03,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 13:05:03,323 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-23 13:05:03,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 13:05:03,323 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:03,323 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:03,323 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:03,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:03,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1556642903, now seen corresponding path program 13 times [2018-11-23 13:05:03,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:03,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:03,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:03,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:03,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:03,579 INFO L256 TraceCheckUtils]: 0: Hoare triple {3050#true} call ULTIMATE.init(); {3050#true} is VALID [2018-11-23 13:05:03,579 INFO L273 TraceCheckUtils]: 1: Hoare triple {3050#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3050#true} is VALID [2018-11-23 13:05:03,580 INFO L273 TraceCheckUtils]: 2: Hoare triple {3050#true} assume true; {3050#true} is VALID [2018-11-23 13:05:03,580 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3050#true} {3050#true} #35#return; {3050#true} is VALID [2018-11-23 13:05:03,580 INFO L256 TraceCheckUtils]: 4: Hoare triple {3050#true} call #t~ret2 := main(); {3050#true} is VALID [2018-11-23 13:05:03,581 INFO L273 TraceCheckUtils]: 5: Hoare triple {3050#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {3052#(= main_~i~0 0)} is VALID [2018-11-23 13:05:03,581 INFO L273 TraceCheckUtils]: 6: Hoare triple {3052#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3052#(= main_~i~0 0)} is VALID [2018-11-23 13:05:03,582 INFO L273 TraceCheckUtils]: 7: Hoare triple {3052#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3053#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:03,582 INFO L273 TraceCheckUtils]: 8: Hoare triple {3053#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3053#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:03,583 INFO L273 TraceCheckUtils]: 9: Hoare triple {3053#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3054#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:03,583 INFO L273 TraceCheckUtils]: 10: Hoare triple {3054#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3054#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:03,584 INFO L273 TraceCheckUtils]: 11: Hoare triple {3054#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3055#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:03,584 INFO L273 TraceCheckUtils]: 12: Hoare triple {3055#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3055#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:03,585 INFO L273 TraceCheckUtils]: 13: Hoare triple {3055#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3056#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:03,585 INFO L273 TraceCheckUtils]: 14: Hoare triple {3056#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3056#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:03,586 INFO L273 TraceCheckUtils]: 15: Hoare triple {3056#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3057#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:03,587 INFO L273 TraceCheckUtils]: 16: Hoare triple {3057#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3057#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:03,587 INFO L273 TraceCheckUtils]: 17: Hoare triple {3057#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3058#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:03,588 INFO L273 TraceCheckUtils]: 18: Hoare triple {3058#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3058#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:03,589 INFO L273 TraceCheckUtils]: 19: Hoare triple {3058#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3059#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:03,589 INFO L273 TraceCheckUtils]: 20: Hoare triple {3059#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3059#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:03,590 INFO L273 TraceCheckUtils]: 21: Hoare triple {3059#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3060#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:03,591 INFO L273 TraceCheckUtils]: 22: Hoare triple {3060#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3060#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:03,591 INFO L273 TraceCheckUtils]: 23: Hoare triple {3060#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3061#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:03,592 INFO L273 TraceCheckUtils]: 24: Hoare triple {3061#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3061#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:03,593 INFO L273 TraceCheckUtils]: 25: Hoare triple {3061#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3062#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:03,593 INFO L273 TraceCheckUtils]: 26: Hoare triple {3062#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3062#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:03,594 INFO L273 TraceCheckUtils]: 27: Hoare triple {3062#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3063#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:03,595 INFO L273 TraceCheckUtils]: 28: Hoare triple {3063#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3063#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:03,595 INFO L273 TraceCheckUtils]: 29: Hoare triple {3063#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3064#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:03,596 INFO L273 TraceCheckUtils]: 30: Hoare triple {3064#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3064#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:03,597 INFO L273 TraceCheckUtils]: 31: Hoare triple {3064#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3065#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:03,597 INFO L273 TraceCheckUtils]: 32: Hoare triple {3065#(<= main_~i~0 13)} assume !(~i~0 < 1024); {3051#false} is VALID [2018-11-23 13:05:03,598 INFO L273 TraceCheckUtils]: 33: Hoare triple {3051#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {3051#false} is VALID [2018-11-23 13:05:03,598 INFO L256 TraceCheckUtils]: 34: Hoare triple {3051#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {3051#false} is VALID [2018-11-23 13:05:03,598 INFO L273 TraceCheckUtils]: 35: Hoare triple {3051#false} ~cond := #in~cond; {3051#false} is VALID [2018-11-23 13:05:03,598 INFO L273 TraceCheckUtils]: 36: Hoare triple {3051#false} assume 0 == ~cond; {3051#false} is VALID [2018-11-23 13:05:03,599 INFO L273 TraceCheckUtils]: 37: Hoare triple {3051#false} assume !false; {3051#false} is VALID [2018-11-23 13:05:03,601 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:03,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:03,601 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 13:05:03,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:03,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:03,818 INFO L256 TraceCheckUtils]: 0: Hoare triple {3050#true} call ULTIMATE.init(); {3050#true} is VALID [2018-11-23 13:05:03,818 INFO L273 TraceCheckUtils]: 1: Hoare triple {3050#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3050#true} is VALID [2018-11-23 13:05:03,818 INFO L273 TraceCheckUtils]: 2: Hoare triple {3050#true} assume true; {3050#true} is VALID [2018-11-23 13:05:03,819 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3050#true} {3050#true} #35#return; {3050#true} is VALID [2018-11-23 13:05:03,819 INFO L256 TraceCheckUtils]: 4: Hoare triple {3050#true} call #t~ret2 := main(); {3050#true} is VALID [2018-11-23 13:05:03,820 INFO L273 TraceCheckUtils]: 5: Hoare triple {3050#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {3084#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:03,820 INFO L273 TraceCheckUtils]: 6: Hoare triple {3084#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3084#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:03,821 INFO L273 TraceCheckUtils]: 7: Hoare triple {3084#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3053#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:03,821 INFO L273 TraceCheckUtils]: 8: Hoare triple {3053#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3053#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:03,821 INFO L273 TraceCheckUtils]: 9: Hoare triple {3053#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3054#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:03,822 INFO L273 TraceCheckUtils]: 10: Hoare triple {3054#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3054#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:03,822 INFO L273 TraceCheckUtils]: 11: Hoare triple {3054#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3055#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:03,823 INFO L273 TraceCheckUtils]: 12: Hoare triple {3055#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3055#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:03,824 INFO L273 TraceCheckUtils]: 13: Hoare triple {3055#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3056#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:03,824 INFO L273 TraceCheckUtils]: 14: Hoare triple {3056#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3056#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:03,825 INFO L273 TraceCheckUtils]: 15: Hoare triple {3056#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3057#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:03,825 INFO L273 TraceCheckUtils]: 16: Hoare triple {3057#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3057#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:03,826 INFO L273 TraceCheckUtils]: 17: Hoare triple {3057#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3058#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:03,827 INFO L273 TraceCheckUtils]: 18: Hoare triple {3058#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3058#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:03,827 INFO L273 TraceCheckUtils]: 19: Hoare triple {3058#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3059#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:03,828 INFO L273 TraceCheckUtils]: 20: Hoare triple {3059#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3059#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:03,829 INFO L273 TraceCheckUtils]: 21: Hoare triple {3059#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3060#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:03,829 INFO L273 TraceCheckUtils]: 22: Hoare triple {3060#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3060#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:03,830 INFO L273 TraceCheckUtils]: 23: Hoare triple {3060#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3061#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:03,831 INFO L273 TraceCheckUtils]: 24: Hoare triple {3061#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3061#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:03,831 INFO L273 TraceCheckUtils]: 25: Hoare triple {3061#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3062#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:03,832 INFO L273 TraceCheckUtils]: 26: Hoare triple {3062#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3062#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:03,833 INFO L273 TraceCheckUtils]: 27: Hoare triple {3062#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3063#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:03,833 INFO L273 TraceCheckUtils]: 28: Hoare triple {3063#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3063#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:03,834 INFO L273 TraceCheckUtils]: 29: Hoare triple {3063#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3064#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:03,835 INFO L273 TraceCheckUtils]: 30: Hoare triple {3064#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3064#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:03,835 INFO L273 TraceCheckUtils]: 31: Hoare triple {3064#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3065#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:03,836 INFO L273 TraceCheckUtils]: 32: Hoare triple {3065#(<= main_~i~0 13)} assume !(~i~0 < 1024); {3051#false} is VALID [2018-11-23 13:05:03,836 INFO L273 TraceCheckUtils]: 33: Hoare triple {3051#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {3051#false} is VALID [2018-11-23 13:05:03,836 INFO L256 TraceCheckUtils]: 34: Hoare triple {3051#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {3051#false} is VALID [2018-11-23 13:05:03,837 INFO L273 TraceCheckUtils]: 35: Hoare triple {3051#false} ~cond := #in~cond; {3051#false} is VALID [2018-11-23 13:05:03,837 INFO L273 TraceCheckUtils]: 36: Hoare triple {3051#false} assume 0 == ~cond; {3051#false} is VALID [2018-11-23 13:05:03,837 INFO L273 TraceCheckUtils]: 37: Hoare triple {3051#false} assume !false; {3051#false} is VALID [2018-11-23 13:05:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:03,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:03,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 13:05:03,859 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-11-23 13:05:03,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:03,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 13:05:03,898 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 13:05:03,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:05:03,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:05:03,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:05:03,899 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 17 states. [2018-11-23 13:05:04,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:04,159 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-23 13:05:04,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:05:04,159 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-11-23 13:05:04,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:04,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:05:04,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 48 transitions. [2018-11-23 13:05:04,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:05:04,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 48 transitions. [2018-11-23 13:05:04,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 48 transitions. [2018-11-23 13:05:04,230 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 13:05:04,231 INFO L225 Difference]: With dead ends: 48 [2018-11-23 13:05:04,231 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 13:05:04,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 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 13:05:04,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 13:05:04,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-23 13:05:04,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:04,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2018-11-23 13:05:04,259 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2018-11-23 13:05:04,259 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2018-11-23 13:05:04,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:04,261 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-23 13:05:04,261 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-23 13:05:04,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:04,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:04,262 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2018-11-23 13:05:04,262 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2018-11-23 13:05:04,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:04,263 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-23 13:05:04,263 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-23 13:05:04,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:04,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:04,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:04,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:04,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 13:05:04,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-11-23 13:05:04,265 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-11-23 13:05:04,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:04,265 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-11-23 13:05:04,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:05:04,265 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-23 13:05:04,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 13:05:04,266 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:04,266 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:04,266 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:04,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:04,266 INFO L82 PathProgramCache]: Analyzing trace with hash 444489081, now seen corresponding path program 14 times [2018-11-23 13:05:04,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:04,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:04,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:04,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:04,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:04,591 INFO L256 TraceCheckUtils]: 0: Hoare triple {3397#true} call ULTIMATE.init(); {3397#true} is VALID [2018-11-23 13:05:04,591 INFO L273 TraceCheckUtils]: 1: Hoare triple {3397#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3397#true} is VALID [2018-11-23 13:05:04,592 INFO L273 TraceCheckUtils]: 2: Hoare triple {3397#true} assume true; {3397#true} is VALID [2018-11-23 13:05:04,592 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3397#true} {3397#true} #35#return; {3397#true} is VALID [2018-11-23 13:05:04,592 INFO L256 TraceCheckUtils]: 4: Hoare triple {3397#true} call #t~ret2 := main(); {3397#true} is VALID [2018-11-23 13:05:04,593 INFO L273 TraceCheckUtils]: 5: Hoare triple {3397#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {3399#(= main_~i~0 0)} is VALID [2018-11-23 13:05:04,593 INFO L273 TraceCheckUtils]: 6: Hoare triple {3399#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3399#(= main_~i~0 0)} is VALID [2018-11-23 13:05:04,594 INFO L273 TraceCheckUtils]: 7: Hoare triple {3399#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3400#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:04,595 INFO L273 TraceCheckUtils]: 8: Hoare triple {3400#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3400#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:04,596 INFO L273 TraceCheckUtils]: 9: Hoare triple {3400#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3401#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:04,597 INFO L273 TraceCheckUtils]: 10: Hoare triple {3401#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3401#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:04,597 INFO L273 TraceCheckUtils]: 11: Hoare triple {3401#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3402#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:04,598 INFO L273 TraceCheckUtils]: 12: Hoare triple {3402#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3402#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:04,599 INFO L273 TraceCheckUtils]: 13: Hoare triple {3402#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3403#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:04,600 INFO L273 TraceCheckUtils]: 14: Hoare triple {3403#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3403#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:04,600 INFO L273 TraceCheckUtils]: 15: Hoare triple {3403#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3404#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:04,601 INFO L273 TraceCheckUtils]: 16: Hoare triple {3404#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3404#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:04,602 INFO L273 TraceCheckUtils]: 17: Hoare triple {3404#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3405#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:04,603 INFO L273 TraceCheckUtils]: 18: Hoare triple {3405#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3405#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:04,603 INFO L273 TraceCheckUtils]: 19: Hoare triple {3405#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3406#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:04,604 INFO L273 TraceCheckUtils]: 20: Hoare triple {3406#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3406#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:04,605 INFO L273 TraceCheckUtils]: 21: Hoare triple {3406#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3407#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:04,606 INFO L273 TraceCheckUtils]: 22: Hoare triple {3407#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3407#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:04,606 INFO L273 TraceCheckUtils]: 23: Hoare triple {3407#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3408#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:04,607 INFO L273 TraceCheckUtils]: 24: Hoare triple {3408#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3408#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:04,608 INFO L273 TraceCheckUtils]: 25: Hoare triple {3408#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3409#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:04,609 INFO L273 TraceCheckUtils]: 26: Hoare triple {3409#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3409#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:04,609 INFO L273 TraceCheckUtils]: 27: Hoare triple {3409#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3410#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:04,610 INFO L273 TraceCheckUtils]: 28: Hoare triple {3410#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3410#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:04,611 INFO L273 TraceCheckUtils]: 29: Hoare triple {3410#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3411#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:04,612 INFO L273 TraceCheckUtils]: 30: Hoare triple {3411#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3411#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:04,612 INFO L273 TraceCheckUtils]: 31: Hoare triple {3411#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3412#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:04,613 INFO L273 TraceCheckUtils]: 32: Hoare triple {3412#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3412#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:04,614 INFO L273 TraceCheckUtils]: 33: Hoare triple {3412#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3413#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:04,615 INFO L273 TraceCheckUtils]: 34: Hoare triple {3413#(<= main_~i~0 14)} assume !(~i~0 < 1024); {3398#false} is VALID [2018-11-23 13:05:04,615 INFO L273 TraceCheckUtils]: 35: Hoare triple {3398#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {3398#false} is VALID [2018-11-23 13:05:04,615 INFO L256 TraceCheckUtils]: 36: Hoare triple {3398#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {3398#false} is VALID [2018-11-23 13:05:04,616 INFO L273 TraceCheckUtils]: 37: Hoare triple {3398#false} ~cond := #in~cond; {3398#false} is VALID [2018-11-23 13:05:04,616 INFO L273 TraceCheckUtils]: 38: Hoare triple {3398#false} assume 0 == ~cond; {3398#false} is VALID [2018-11-23 13:05:04,616 INFO L273 TraceCheckUtils]: 39: Hoare triple {3398#false} assume !false; {3398#false} is VALID [2018-11-23 13:05:04,619 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:04,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:04,619 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 13:05:04,629 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:05:04,661 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:05:04,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:04,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:04,828 INFO L256 TraceCheckUtils]: 0: Hoare triple {3397#true} call ULTIMATE.init(); {3397#true} is VALID [2018-11-23 13:05:04,828 INFO L273 TraceCheckUtils]: 1: Hoare triple {3397#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3397#true} is VALID [2018-11-23 13:05:04,829 INFO L273 TraceCheckUtils]: 2: Hoare triple {3397#true} assume true; {3397#true} is VALID [2018-11-23 13:05:04,829 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3397#true} {3397#true} #35#return; {3397#true} is VALID [2018-11-23 13:05:04,829 INFO L256 TraceCheckUtils]: 4: Hoare triple {3397#true} call #t~ret2 := main(); {3397#true} is VALID [2018-11-23 13:05:04,830 INFO L273 TraceCheckUtils]: 5: Hoare triple {3397#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {3432#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:04,830 INFO L273 TraceCheckUtils]: 6: Hoare triple {3432#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3432#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:04,831 INFO L273 TraceCheckUtils]: 7: Hoare triple {3432#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3400#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:04,831 INFO L273 TraceCheckUtils]: 8: Hoare triple {3400#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3400#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:04,832 INFO L273 TraceCheckUtils]: 9: Hoare triple {3400#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3401#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:04,832 INFO L273 TraceCheckUtils]: 10: Hoare triple {3401#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3401#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:04,833 INFO L273 TraceCheckUtils]: 11: Hoare triple {3401#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3402#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:04,833 INFO L273 TraceCheckUtils]: 12: Hoare triple {3402#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3402#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:04,834 INFO L273 TraceCheckUtils]: 13: Hoare triple {3402#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3403#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:04,835 INFO L273 TraceCheckUtils]: 14: Hoare triple {3403#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3403#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:04,835 INFO L273 TraceCheckUtils]: 15: Hoare triple {3403#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3404#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:04,836 INFO L273 TraceCheckUtils]: 16: Hoare triple {3404#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3404#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:04,837 INFO L273 TraceCheckUtils]: 17: Hoare triple {3404#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3405#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:04,838 INFO L273 TraceCheckUtils]: 18: Hoare triple {3405#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3405#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:04,839 INFO L273 TraceCheckUtils]: 19: Hoare triple {3405#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3406#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:04,839 INFO L273 TraceCheckUtils]: 20: Hoare triple {3406#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3406#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:04,840 INFO L273 TraceCheckUtils]: 21: Hoare triple {3406#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3407#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:04,841 INFO L273 TraceCheckUtils]: 22: Hoare triple {3407#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3407#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:04,841 INFO L273 TraceCheckUtils]: 23: Hoare triple {3407#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3408#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:04,842 INFO L273 TraceCheckUtils]: 24: Hoare triple {3408#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3408#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:04,843 INFO L273 TraceCheckUtils]: 25: Hoare triple {3408#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3409#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:04,844 INFO L273 TraceCheckUtils]: 26: Hoare triple {3409#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3409#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:04,845 INFO L273 TraceCheckUtils]: 27: Hoare triple {3409#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3410#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:04,845 INFO L273 TraceCheckUtils]: 28: Hoare triple {3410#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3410#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:04,846 INFO L273 TraceCheckUtils]: 29: Hoare triple {3410#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3411#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:04,847 INFO L273 TraceCheckUtils]: 30: Hoare triple {3411#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3411#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:04,847 INFO L273 TraceCheckUtils]: 31: Hoare triple {3411#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3412#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:04,848 INFO L273 TraceCheckUtils]: 32: Hoare triple {3412#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3412#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:04,849 INFO L273 TraceCheckUtils]: 33: Hoare triple {3412#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3413#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:04,850 INFO L273 TraceCheckUtils]: 34: Hoare triple {3413#(<= main_~i~0 14)} assume !(~i~0 < 1024); {3398#false} is VALID [2018-11-23 13:05:04,850 INFO L273 TraceCheckUtils]: 35: Hoare triple {3398#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {3398#false} is VALID [2018-11-23 13:05:04,850 INFO L256 TraceCheckUtils]: 36: Hoare triple {3398#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {3398#false} is VALID [2018-11-23 13:05:04,851 INFO L273 TraceCheckUtils]: 37: Hoare triple {3398#false} ~cond := #in~cond; {3398#false} is VALID [2018-11-23 13:05:04,851 INFO L273 TraceCheckUtils]: 38: Hoare triple {3398#false} assume 0 == ~cond; {3398#false} is VALID [2018-11-23 13:05:04,851 INFO L273 TraceCheckUtils]: 39: Hoare triple {3398#false} assume !false; {3398#false} is VALID [2018-11-23 13:05:04,855 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:04,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:04,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 13:05:04,884 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2018-11-23 13:05:04,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:04,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 13:05:04,985 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 13:05:04,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 13:05:04,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 13:05:04,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:05:04,986 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 18 states. [2018-11-23 13:05:05,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:05,248 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-11-23 13:05:05,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 13:05:05,249 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2018-11-23 13:05:05,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:05,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:05:05,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 50 transitions. [2018-11-23 13:05:05,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:05:05,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 50 transitions. [2018-11-23 13:05:05,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 50 transitions. [2018-11-23 13:05:05,743 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:05,744 INFO L225 Difference]: With dead ends: 50 [2018-11-23 13:05:05,744 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 13:05:05,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:05:05,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 13:05:05,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-11-23 13:05:05,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:05,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2018-11-23 13:05:05,806 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2018-11-23 13:05:05,806 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2018-11-23 13:05:05,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:05,807 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-23 13:05:05,808 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-23 13:05:05,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:05,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:05,808 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2018-11-23 13:05:05,808 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2018-11-23 13:05:05,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:05,809 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-23 13:05:05,810 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-23 13:05:05,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:05,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:05,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:05,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:05,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 13:05:05,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-11-23 13:05:05,811 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-11-23 13:05:05,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:05,812 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-11-23 13:05:05,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 13:05:05,812 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-11-23 13:05:05,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 13:05:05,812 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:05,813 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:05,813 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:05,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:05,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1111522843, now seen corresponding path program 15 times [2018-11-23 13:05:05,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:05,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:05,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:05,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:05,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:06,138 INFO L256 TraceCheckUtils]: 0: Hoare triple {3761#true} call ULTIMATE.init(); {3761#true} is VALID [2018-11-23 13:05:06,138 INFO L273 TraceCheckUtils]: 1: Hoare triple {3761#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3761#true} is VALID [2018-11-23 13:05:06,139 INFO L273 TraceCheckUtils]: 2: Hoare triple {3761#true} assume true; {3761#true} is VALID [2018-11-23 13:05:06,139 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3761#true} {3761#true} #35#return; {3761#true} is VALID [2018-11-23 13:05:06,139 INFO L256 TraceCheckUtils]: 4: Hoare triple {3761#true} call #t~ret2 := main(); {3761#true} is VALID [2018-11-23 13:05:06,160 INFO L273 TraceCheckUtils]: 5: Hoare triple {3761#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {3763#(= main_~i~0 0)} is VALID [2018-11-23 13:05:06,175 INFO L273 TraceCheckUtils]: 6: Hoare triple {3763#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3763#(= main_~i~0 0)} is VALID [2018-11-23 13:05:06,175 INFO L273 TraceCheckUtils]: 7: Hoare triple {3763#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3764#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:06,176 INFO L273 TraceCheckUtils]: 8: Hoare triple {3764#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3764#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:06,176 INFO L273 TraceCheckUtils]: 9: Hoare triple {3764#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3765#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:06,177 INFO L273 TraceCheckUtils]: 10: Hoare triple {3765#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3765#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:06,177 INFO L273 TraceCheckUtils]: 11: Hoare triple {3765#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3766#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:06,177 INFO L273 TraceCheckUtils]: 12: Hoare triple {3766#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3766#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:06,178 INFO L273 TraceCheckUtils]: 13: Hoare triple {3766#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3767#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:06,179 INFO L273 TraceCheckUtils]: 14: Hoare triple {3767#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3767#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:06,179 INFO L273 TraceCheckUtils]: 15: Hoare triple {3767#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3768#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:06,180 INFO L273 TraceCheckUtils]: 16: Hoare triple {3768#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3768#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:06,181 INFO L273 TraceCheckUtils]: 17: Hoare triple {3768#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3769#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:06,181 INFO L273 TraceCheckUtils]: 18: Hoare triple {3769#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3769#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:06,182 INFO L273 TraceCheckUtils]: 19: Hoare triple {3769#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3770#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:06,182 INFO L273 TraceCheckUtils]: 20: Hoare triple {3770#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3770#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:06,183 INFO L273 TraceCheckUtils]: 21: Hoare triple {3770#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3771#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:06,184 INFO L273 TraceCheckUtils]: 22: Hoare triple {3771#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3771#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:06,184 INFO L273 TraceCheckUtils]: 23: Hoare triple {3771#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3772#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:06,185 INFO L273 TraceCheckUtils]: 24: Hoare triple {3772#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3772#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:06,186 INFO L273 TraceCheckUtils]: 25: Hoare triple {3772#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3773#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:06,186 INFO L273 TraceCheckUtils]: 26: Hoare triple {3773#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3773#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:06,187 INFO L273 TraceCheckUtils]: 27: Hoare triple {3773#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3774#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:06,188 INFO L273 TraceCheckUtils]: 28: Hoare triple {3774#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3774#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:06,188 INFO L273 TraceCheckUtils]: 29: Hoare triple {3774#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3775#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:06,189 INFO L273 TraceCheckUtils]: 30: Hoare triple {3775#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3775#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:06,190 INFO L273 TraceCheckUtils]: 31: Hoare triple {3775#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3776#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:06,190 INFO L273 TraceCheckUtils]: 32: Hoare triple {3776#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3776#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:06,191 INFO L273 TraceCheckUtils]: 33: Hoare triple {3776#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3777#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:06,191 INFO L273 TraceCheckUtils]: 34: Hoare triple {3777#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3777#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:06,192 INFO L273 TraceCheckUtils]: 35: Hoare triple {3777#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3778#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:06,193 INFO L273 TraceCheckUtils]: 36: Hoare triple {3778#(<= main_~i~0 15)} assume !(~i~0 < 1024); {3762#false} is VALID [2018-11-23 13:05:06,193 INFO L273 TraceCheckUtils]: 37: Hoare triple {3762#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {3762#false} is VALID [2018-11-23 13:05:06,193 INFO L256 TraceCheckUtils]: 38: Hoare triple {3762#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {3762#false} is VALID [2018-11-23 13:05:06,193 INFO L273 TraceCheckUtils]: 39: Hoare triple {3762#false} ~cond := #in~cond; {3762#false} is VALID [2018-11-23 13:05:06,194 INFO L273 TraceCheckUtils]: 40: Hoare triple {3762#false} assume 0 == ~cond; {3762#false} is VALID [2018-11-23 13:05:06,194 INFO L273 TraceCheckUtils]: 41: Hoare triple {3762#false} assume !false; {3762#false} is VALID [2018-11-23 13:05:06,196 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:06,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:06,197 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 13:05:06,206 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:05:06,386 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-23 13:05:06,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:06,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:06,538 INFO L256 TraceCheckUtils]: 0: Hoare triple {3761#true} call ULTIMATE.init(); {3761#true} is VALID [2018-11-23 13:05:06,539 INFO L273 TraceCheckUtils]: 1: Hoare triple {3761#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3761#true} is VALID [2018-11-23 13:05:06,539 INFO L273 TraceCheckUtils]: 2: Hoare triple {3761#true} assume true; {3761#true} is VALID [2018-11-23 13:05:06,539 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3761#true} {3761#true} #35#return; {3761#true} is VALID [2018-11-23 13:05:06,539 INFO L256 TraceCheckUtils]: 4: Hoare triple {3761#true} call #t~ret2 := main(); {3761#true} is VALID [2018-11-23 13:05:06,540 INFO L273 TraceCheckUtils]: 5: Hoare triple {3761#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {3797#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:06,541 INFO L273 TraceCheckUtils]: 6: Hoare triple {3797#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3797#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:06,541 INFO L273 TraceCheckUtils]: 7: Hoare triple {3797#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3764#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:06,541 INFO L273 TraceCheckUtils]: 8: Hoare triple {3764#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3764#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:06,542 INFO L273 TraceCheckUtils]: 9: Hoare triple {3764#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3765#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:06,543 INFO L273 TraceCheckUtils]: 10: Hoare triple {3765#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3765#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:06,545 INFO L273 TraceCheckUtils]: 11: Hoare triple {3765#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3766#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:06,546 INFO L273 TraceCheckUtils]: 12: Hoare triple {3766#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3766#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:06,546 INFO L273 TraceCheckUtils]: 13: Hoare triple {3766#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3767#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:06,546 INFO L273 TraceCheckUtils]: 14: Hoare triple {3767#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3767#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:06,547 INFO L273 TraceCheckUtils]: 15: Hoare triple {3767#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3768#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:06,547 INFO L273 TraceCheckUtils]: 16: Hoare triple {3768#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3768#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:06,548 INFO L273 TraceCheckUtils]: 17: Hoare triple {3768#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3769#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:06,548 INFO L273 TraceCheckUtils]: 18: Hoare triple {3769#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3769#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:06,548 INFO L273 TraceCheckUtils]: 19: Hoare triple {3769#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3770#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:06,549 INFO L273 TraceCheckUtils]: 20: Hoare triple {3770#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3770#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:06,551 INFO L273 TraceCheckUtils]: 21: Hoare triple {3770#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3771#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:06,551 INFO L273 TraceCheckUtils]: 22: Hoare triple {3771#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3771#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:06,552 INFO L273 TraceCheckUtils]: 23: Hoare triple {3771#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3772#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:06,552 INFO L273 TraceCheckUtils]: 24: Hoare triple {3772#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3772#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:06,553 INFO L273 TraceCheckUtils]: 25: Hoare triple {3772#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3773#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:06,553 INFO L273 TraceCheckUtils]: 26: Hoare triple {3773#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3773#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:06,554 INFO L273 TraceCheckUtils]: 27: Hoare triple {3773#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3774#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:06,554 INFO L273 TraceCheckUtils]: 28: Hoare triple {3774#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3774#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:06,554 INFO L273 TraceCheckUtils]: 29: Hoare triple {3774#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3775#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:06,555 INFO L273 TraceCheckUtils]: 30: Hoare triple {3775#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3775#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:06,556 INFO L273 TraceCheckUtils]: 31: Hoare triple {3775#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3776#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:06,556 INFO L273 TraceCheckUtils]: 32: Hoare triple {3776#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3776#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:06,557 INFO L273 TraceCheckUtils]: 33: Hoare triple {3776#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3777#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:06,558 INFO L273 TraceCheckUtils]: 34: Hoare triple {3777#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3777#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:06,558 INFO L273 TraceCheckUtils]: 35: Hoare triple {3777#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3778#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:06,559 INFO L273 TraceCheckUtils]: 36: Hoare triple {3778#(<= main_~i~0 15)} assume !(~i~0 < 1024); {3762#false} is VALID [2018-11-23 13:05:06,559 INFO L273 TraceCheckUtils]: 37: Hoare triple {3762#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {3762#false} is VALID [2018-11-23 13:05:06,559 INFO L256 TraceCheckUtils]: 38: Hoare triple {3762#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {3762#false} is VALID [2018-11-23 13:05:06,560 INFO L273 TraceCheckUtils]: 39: Hoare triple {3762#false} ~cond := #in~cond; {3762#false} is VALID [2018-11-23 13:05:06,560 INFO L273 TraceCheckUtils]: 40: Hoare triple {3762#false} assume 0 == ~cond; {3762#false} is VALID [2018-11-23 13:05:06,560 INFO L273 TraceCheckUtils]: 41: Hoare triple {3762#false} assume !false; {3762#false} is VALID [2018-11-23 13:05:06,562 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:06,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:06,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 13:05:06,581 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2018-11-23 13:05:06,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:06,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 13:05:06,621 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:06,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 13:05:06,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 13:05:06,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:05:06,622 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 19 states. [2018-11-23 13:05:06,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:06,756 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-11-23 13:05:06,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 13:05:06,756 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2018-11-23 13:05:06,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:06,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:05:06,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 52 transitions. [2018-11-23 13:05:06,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:05:06,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 52 transitions. [2018-11-23 13:05:06,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 52 transitions. [2018-11-23 13:05:07,318 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:07,319 INFO L225 Difference]: With dead ends: 52 [2018-11-23 13:05:07,319 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 13:05:07,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:05:07,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 13:05:07,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-11-23 13:05:07,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:07,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 45 states. [2018-11-23 13:05:07,344 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 45 states. [2018-11-23 13:05:07,344 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 45 states. [2018-11-23 13:05:07,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:07,345 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-23 13:05:07,345 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-23 13:05:07,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:07,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:07,346 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 46 states. [2018-11-23 13:05:07,346 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 46 states. [2018-11-23 13:05:07,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:07,347 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-23 13:05:07,347 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-23 13:05:07,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:07,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:07,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:07,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:07,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 13:05:07,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-11-23 13:05:07,349 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-11-23 13:05:07,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:07,350 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-11-23 13:05:07,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 13:05:07,350 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-23 13:05:07,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 13:05:07,350 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:07,350 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:07,351 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:07,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:07,351 INFO L82 PathProgramCache]: Analyzing trace with hash -2114126275, now seen corresponding path program 16 times [2018-11-23 13:05:07,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:07,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:07,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:07,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:07,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:07,666 INFO L256 TraceCheckUtils]: 0: Hoare triple {4142#true} call ULTIMATE.init(); {4142#true} is VALID [2018-11-23 13:05:07,667 INFO L273 TraceCheckUtils]: 1: Hoare triple {4142#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4142#true} is VALID [2018-11-23 13:05:07,667 INFO L273 TraceCheckUtils]: 2: Hoare triple {4142#true} assume true; {4142#true} is VALID [2018-11-23 13:05:07,667 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4142#true} {4142#true} #35#return; {4142#true} is VALID [2018-11-23 13:05:07,667 INFO L256 TraceCheckUtils]: 4: Hoare triple {4142#true} call #t~ret2 := main(); {4142#true} is VALID [2018-11-23 13:05:07,668 INFO L273 TraceCheckUtils]: 5: Hoare triple {4142#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {4144#(= main_~i~0 0)} is VALID [2018-11-23 13:05:07,668 INFO L273 TraceCheckUtils]: 6: Hoare triple {4144#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4144#(= main_~i~0 0)} is VALID [2018-11-23 13:05:07,669 INFO L273 TraceCheckUtils]: 7: Hoare triple {4144#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4145#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:07,669 INFO L273 TraceCheckUtils]: 8: Hoare triple {4145#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4145#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:07,670 INFO L273 TraceCheckUtils]: 9: Hoare triple {4145#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4146#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:07,670 INFO L273 TraceCheckUtils]: 10: Hoare triple {4146#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4146#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:07,671 INFO L273 TraceCheckUtils]: 11: Hoare triple {4146#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4147#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:07,671 INFO L273 TraceCheckUtils]: 12: Hoare triple {4147#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4147#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:07,672 INFO L273 TraceCheckUtils]: 13: Hoare triple {4147#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4148#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:07,672 INFO L273 TraceCheckUtils]: 14: Hoare triple {4148#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4148#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:07,673 INFO L273 TraceCheckUtils]: 15: Hoare triple {4148#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4149#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:07,674 INFO L273 TraceCheckUtils]: 16: Hoare triple {4149#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4149#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:07,674 INFO L273 TraceCheckUtils]: 17: Hoare triple {4149#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4150#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:07,675 INFO L273 TraceCheckUtils]: 18: Hoare triple {4150#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4150#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:07,676 INFO L273 TraceCheckUtils]: 19: Hoare triple {4150#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4151#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:07,676 INFO L273 TraceCheckUtils]: 20: Hoare triple {4151#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4151#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:07,677 INFO L273 TraceCheckUtils]: 21: Hoare triple {4151#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4152#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:07,678 INFO L273 TraceCheckUtils]: 22: Hoare triple {4152#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4152#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:07,678 INFO L273 TraceCheckUtils]: 23: Hoare triple {4152#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4153#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:07,679 INFO L273 TraceCheckUtils]: 24: Hoare triple {4153#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4153#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:07,680 INFO L273 TraceCheckUtils]: 25: Hoare triple {4153#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4154#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:07,680 INFO L273 TraceCheckUtils]: 26: Hoare triple {4154#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4154#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:07,681 INFO L273 TraceCheckUtils]: 27: Hoare triple {4154#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4155#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:07,681 INFO L273 TraceCheckUtils]: 28: Hoare triple {4155#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4155#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:07,682 INFO L273 TraceCheckUtils]: 29: Hoare triple {4155#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4156#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:07,683 INFO L273 TraceCheckUtils]: 30: Hoare triple {4156#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4156#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:07,683 INFO L273 TraceCheckUtils]: 31: Hoare triple {4156#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4157#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:07,684 INFO L273 TraceCheckUtils]: 32: Hoare triple {4157#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4157#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:07,685 INFO L273 TraceCheckUtils]: 33: Hoare triple {4157#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4158#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:07,685 INFO L273 TraceCheckUtils]: 34: Hoare triple {4158#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4158#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:07,686 INFO L273 TraceCheckUtils]: 35: Hoare triple {4158#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4159#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:07,687 INFO L273 TraceCheckUtils]: 36: Hoare triple {4159#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4159#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:07,687 INFO L273 TraceCheckUtils]: 37: Hoare triple {4159#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4160#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:07,688 INFO L273 TraceCheckUtils]: 38: Hoare triple {4160#(<= main_~i~0 16)} assume !(~i~0 < 1024); {4143#false} is VALID [2018-11-23 13:05:07,688 INFO L273 TraceCheckUtils]: 39: Hoare triple {4143#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {4143#false} is VALID [2018-11-23 13:05:07,688 INFO L256 TraceCheckUtils]: 40: Hoare triple {4143#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {4143#false} is VALID [2018-11-23 13:05:07,689 INFO L273 TraceCheckUtils]: 41: Hoare triple {4143#false} ~cond := #in~cond; {4143#false} is VALID [2018-11-23 13:05:07,689 INFO L273 TraceCheckUtils]: 42: Hoare triple {4143#false} assume 0 == ~cond; {4143#false} is VALID [2018-11-23 13:05:07,689 INFO L273 TraceCheckUtils]: 43: Hoare triple {4143#false} assume !false; {4143#false} is VALID [2018-11-23 13:05:07,691 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:07,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:07,692 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 13:05:07,706 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:05:07,725 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:05:07,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:07,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:07,898 INFO L256 TraceCheckUtils]: 0: Hoare triple {4142#true} call ULTIMATE.init(); {4142#true} is VALID [2018-11-23 13:05:07,899 INFO L273 TraceCheckUtils]: 1: Hoare triple {4142#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4142#true} is VALID [2018-11-23 13:05:07,899 INFO L273 TraceCheckUtils]: 2: Hoare triple {4142#true} assume true; {4142#true} is VALID [2018-11-23 13:05:07,899 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4142#true} {4142#true} #35#return; {4142#true} is VALID [2018-11-23 13:05:07,899 INFO L256 TraceCheckUtils]: 4: Hoare triple {4142#true} call #t~ret2 := main(); {4142#true} is VALID [2018-11-23 13:05:07,900 INFO L273 TraceCheckUtils]: 5: Hoare triple {4142#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {4179#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:07,900 INFO L273 TraceCheckUtils]: 6: Hoare triple {4179#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4179#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:07,900 INFO L273 TraceCheckUtils]: 7: Hoare triple {4179#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4145#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:07,901 INFO L273 TraceCheckUtils]: 8: Hoare triple {4145#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4145#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:07,901 INFO L273 TraceCheckUtils]: 9: Hoare triple {4145#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4146#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:07,901 INFO L273 TraceCheckUtils]: 10: Hoare triple {4146#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4146#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:07,902 INFO L273 TraceCheckUtils]: 11: Hoare triple {4146#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4147#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:07,902 INFO L273 TraceCheckUtils]: 12: Hoare triple {4147#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4147#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:07,903 INFO L273 TraceCheckUtils]: 13: Hoare triple {4147#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4148#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:07,904 INFO L273 TraceCheckUtils]: 14: Hoare triple {4148#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4148#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:07,904 INFO L273 TraceCheckUtils]: 15: Hoare triple {4148#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4149#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:07,905 INFO L273 TraceCheckUtils]: 16: Hoare triple {4149#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4149#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:07,906 INFO L273 TraceCheckUtils]: 17: Hoare triple {4149#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4150#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:07,906 INFO L273 TraceCheckUtils]: 18: Hoare triple {4150#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4150#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:07,907 INFO L273 TraceCheckUtils]: 19: Hoare triple {4150#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4151#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:07,908 INFO L273 TraceCheckUtils]: 20: Hoare triple {4151#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4151#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:07,908 INFO L273 TraceCheckUtils]: 21: Hoare triple {4151#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4152#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:07,910 INFO L273 TraceCheckUtils]: 22: Hoare triple {4152#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4152#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:07,910 INFO L273 TraceCheckUtils]: 23: Hoare triple {4152#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4153#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:07,911 INFO L273 TraceCheckUtils]: 24: Hoare triple {4153#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4153#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:07,912 INFO L273 TraceCheckUtils]: 25: Hoare triple {4153#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4154#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:07,912 INFO L273 TraceCheckUtils]: 26: Hoare triple {4154#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4154#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:07,913 INFO L273 TraceCheckUtils]: 27: Hoare triple {4154#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4155#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:07,914 INFO L273 TraceCheckUtils]: 28: Hoare triple {4155#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4155#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:07,914 INFO L273 TraceCheckUtils]: 29: Hoare triple {4155#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4156#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:07,915 INFO L273 TraceCheckUtils]: 30: Hoare triple {4156#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4156#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:07,916 INFO L273 TraceCheckUtils]: 31: Hoare triple {4156#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4157#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:07,916 INFO L273 TraceCheckUtils]: 32: Hoare triple {4157#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4157#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:07,917 INFO L273 TraceCheckUtils]: 33: Hoare triple {4157#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4158#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:07,917 INFO L273 TraceCheckUtils]: 34: Hoare triple {4158#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4158#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:07,918 INFO L273 TraceCheckUtils]: 35: Hoare triple {4158#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4159#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:07,919 INFO L273 TraceCheckUtils]: 36: Hoare triple {4159#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4159#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:07,919 INFO L273 TraceCheckUtils]: 37: Hoare triple {4159#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4160#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:07,920 INFO L273 TraceCheckUtils]: 38: Hoare triple {4160#(<= main_~i~0 16)} assume !(~i~0 < 1024); {4143#false} is VALID [2018-11-23 13:05:07,920 INFO L273 TraceCheckUtils]: 39: Hoare triple {4143#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {4143#false} is VALID [2018-11-23 13:05:07,921 INFO L256 TraceCheckUtils]: 40: Hoare triple {4143#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {4143#false} is VALID [2018-11-23 13:05:07,921 INFO L273 TraceCheckUtils]: 41: Hoare triple {4143#false} ~cond := #in~cond; {4143#false} is VALID [2018-11-23 13:05:07,921 INFO L273 TraceCheckUtils]: 42: Hoare triple {4143#false} assume 0 == ~cond; {4143#false} is VALID [2018-11-23 13:05:07,921 INFO L273 TraceCheckUtils]: 43: Hoare triple {4143#false} assume !false; {4143#false} is VALID [2018-11-23 13:05:07,923 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:07,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:07,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 13:05:07,943 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2018-11-23 13:05:07,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:07,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 13:05:07,989 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:07,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 13:05:07,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 13:05:07,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:05:07,990 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 20 states. [2018-11-23 13:05:08,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:08,121 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-23 13:05:08,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 13:05:08,121 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2018-11-23 13:05:08,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:08,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:05:08,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 54 transitions. [2018-11-23 13:05:08,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:05:08,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 54 transitions. [2018-11-23 13:05:08,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 54 transitions. [2018-11-23 13:05:08,616 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 13:05:08,618 INFO L225 Difference]: With dead ends: 54 [2018-11-23 13:05:08,618 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 13:05:08,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:05:08,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 13:05:08,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-11-23 13:05:08,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:08,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2018-11-23 13:05:08,645 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2018-11-23 13:05:08,645 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2018-11-23 13:05:08,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:08,648 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-23 13:05:08,648 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-23 13:05:08,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:08,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:08,649 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2018-11-23 13:05:08,649 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2018-11-23 13:05:08,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:08,650 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-23 13:05:08,650 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-23 13:05:08,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:08,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:08,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:08,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:08,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 13:05:08,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-11-23 13:05:08,651 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-11-23 13:05:08,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:08,652 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-11-23 13:05:08,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 13:05:08,652 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-11-23 13:05:08,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 13:05:08,652 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:08,652 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:08,653 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:08,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:08,653 INFO L82 PathProgramCache]: Analyzing trace with hash -996540961, now seen corresponding path program 17 times [2018-11-23 13:05:08,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:08,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:08,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:08,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:08,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:08,955 INFO L256 TraceCheckUtils]: 0: Hoare triple {4540#true} call ULTIMATE.init(); {4540#true} is VALID [2018-11-23 13:05:08,955 INFO L273 TraceCheckUtils]: 1: Hoare triple {4540#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4540#true} is VALID [2018-11-23 13:05:08,955 INFO L273 TraceCheckUtils]: 2: Hoare triple {4540#true} assume true; {4540#true} is VALID [2018-11-23 13:05:08,955 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4540#true} {4540#true} #35#return; {4540#true} is VALID [2018-11-23 13:05:08,956 INFO L256 TraceCheckUtils]: 4: Hoare triple {4540#true} call #t~ret2 := main(); {4540#true} is VALID [2018-11-23 13:05:08,956 INFO L273 TraceCheckUtils]: 5: Hoare triple {4540#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {4542#(= main_~i~0 0)} is VALID [2018-11-23 13:05:08,957 INFO L273 TraceCheckUtils]: 6: Hoare triple {4542#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4542#(= main_~i~0 0)} is VALID [2018-11-23 13:05:08,957 INFO L273 TraceCheckUtils]: 7: Hoare triple {4542#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4543#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:08,958 INFO L273 TraceCheckUtils]: 8: Hoare triple {4543#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4543#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:08,959 INFO L273 TraceCheckUtils]: 9: Hoare triple {4543#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4544#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:08,959 INFO L273 TraceCheckUtils]: 10: Hoare triple {4544#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4544#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:08,960 INFO L273 TraceCheckUtils]: 11: Hoare triple {4544#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4545#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:08,961 INFO L273 TraceCheckUtils]: 12: Hoare triple {4545#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4545#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:08,961 INFO L273 TraceCheckUtils]: 13: Hoare triple {4545#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4546#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:08,962 INFO L273 TraceCheckUtils]: 14: Hoare triple {4546#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4546#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:08,963 INFO L273 TraceCheckUtils]: 15: Hoare triple {4546#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4547#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:08,963 INFO L273 TraceCheckUtils]: 16: Hoare triple {4547#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4547#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:08,964 INFO L273 TraceCheckUtils]: 17: Hoare triple {4547#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4548#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:08,965 INFO L273 TraceCheckUtils]: 18: Hoare triple {4548#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4548#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:08,965 INFO L273 TraceCheckUtils]: 19: Hoare triple {4548#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4549#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:08,966 INFO L273 TraceCheckUtils]: 20: Hoare triple {4549#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4549#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:08,966 INFO L273 TraceCheckUtils]: 21: Hoare triple {4549#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4550#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:08,967 INFO L273 TraceCheckUtils]: 22: Hoare triple {4550#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4550#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:08,968 INFO L273 TraceCheckUtils]: 23: Hoare triple {4550#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4551#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:08,968 INFO L273 TraceCheckUtils]: 24: Hoare triple {4551#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4551#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:08,969 INFO L273 TraceCheckUtils]: 25: Hoare triple {4551#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4552#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:08,970 INFO L273 TraceCheckUtils]: 26: Hoare triple {4552#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4552#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:08,970 INFO L273 TraceCheckUtils]: 27: Hoare triple {4552#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4553#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:08,971 INFO L273 TraceCheckUtils]: 28: Hoare triple {4553#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4553#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:08,971 INFO L273 TraceCheckUtils]: 29: Hoare triple {4553#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4554#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:08,972 INFO L273 TraceCheckUtils]: 30: Hoare triple {4554#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4554#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:08,973 INFO L273 TraceCheckUtils]: 31: Hoare triple {4554#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4555#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:08,973 INFO L273 TraceCheckUtils]: 32: Hoare triple {4555#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4555#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:08,974 INFO L273 TraceCheckUtils]: 33: Hoare triple {4555#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4556#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:08,975 INFO L273 TraceCheckUtils]: 34: Hoare triple {4556#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4556#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:08,975 INFO L273 TraceCheckUtils]: 35: Hoare triple {4556#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4557#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:08,976 INFO L273 TraceCheckUtils]: 36: Hoare triple {4557#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4557#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:08,977 INFO L273 TraceCheckUtils]: 37: Hoare triple {4557#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4558#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:08,977 INFO L273 TraceCheckUtils]: 38: Hoare triple {4558#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4558#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:08,978 INFO L273 TraceCheckUtils]: 39: Hoare triple {4558#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4559#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:08,978 INFO L273 TraceCheckUtils]: 40: Hoare triple {4559#(<= main_~i~0 17)} assume !(~i~0 < 1024); {4541#false} is VALID [2018-11-23 13:05:08,979 INFO L273 TraceCheckUtils]: 41: Hoare triple {4541#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {4541#false} is VALID [2018-11-23 13:05:08,979 INFO L256 TraceCheckUtils]: 42: Hoare triple {4541#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {4541#false} is VALID [2018-11-23 13:05:08,979 INFO L273 TraceCheckUtils]: 43: Hoare triple {4541#false} ~cond := #in~cond; {4541#false} is VALID [2018-11-23 13:05:08,979 INFO L273 TraceCheckUtils]: 44: Hoare triple {4541#false} assume 0 == ~cond; {4541#false} is VALID [2018-11-23 13:05:08,980 INFO L273 TraceCheckUtils]: 45: Hoare triple {4541#false} assume !false; {4541#false} is VALID [2018-11-23 13:05:08,982 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:08,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:08,982 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 13:05:08,991 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:05:09,109 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-23 13:05:09,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:09,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:09,322 INFO L256 TraceCheckUtils]: 0: Hoare triple {4540#true} call ULTIMATE.init(); {4540#true} is VALID [2018-11-23 13:05:09,322 INFO L273 TraceCheckUtils]: 1: Hoare triple {4540#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4540#true} is VALID [2018-11-23 13:05:09,322 INFO L273 TraceCheckUtils]: 2: Hoare triple {4540#true} assume true; {4540#true} is VALID [2018-11-23 13:05:09,322 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4540#true} {4540#true} #35#return; {4540#true} is VALID [2018-11-23 13:05:09,323 INFO L256 TraceCheckUtils]: 4: Hoare triple {4540#true} call #t~ret2 := main(); {4540#true} is VALID [2018-11-23 13:05:09,323 INFO L273 TraceCheckUtils]: 5: Hoare triple {4540#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {4578#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:09,324 INFO L273 TraceCheckUtils]: 6: Hoare triple {4578#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4578#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:09,324 INFO L273 TraceCheckUtils]: 7: Hoare triple {4578#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4543#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:09,325 INFO L273 TraceCheckUtils]: 8: Hoare triple {4543#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4543#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:09,325 INFO L273 TraceCheckUtils]: 9: Hoare triple {4543#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4544#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:09,325 INFO L273 TraceCheckUtils]: 10: Hoare triple {4544#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4544#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:09,326 INFO L273 TraceCheckUtils]: 11: Hoare triple {4544#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4545#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:09,327 INFO L273 TraceCheckUtils]: 12: Hoare triple {4545#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4545#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:09,327 INFO L273 TraceCheckUtils]: 13: Hoare triple {4545#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4546#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:09,328 INFO L273 TraceCheckUtils]: 14: Hoare triple {4546#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4546#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:09,329 INFO L273 TraceCheckUtils]: 15: Hoare triple {4546#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4547#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:09,329 INFO L273 TraceCheckUtils]: 16: Hoare triple {4547#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4547#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:09,330 INFO L273 TraceCheckUtils]: 17: Hoare triple {4547#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4548#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:09,331 INFO L273 TraceCheckUtils]: 18: Hoare triple {4548#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4548#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:09,331 INFO L273 TraceCheckUtils]: 19: Hoare triple {4548#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4549#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:09,332 INFO L273 TraceCheckUtils]: 20: Hoare triple {4549#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4549#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:09,333 INFO L273 TraceCheckUtils]: 21: Hoare triple {4549#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4550#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:09,333 INFO L273 TraceCheckUtils]: 22: Hoare triple {4550#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4550#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:09,334 INFO L273 TraceCheckUtils]: 23: Hoare triple {4550#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4551#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:09,335 INFO L273 TraceCheckUtils]: 24: Hoare triple {4551#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4551#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:09,335 INFO L273 TraceCheckUtils]: 25: Hoare triple {4551#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4552#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:09,336 INFO L273 TraceCheckUtils]: 26: Hoare triple {4552#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4552#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:09,337 INFO L273 TraceCheckUtils]: 27: Hoare triple {4552#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4553#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:09,337 INFO L273 TraceCheckUtils]: 28: Hoare triple {4553#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4553#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:09,338 INFO L273 TraceCheckUtils]: 29: Hoare triple {4553#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4554#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:09,338 INFO L273 TraceCheckUtils]: 30: Hoare triple {4554#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4554#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:09,339 INFO L273 TraceCheckUtils]: 31: Hoare triple {4554#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4555#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:09,340 INFO L273 TraceCheckUtils]: 32: Hoare triple {4555#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4555#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:09,341 INFO L273 TraceCheckUtils]: 33: Hoare triple {4555#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4556#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:09,341 INFO L273 TraceCheckUtils]: 34: Hoare triple {4556#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4556#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:09,342 INFO L273 TraceCheckUtils]: 35: Hoare triple {4556#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4557#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:09,342 INFO L273 TraceCheckUtils]: 36: Hoare triple {4557#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4557#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:09,343 INFO L273 TraceCheckUtils]: 37: Hoare triple {4557#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4558#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:09,344 INFO L273 TraceCheckUtils]: 38: Hoare triple {4558#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4558#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:09,344 INFO L273 TraceCheckUtils]: 39: Hoare triple {4558#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4559#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:09,345 INFO L273 TraceCheckUtils]: 40: Hoare triple {4559#(<= main_~i~0 17)} assume !(~i~0 < 1024); {4541#false} is VALID [2018-11-23 13:05:09,345 INFO L273 TraceCheckUtils]: 41: Hoare triple {4541#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {4541#false} is VALID [2018-11-23 13:05:09,346 INFO L256 TraceCheckUtils]: 42: Hoare triple {4541#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {4541#false} is VALID [2018-11-23 13:05:09,346 INFO L273 TraceCheckUtils]: 43: Hoare triple {4541#false} ~cond := #in~cond; {4541#false} is VALID [2018-11-23 13:05:09,346 INFO L273 TraceCheckUtils]: 44: Hoare triple {4541#false} assume 0 == ~cond; {4541#false} is VALID [2018-11-23 13:05:09,346 INFO L273 TraceCheckUtils]: 45: Hoare triple {4541#false} assume !false; {4541#false} is VALID [2018-11-23 13:05:09,349 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:09,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:09,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 13:05:09,369 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 46 [2018-11-23 13:05:09,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:09,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 13:05:09,416 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:09,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 13:05:09,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 13:05:09,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:05:09,418 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 21 states. [2018-11-23 13:05:09,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:09,730 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-11-23 13:05:09,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 13:05:09,730 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 46 [2018-11-23 13:05:09,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:09,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:05:09,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 56 transitions. [2018-11-23 13:05:09,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:05:09,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 56 transitions. [2018-11-23 13:05:09,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 56 transitions. [2018-11-23 13:05:09,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:09,789 INFO L225 Difference]: With dead ends: 56 [2018-11-23 13:05:09,789 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 13:05:09,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 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 13:05:09,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 13:05:09,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-23 13:05:09,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:09,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 49 states. [2018-11-23 13:05:09,813 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 49 states. [2018-11-23 13:05:09,813 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 49 states. [2018-11-23 13:05:09,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:09,814 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-11-23 13:05:09,814 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-23 13:05:09,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:09,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:09,815 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 50 states. [2018-11-23 13:05:09,815 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 50 states. [2018-11-23 13:05:09,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:09,816 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-11-23 13:05:09,816 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-23 13:05:09,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:09,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:09,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:09,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:09,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 13:05:09,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-11-23 13:05:09,818 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-11-23 13:05:09,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:09,818 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-11-23 13:05:09,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 13:05:09,821 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-11-23 13:05:09,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 13:05:09,822 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:09,822 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:09,822 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:09,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:09,822 INFO L82 PathProgramCache]: Analyzing trace with hash -738878207, now seen corresponding path program 18 times [2018-11-23 13:05:09,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:09,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:09,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:09,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:09,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:10,753 INFO L256 TraceCheckUtils]: 0: Hoare triple {4955#true} call ULTIMATE.init(); {4955#true} is VALID [2018-11-23 13:05:10,753 INFO L273 TraceCheckUtils]: 1: Hoare triple {4955#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4955#true} is VALID [2018-11-23 13:05:10,753 INFO L273 TraceCheckUtils]: 2: Hoare triple {4955#true} assume true; {4955#true} is VALID [2018-11-23 13:05:10,754 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4955#true} {4955#true} #35#return; {4955#true} is VALID [2018-11-23 13:05:10,754 INFO L256 TraceCheckUtils]: 4: Hoare triple {4955#true} call #t~ret2 := main(); {4955#true} is VALID [2018-11-23 13:05:10,755 INFO L273 TraceCheckUtils]: 5: Hoare triple {4955#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {4957#(= main_~i~0 0)} is VALID [2018-11-23 13:05:10,760 INFO L273 TraceCheckUtils]: 6: Hoare triple {4957#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4957#(= main_~i~0 0)} is VALID [2018-11-23 13:05:10,760 INFO L273 TraceCheckUtils]: 7: Hoare triple {4957#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4958#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:10,762 INFO L273 TraceCheckUtils]: 8: Hoare triple {4958#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4958#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:10,765 INFO L273 TraceCheckUtils]: 9: Hoare triple {4958#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4959#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:10,766 INFO L273 TraceCheckUtils]: 10: Hoare triple {4959#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4959#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:10,767 INFO L273 TraceCheckUtils]: 11: Hoare triple {4959#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4960#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:10,768 INFO L273 TraceCheckUtils]: 12: Hoare triple {4960#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4960#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:10,769 INFO L273 TraceCheckUtils]: 13: Hoare triple {4960#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4961#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:10,770 INFO L273 TraceCheckUtils]: 14: Hoare triple {4961#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4961#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:10,771 INFO L273 TraceCheckUtils]: 15: Hoare triple {4961#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4962#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:10,772 INFO L273 TraceCheckUtils]: 16: Hoare triple {4962#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4962#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:10,773 INFO L273 TraceCheckUtils]: 17: Hoare triple {4962#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4963#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:10,774 INFO L273 TraceCheckUtils]: 18: Hoare triple {4963#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4963#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:10,776 INFO L273 TraceCheckUtils]: 19: Hoare triple {4963#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4964#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:10,776 INFO L273 TraceCheckUtils]: 20: Hoare triple {4964#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4964#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:10,778 INFO L273 TraceCheckUtils]: 21: Hoare triple {4964#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4965#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:10,778 INFO L273 TraceCheckUtils]: 22: Hoare triple {4965#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4965#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:10,780 INFO L273 TraceCheckUtils]: 23: Hoare triple {4965#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4966#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:10,780 INFO L273 TraceCheckUtils]: 24: Hoare triple {4966#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4966#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:10,782 INFO L273 TraceCheckUtils]: 25: Hoare triple {4966#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4967#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:10,782 INFO L273 TraceCheckUtils]: 26: Hoare triple {4967#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4967#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:10,784 INFO L273 TraceCheckUtils]: 27: Hoare triple {4967#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4968#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:10,784 INFO L273 TraceCheckUtils]: 28: Hoare triple {4968#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4968#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:10,786 INFO L273 TraceCheckUtils]: 29: Hoare triple {4968#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4969#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:10,786 INFO L273 TraceCheckUtils]: 30: Hoare triple {4969#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4969#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:10,788 INFO L273 TraceCheckUtils]: 31: Hoare triple {4969#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4970#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:10,788 INFO L273 TraceCheckUtils]: 32: Hoare triple {4970#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4970#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:10,790 INFO L273 TraceCheckUtils]: 33: Hoare triple {4970#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4971#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:10,790 INFO L273 TraceCheckUtils]: 34: Hoare triple {4971#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4971#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:10,792 INFO L273 TraceCheckUtils]: 35: Hoare triple {4971#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4972#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:10,792 INFO L273 TraceCheckUtils]: 36: Hoare triple {4972#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4972#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:10,792 INFO L273 TraceCheckUtils]: 37: Hoare triple {4972#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4973#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:10,794 INFO L273 TraceCheckUtils]: 38: Hoare triple {4973#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4973#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:10,794 INFO L273 TraceCheckUtils]: 39: Hoare triple {4973#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4974#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:10,797 INFO L273 TraceCheckUtils]: 40: Hoare triple {4974#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4974#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:10,797 INFO L273 TraceCheckUtils]: 41: Hoare triple {4974#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4975#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:10,799 INFO L273 TraceCheckUtils]: 42: Hoare triple {4975#(<= main_~i~0 18)} assume !(~i~0 < 1024); {4956#false} is VALID [2018-11-23 13:05:10,799 INFO L273 TraceCheckUtils]: 43: Hoare triple {4956#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {4956#false} is VALID [2018-11-23 13:05:10,799 INFO L256 TraceCheckUtils]: 44: Hoare triple {4956#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {4956#false} is VALID [2018-11-23 13:05:10,799 INFO L273 TraceCheckUtils]: 45: Hoare triple {4956#false} ~cond := #in~cond; {4956#false} is VALID [2018-11-23 13:05:10,799 INFO L273 TraceCheckUtils]: 46: Hoare triple {4956#false} assume 0 == ~cond; {4956#false} is VALID [2018-11-23 13:05:10,799 INFO L273 TraceCheckUtils]: 47: Hoare triple {4956#false} assume !false; {4956#false} is VALID [2018-11-23 13:05:10,802 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:10,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:10,802 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 13:05:10,812 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:05:11,310 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 13:05:11,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:11,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:11,625 INFO L256 TraceCheckUtils]: 0: Hoare triple {4955#true} call ULTIMATE.init(); {4955#true} is VALID [2018-11-23 13:05:11,626 INFO L273 TraceCheckUtils]: 1: Hoare triple {4955#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4955#true} is VALID [2018-11-23 13:05:11,626 INFO L273 TraceCheckUtils]: 2: Hoare triple {4955#true} assume true; {4955#true} is VALID [2018-11-23 13:05:11,626 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4955#true} {4955#true} #35#return; {4955#true} is VALID [2018-11-23 13:05:11,626 INFO L256 TraceCheckUtils]: 4: Hoare triple {4955#true} call #t~ret2 := main(); {4955#true} is VALID [2018-11-23 13:05:11,627 INFO L273 TraceCheckUtils]: 5: Hoare triple {4955#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {4994#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:11,627 INFO L273 TraceCheckUtils]: 6: Hoare triple {4994#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4994#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:11,627 INFO L273 TraceCheckUtils]: 7: Hoare triple {4994#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4958#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:11,628 INFO L273 TraceCheckUtils]: 8: Hoare triple {4958#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4958#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:11,628 INFO L273 TraceCheckUtils]: 9: Hoare triple {4958#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4959#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:11,628 INFO L273 TraceCheckUtils]: 10: Hoare triple {4959#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4959#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:11,629 INFO L273 TraceCheckUtils]: 11: Hoare triple {4959#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4960#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:11,629 INFO L273 TraceCheckUtils]: 12: Hoare triple {4960#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4960#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:11,630 INFO L273 TraceCheckUtils]: 13: Hoare triple {4960#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4961#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:11,630 INFO L273 TraceCheckUtils]: 14: Hoare triple {4961#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4961#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:11,631 INFO L273 TraceCheckUtils]: 15: Hoare triple {4961#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4962#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:11,631 INFO L273 TraceCheckUtils]: 16: Hoare triple {4962#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4962#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:11,632 INFO L273 TraceCheckUtils]: 17: Hoare triple {4962#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4963#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:11,633 INFO L273 TraceCheckUtils]: 18: Hoare triple {4963#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4963#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:11,633 INFO L273 TraceCheckUtils]: 19: Hoare triple {4963#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4964#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:11,634 INFO L273 TraceCheckUtils]: 20: Hoare triple {4964#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4964#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:11,635 INFO L273 TraceCheckUtils]: 21: Hoare triple {4964#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4965#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:11,635 INFO L273 TraceCheckUtils]: 22: Hoare triple {4965#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4965#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:11,636 INFO L273 TraceCheckUtils]: 23: Hoare triple {4965#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4966#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:11,636 INFO L273 TraceCheckUtils]: 24: Hoare triple {4966#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4966#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:11,637 INFO L273 TraceCheckUtils]: 25: Hoare triple {4966#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4967#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:11,638 INFO L273 TraceCheckUtils]: 26: Hoare triple {4967#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4967#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:11,638 INFO L273 TraceCheckUtils]: 27: Hoare triple {4967#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4968#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:11,639 INFO L273 TraceCheckUtils]: 28: Hoare triple {4968#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4968#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:11,640 INFO L273 TraceCheckUtils]: 29: Hoare triple {4968#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4969#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:11,640 INFO L273 TraceCheckUtils]: 30: Hoare triple {4969#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4969#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:11,641 INFO L273 TraceCheckUtils]: 31: Hoare triple {4969#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4970#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:11,642 INFO L273 TraceCheckUtils]: 32: Hoare triple {4970#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4970#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:11,642 INFO L273 TraceCheckUtils]: 33: Hoare triple {4970#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4971#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:11,643 INFO L273 TraceCheckUtils]: 34: Hoare triple {4971#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4971#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:11,644 INFO L273 TraceCheckUtils]: 35: Hoare triple {4971#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4972#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:11,644 INFO L273 TraceCheckUtils]: 36: Hoare triple {4972#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4972#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:11,645 INFO L273 TraceCheckUtils]: 37: Hoare triple {4972#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4973#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:11,645 INFO L273 TraceCheckUtils]: 38: Hoare triple {4973#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4973#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:11,646 INFO L273 TraceCheckUtils]: 39: Hoare triple {4973#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4974#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:11,647 INFO L273 TraceCheckUtils]: 40: Hoare triple {4974#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4974#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:11,647 INFO L273 TraceCheckUtils]: 41: Hoare triple {4974#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4975#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:11,648 INFO L273 TraceCheckUtils]: 42: Hoare triple {4975#(<= main_~i~0 18)} assume !(~i~0 < 1024); {4956#false} is VALID [2018-11-23 13:05:11,648 INFO L273 TraceCheckUtils]: 43: Hoare triple {4956#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {4956#false} is VALID [2018-11-23 13:05:11,649 INFO L256 TraceCheckUtils]: 44: Hoare triple {4956#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {4956#false} is VALID [2018-11-23 13:05:11,649 INFO L273 TraceCheckUtils]: 45: Hoare triple {4956#false} ~cond := #in~cond; {4956#false} is VALID [2018-11-23 13:05:11,649 INFO L273 TraceCheckUtils]: 46: Hoare triple {4956#false} assume 0 == ~cond; {4956#false} is VALID [2018-11-23 13:05:11,649 INFO L273 TraceCheckUtils]: 47: Hoare triple {4956#false} assume !false; {4956#false} is VALID [2018-11-23 13:05:11,652 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:11,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:11,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 13:05:11,673 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2018-11-23 13:05:11,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:11,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 13:05:11,719 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 13:05:11,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 13:05:11,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 13:05:11,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:05:11,721 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 22 states. [2018-11-23 13:05:12,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:12,276 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-23 13:05:12,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 13:05:12,276 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2018-11-23 13:05:12,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:12,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:05:12,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 58 transitions. [2018-11-23 13:05:12,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:05:12,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 58 transitions. [2018-11-23 13:05:12,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 58 transitions. [2018-11-23 13:05:12,331 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:12,333 INFO L225 Difference]: With dead ends: 58 [2018-11-23 13:05:12,333 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 13:05:12,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:05:12,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 13:05:12,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-23 13:05:12,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:12,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 51 states. [2018-11-23 13:05:12,358 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 51 states. [2018-11-23 13:05:12,358 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 51 states. [2018-11-23 13:05:12,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:12,359 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-11-23 13:05:12,359 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-11-23 13:05:12,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:12,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:12,359 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 52 states. [2018-11-23 13:05:12,360 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 52 states. [2018-11-23 13:05:12,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:12,361 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-11-23 13:05:12,361 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-11-23 13:05:12,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:12,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:12,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:12,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:12,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 13:05:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-11-23 13:05:12,363 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-11-23 13:05:12,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:12,363 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-11-23 13:05:12,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 13:05:12,363 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-11-23 13:05:12,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 13:05:12,364 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:12,364 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:12,364 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:12,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:12,365 INFO L82 PathProgramCache]: Analyzing trace with hash 2061892515, now seen corresponding path program 19 times [2018-11-23 13:05:12,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:12,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:12,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:12,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:12,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:12,704 INFO L256 TraceCheckUtils]: 0: Hoare triple {5387#true} call ULTIMATE.init(); {5387#true} is VALID [2018-11-23 13:05:12,704 INFO L273 TraceCheckUtils]: 1: Hoare triple {5387#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5387#true} is VALID [2018-11-23 13:05:12,705 INFO L273 TraceCheckUtils]: 2: Hoare triple {5387#true} assume true; {5387#true} is VALID [2018-11-23 13:05:12,705 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5387#true} {5387#true} #35#return; {5387#true} is VALID [2018-11-23 13:05:12,705 INFO L256 TraceCheckUtils]: 4: Hoare triple {5387#true} call #t~ret2 := main(); {5387#true} is VALID [2018-11-23 13:05:12,722 INFO L273 TraceCheckUtils]: 5: Hoare triple {5387#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {5389#(= main_~i~0 0)} is VALID [2018-11-23 13:05:12,731 INFO L273 TraceCheckUtils]: 6: Hoare triple {5389#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5389#(= main_~i~0 0)} is VALID [2018-11-23 13:05:12,746 INFO L273 TraceCheckUtils]: 7: Hoare triple {5389#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5390#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:12,749 INFO L273 TraceCheckUtils]: 8: Hoare triple {5390#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5390#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:12,749 INFO L273 TraceCheckUtils]: 9: Hoare triple {5390#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5391#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:12,750 INFO L273 TraceCheckUtils]: 10: Hoare triple {5391#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5391#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:12,750 INFO L273 TraceCheckUtils]: 11: Hoare triple {5391#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5392#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:12,751 INFO L273 TraceCheckUtils]: 12: Hoare triple {5392#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5392#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:12,751 INFO L273 TraceCheckUtils]: 13: Hoare triple {5392#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5393#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:12,752 INFO L273 TraceCheckUtils]: 14: Hoare triple {5393#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5393#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:12,752 INFO L273 TraceCheckUtils]: 15: Hoare triple {5393#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5394#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:12,752 INFO L273 TraceCheckUtils]: 16: Hoare triple {5394#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5394#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:12,753 INFO L273 TraceCheckUtils]: 17: Hoare triple {5394#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5395#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:12,753 INFO L273 TraceCheckUtils]: 18: Hoare triple {5395#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5395#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:12,754 INFO L273 TraceCheckUtils]: 19: Hoare triple {5395#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5396#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:12,755 INFO L273 TraceCheckUtils]: 20: Hoare triple {5396#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5396#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:12,756 INFO L273 TraceCheckUtils]: 21: Hoare triple {5396#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5397#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:12,756 INFO L273 TraceCheckUtils]: 22: Hoare triple {5397#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5397#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:12,757 INFO L273 TraceCheckUtils]: 23: Hoare triple {5397#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5398#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:12,758 INFO L273 TraceCheckUtils]: 24: Hoare triple {5398#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5398#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:12,759 INFO L273 TraceCheckUtils]: 25: Hoare triple {5398#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5399#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:12,759 INFO L273 TraceCheckUtils]: 26: Hoare triple {5399#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5399#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:12,760 INFO L273 TraceCheckUtils]: 27: Hoare triple {5399#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5400#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:12,761 INFO L273 TraceCheckUtils]: 28: Hoare triple {5400#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5400#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:12,762 INFO L273 TraceCheckUtils]: 29: Hoare triple {5400#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5401#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:12,762 INFO L273 TraceCheckUtils]: 30: Hoare triple {5401#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5401#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:12,763 INFO L273 TraceCheckUtils]: 31: Hoare triple {5401#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5402#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:12,764 INFO L273 TraceCheckUtils]: 32: Hoare triple {5402#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5402#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:12,765 INFO L273 TraceCheckUtils]: 33: Hoare triple {5402#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5403#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:12,765 INFO L273 TraceCheckUtils]: 34: Hoare triple {5403#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5403#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:12,766 INFO L273 TraceCheckUtils]: 35: Hoare triple {5403#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5404#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:12,767 INFO L273 TraceCheckUtils]: 36: Hoare triple {5404#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5404#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:12,768 INFO L273 TraceCheckUtils]: 37: Hoare triple {5404#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5405#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:12,768 INFO L273 TraceCheckUtils]: 38: Hoare triple {5405#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5405#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:12,769 INFO L273 TraceCheckUtils]: 39: Hoare triple {5405#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5406#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:12,770 INFO L273 TraceCheckUtils]: 40: Hoare triple {5406#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5406#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:12,771 INFO L273 TraceCheckUtils]: 41: Hoare triple {5406#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5407#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:12,771 INFO L273 TraceCheckUtils]: 42: Hoare triple {5407#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5407#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:12,772 INFO L273 TraceCheckUtils]: 43: Hoare triple {5407#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5408#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:12,773 INFO L273 TraceCheckUtils]: 44: Hoare triple {5408#(<= main_~i~0 19)} assume !(~i~0 < 1024); {5388#false} is VALID [2018-11-23 13:05:12,773 INFO L273 TraceCheckUtils]: 45: Hoare triple {5388#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {5388#false} is VALID [2018-11-23 13:05:12,773 INFO L256 TraceCheckUtils]: 46: Hoare triple {5388#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {5388#false} is VALID [2018-11-23 13:05:12,774 INFO L273 TraceCheckUtils]: 47: Hoare triple {5388#false} ~cond := #in~cond; {5388#false} is VALID [2018-11-23 13:05:12,774 INFO L273 TraceCheckUtils]: 48: Hoare triple {5388#false} assume 0 == ~cond; {5388#false} is VALID [2018-11-23 13:05:12,774 INFO L273 TraceCheckUtils]: 49: Hoare triple {5388#false} assume !false; {5388#false} is VALID [2018-11-23 13:05:12,778 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:12,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:12,778 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 13:05:12,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:12,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:12,983 INFO L256 TraceCheckUtils]: 0: Hoare triple {5387#true} call ULTIMATE.init(); {5387#true} is VALID [2018-11-23 13:05:12,984 INFO L273 TraceCheckUtils]: 1: Hoare triple {5387#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5387#true} is VALID [2018-11-23 13:05:12,984 INFO L273 TraceCheckUtils]: 2: Hoare triple {5387#true} assume true; {5387#true} is VALID [2018-11-23 13:05:12,984 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5387#true} {5387#true} #35#return; {5387#true} is VALID [2018-11-23 13:05:12,984 INFO L256 TraceCheckUtils]: 4: Hoare triple {5387#true} call #t~ret2 := main(); {5387#true} is VALID [2018-11-23 13:05:12,985 INFO L273 TraceCheckUtils]: 5: Hoare triple {5387#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {5427#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:12,986 INFO L273 TraceCheckUtils]: 6: Hoare triple {5427#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5427#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:12,987 INFO L273 TraceCheckUtils]: 7: Hoare triple {5427#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5390#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:12,987 INFO L273 TraceCheckUtils]: 8: Hoare triple {5390#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5390#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:12,988 INFO L273 TraceCheckUtils]: 9: Hoare triple {5390#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5391#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:12,988 INFO L273 TraceCheckUtils]: 10: Hoare triple {5391#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5391#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:12,989 INFO L273 TraceCheckUtils]: 11: Hoare triple {5391#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5392#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:12,989 INFO L273 TraceCheckUtils]: 12: Hoare triple {5392#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5392#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:12,990 INFO L273 TraceCheckUtils]: 13: Hoare triple {5392#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5393#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:12,991 INFO L273 TraceCheckUtils]: 14: Hoare triple {5393#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5393#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:12,991 INFO L273 TraceCheckUtils]: 15: Hoare triple {5393#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5394#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:12,992 INFO L273 TraceCheckUtils]: 16: Hoare triple {5394#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5394#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:12,993 INFO L273 TraceCheckUtils]: 17: Hoare triple {5394#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5395#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:12,994 INFO L273 TraceCheckUtils]: 18: Hoare triple {5395#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5395#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:12,994 INFO L273 TraceCheckUtils]: 19: Hoare triple {5395#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5396#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:12,995 INFO L273 TraceCheckUtils]: 20: Hoare triple {5396#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5396#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:12,996 INFO L273 TraceCheckUtils]: 21: Hoare triple {5396#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5397#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:12,997 INFO L273 TraceCheckUtils]: 22: Hoare triple {5397#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5397#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:12,997 INFO L273 TraceCheckUtils]: 23: Hoare triple {5397#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5398#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:12,998 INFO L273 TraceCheckUtils]: 24: Hoare triple {5398#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5398#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:12,999 INFO L273 TraceCheckUtils]: 25: Hoare triple {5398#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5399#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:12,999 INFO L273 TraceCheckUtils]: 26: Hoare triple {5399#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5399#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:13,000 INFO L273 TraceCheckUtils]: 27: Hoare triple {5399#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5400#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:13,001 INFO L273 TraceCheckUtils]: 28: Hoare triple {5400#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5400#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:13,002 INFO L273 TraceCheckUtils]: 29: Hoare triple {5400#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5401#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:13,002 INFO L273 TraceCheckUtils]: 30: Hoare triple {5401#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5401#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:13,003 INFO L273 TraceCheckUtils]: 31: Hoare triple {5401#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5402#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:13,004 INFO L273 TraceCheckUtils]: 32: Hoare triple {5402#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5402#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:13,005 INFO L273 TraceCheckUtils]: 33: Hoare triple {5402#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5403#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:13,005 INFO L273 TraceCheckUtils]: 34: Hoare triple {5403#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5403#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:13,006 INFO L273 TraceCheckUtils]: 35: Hoare triple {5403#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5404#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:13,007 INFO L273 TraceCheckUtils]: 36: Hoare triple {5404#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5404#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:13,008 INFO L273 TraceCheckUtils]: 37: Hoare triple {5404#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5405#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:13,008 INFO L273 TraceCheckUtils]: 38: Hoare triple {5405#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5405#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:13,009 INFO L273 TraceCheckUtils]: 39: Hoare triple {5405#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5406#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:13,010 INFO L273 TraceCheckUtils]: 40: Hoare triple {5406#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5406#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:13,011 INFO L273 TraceCheckUtils]: 41: Hoare triple {5406#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5407#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:13,011 INFO L273 TraceCheckUtils]: 42: Hoare triple {5407#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5407#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:13,012 INFO L273 TraceCheckUtils]: 43: Hoare triple {5407#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5408#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:13,013 INFO L273 TraceCheckUtils]: 44: Hoare triple {5408#(<= main_~i~0 19)} assume !(~i~0 < 1024); {5388#false} is VALID [2018-11-23 13:05:13,013 INFO L273 TraceCheckUtils]: 45: Hoare triple {5388#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {5388#false} is VALID [2018-11-23 13:05:13,014 INFO L256 TraceCheckUtils]: 46: Hoare triple {5388#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {5388#false} is VALID [2018-11-23 13:05:13,014 INFO L273 TraceCheckUtils]: 47: Hoare triple {5388#false} ~cond := #in~cond; {5388#false} is VALID [2018-11-23 13:05:13,014 INFO L273 TraceCheckUtils]: 48: Hoare triple {5388#false} assume 0 == ~cond; {5388#false} is VALID [2018-11-23 13:05:13,014 INFO L273 TraceCheckUtils]: 49: Hoare triple {5388#false} assume !false; {5388#false} is VALID [2018-11-23 13:05:13,019 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:13,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:13,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 13:05:13,038 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2018-11-23 13:05:13,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:13,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 13:05:13,114 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 13:05:13,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 13:05:13,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 13:05:13,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:05:13,116 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 23 states. [2018-11-23 13:05:13,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:13,312 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-23 13:05:13,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 13:05:13,312 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2018-11-23 13:05:13,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:13,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:05:13,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 60 transitions. [2018-11-23 13:05:13,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:05:13,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 60 transitions. [2018-11-23 13:05:13,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 60 transitions. [2018-11-23 13:05:13,384 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 13:05:13,386 INFO L225 Difference]: With dead ends: 60 [2018-11-23 13:05:13,386 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 13:05:13,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:05:13,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 13:05:13,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-11-23 13:05:13,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:13,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 53 states. [2018-11-23 13:05:13,442 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 53 states. [2018-11-23 13:05:13,442 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 53 states. [2018-11-23 13:05:13,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:13,443 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-23 13:05:13,443 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-23 13:05:13,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:13,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:13,444 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 54 states. [2018-11-23 13:05:13,444 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 54 states. [2018-11-23 13:05:13,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:13,445 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-23 13:05:13,445 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-23 13:05:13,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:13,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:13,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:13,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:13,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 13:05:13,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-11-23 13:05:13,447 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-11-23 13:05:13,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:13,447 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-11-23 13:05:13,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 13:05:13,448 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-11-23 13:05:13,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 13:05:13,448 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:13,448 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:13,448 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:13,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:13,449 INFO L82 PathProgramCache]: Analyzing trace with hash 658061765, now seen corresponding path program 20 times [2018-11-23 13:05:13,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:13,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:13,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:13,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:13,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:14,035 INFO L256 TraceCheckUtils]: 0: Hoare triple {5836#true} call ULTIMATE.init(); {5836#true} is VALID [2018-11-23 13:05:14,036 INFO L273 TraceCheckUtils]: 1: Hoare triple {5836#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5836#true} is VALID [2018-11-23 13:05:14,036 INFO L273 TraceCheckUtils]: 2: Hoare triple {5836#true} assume true; {5836#true} is VALID [2018-11-23 13:05:14,036 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5836#true} {5836#true} #35#return; {5836#true} is VALID [2018-11-23 13:05:14,036 INFO L256 TraceCheckUtils]: 4: Hoare triple {5836#true} call #t~ret2 := main(); {5836#true} is VALID [2018-11-23 13:05:14,037 INFO L273 TraceCheckUtils]: 5: Hoare triple {5836#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {5838#(= main_~i~0 0)} is VALID [2018-11-23 13:05:14,037 INFO L273 TraceCheckUtils]: 6: Hoare triple {5838#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5838#(= main_~i~0 0)} is VALID [2018-11-23 13:05:14,038 INFO L273 TraceCheckUtils]: 7: Hoare triple {5838#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5839#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:14,038 INFO L273 TraceCheckUtils]: 8: Hoare triple {5839#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5839#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:14,039 INFO L273 TraceCheckUtils]: 9: Hoare triple {5839#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5840#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:14,039 INFO L273 TraceCheckUtils]: 10: Hoare triple {5840#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5840#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:14,060 INFO L273 TraceCheckUtils]: 11: Hoare triple {5840#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5841#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:14,075 INFO L273 TraceCheckUtils]: 12: Hoare triple {5841#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5841#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:14,084 INFO L273 TraceCheckUtils]: 13: Hoare triple {5841#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5842#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:14,097 INFO L273 TraceCheckUtils]: 14: Hoare triple {5842#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5842#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:14,106 INFO L273 TraceCheckUtils]: 15: Hoare triple {5842#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5843#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:14,120 INFO L273 TraceCheckUtils]: 16: Hoare triple {5843#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5843#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:14,129 INFO L273 TraceCheckUtils]: 17: Hoare triple {5843#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5844#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:14,144 INFO L273 TraceCheckUtils]: 18: Hoare triple {5844#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5844#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:14,153 INFO L273 TraceCheckUtils]: 19: Hoare triple {5844#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5845#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:14,167 INFO L273 TraceCheckUtils]: 20: Hoare triple {5845#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5845#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:14,176 INFO L273 TraceCheckUtils]: 21: Hoare triple {5845#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5846#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:14,188 INFO L273 TraceCheckUtils]: 22: Hoare triple {5846#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5846#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:14,201 INFO L273 TraceCheckUtils]: 23: Hoare triple {5846#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5847#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:14,213 INFO L273 TraceCheckUtils]: 24: Hoare triple {5847#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5847#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:14,218 INFO L273 TraceCheckUtils]: 25: Hoare triple {5847#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5848#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:14,218 INFO L273 TraceCheckUtils]: 26: Hoare triple {5848#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5848#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:14,220 INFO L273 TraceCheckUtils]: 27: Hoare triple {5848#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5849#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:14,220 INFO L273 TraceCheckUtils]: 28: Hoare triple {5849#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5849#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:14,222 INFO L273 TraceCheckUtils]: 29: Hoare triple {5849#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5850#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:14,222 INFO L273 TraceCheckUtils]: 30: Hoare triple {5850#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5850#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:14,224 INFO L273 TraceCheckUtils]: 31: Hoare triple {5850#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5851#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:14,224 INFO L273 TraceCheckUtils]: 32: Hoare triple {5851#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5851#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:14,226 INFO L273 TraceCheckUtils]: 33: Hoare triple {5851#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5852#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:14,226 INFO L273 TraceCheckUtils]: 34: Hoare triple {5852#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5852#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:14,226 INFO L273 TraceCheckUtils]: 35: Hoare triple {5852#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5853#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:14,227 INFO L273 TraceCheckUtils]: 36: Hoare triple {5853#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5853#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:14,227 INFO L273 TraceCheckUtils]: 37: Hoare triple {5853#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5854#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:14,227 INFO L273 TraceCheckUtils]: 38: Hoare triple {5854#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5854#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:14,228 INFO L273 TraceCheckUtils]: 39: Hoare triple {5854#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5855#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:14,228 INFO L273 TraceCheckUtils]: 40: Hoare triple {5855#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5855#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:14,229 INFO L273 TraceCheckUtils]: 41: Hoare triple {5855#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5856#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:14,229 INFO L273 TraceCheckUtils]: 42: Hoare triple {5856#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5856#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:14,230 INFO L273 TraceCheckUtils]: 43: Hoare triple {5856#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5857#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:14,230 INFO L273 TraceCheckUtils]: 44: Hoare triple {5857#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5857#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:14,231 INFO L273 TraceCheckUtils]: 45: Hoare triple {5857#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5858#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:14,232 INFO L273 TraceCheckUtils]: 46: Hoare triple {5858#(<= main_~i~0 20)} assume !(~i~0 < 1024); {5837#false} is VALID [2018-11-23 13:05:14,232 INFO L273 TraceCheckUtils]: 47: Hoare triple {5837#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {5837#false} is VALID [2018-11-23 13:05:14,232 INFO L256 TraceCheckUtils]: 48: Hoare triple {5837#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {5837#false} is VALID [2018-11-23 13:05:14,232 INFO L273 TraceCheckUtils]: 49: Hoare triple {5837#false} ~cond := #in~cond; {5837#false} is VALID [2018-11-23 13:05:14,233 INFO L273 TraceCheckUtils]: 50: Hoare triple {5837#false} assume 0 == ~cond; {5837#false} is VALID [2018-11-23 13:05:14,233 INFO L273 TraceCheckUtils]: 51: Hoare triple {5837#false} assume !false; {5837#false} is VALID [2018-11-23 13:05:14,236 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:14,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:14,236 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 13:05:14,248 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:05:14,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:05:14,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:14,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:14,442 INFO L256 TraceCheckUtils]: 0: Hoare triple {5836#true} call ULTIMATE.init(); {5836#true} is VALID [2018-11-23 13:05:14,442 INFO L273 TraceCheckUtils]: 1: Hoare triple {5836#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5836#true} is VALID [2018-11-23 13:05:14,442 INFO L273 TraceCheckUtils]: 2: Hoare triple {5836#true} assume true; {5836#true} is VALID [2018-11-23 13:05:14,443 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5836#true} {5836#true} #35#return; {5836#true} is VALID [2018-11-23 13:05:14,443 INFO L256 TraceCheckUtils]: 4: Hoare triple {5836#true} call #t~ret2 := main(); {5836#true} is VALID [2018-11-23 13:05:14,444 INFO L273 TraceCheckUtils]: 5: Hoare triple {5836#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {5877#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:14,444 INFO L273 TraceCheckUtils]: 6: Hoare triple {5877#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5877#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:14,444 INFO L273 TraceCheckUtils]: 7: Hoare triple {5877#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5839#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:14,445 INFO L273 TraceCheckUtils]: 8: Hoare triple {5839#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5839#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:14,445 INFO L273 TraceCheckUtils]: 9: Hoare triple {5839#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5840#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:14,445 INFO L273 TraceCheckUtils]: 10: Hoare triple {5840#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5840#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:14,446 INFO L273 TraceCheckUtils]: 11: Hoare triple {5840#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5841#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:14,446 INFO L273 TraceCheckUtils]: 12: Hoare triple {5841#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5841#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:14,447 INFO L273 TraceCheckUtils]: 13: Hoare triple {5841#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5842#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:14,447 INFO L273 TraceCheckUtils]: 14: Hoare triple {5842#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5842#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:14,448 INFO L273 TraceCheckUtils]: 15: Hoare triple {5842#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5843#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:14,449 INFO L273 TraceCheckUtils]: 16: Hoare triple {5843#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5843#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:14,449 INFO L273 TraceCheckUtils]: 17: Hoare triple {5843#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5844#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:14,450 INFO L273 TraceCheckUtils]: 18: Hoare triple {5844#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5844#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:14,450 INFO L273 TraceCheckUtils]: 19: Hoare triple {5844#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5845#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:14,451 INFO L273 TraceCheckUtils]: 20: Hoare triple {5845#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5845#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:14,452 INFO L273 TraceCheckUtils]: 21: Hoare triple {5845#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5846#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:14,452 INFO L273 TraceCheckUtils]: 22: Hoare triple {5846#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5846#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:14,453 INFO L273 TraceCheckUtils]: 23: Hoare triple {5846#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5847#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:14,453 INFO L273 TraceCheckUtils]: 24: Hoare triple {5847#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5847#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:14,454 INFO L273 TraceCheckUtils]: 25: Hoare triple {5847#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5848#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:14,455 INFO L273 TraceCheckUtils]: 26: Hoare triple {5848#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5848#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:14,455 INFO L273 TraceCheckUtils]: 27: Hoare triple {5848#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5849#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:14,456 INFO L273 TraceCheckUtils]: 28: Hoare triple {5849#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5849#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:14,456 INFO L273 TraceCheckUtils]: 29: Hoare triple {5849#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5850#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:14,457 INFO L273 TraceCheckUtils]: 30: Hoare triple {5850#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5850#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:14,458 INFO L273 TraceCheckUtils]: 31: Hoare triple {5850#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5851#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:14,458 INFO L273 TraceCheckUtils]: 32: Hoare triple {5851#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5851#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:14,459 INFO L273 TraceCheckUtils]: 33: Hoare triple {5851#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5852#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:14,459 INFO L273 TraceCheckUtils]: 34: Hoare triple {5852#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5852#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:14,460 INFO L273 TraceCheckUtils]: 35: Hoare triple {5852#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5853#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:14,461 INFO L273 TraceCheckUtils]: 36: Hoare triple {5853#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5853#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:14,461 INFO L273 TraceCheckUtils]: 37: Hoare triple {5853#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5854#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:14,462 INFO L273 TraceCheckUtils]: 38: Hoare triple {5854#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5854#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:14,463 INFO L273 TraceCheckUtils]: 39: Hoare triple {5854#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5855#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:14,463 INFO L273 TraceCheckUtils]: 40: Hoare triple {5855#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5855#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:14,464 INFO L273 TraceCheckUtils]: 41: Hoare triple {5855#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5856#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:14,464 INFO L273 TraceCheckUtils]: 42: Hoare triple {5856#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5856#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:14,465 INFO L273 TraceCheckUtils]: 43: Hoare triple {5856#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5857#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:14,466 INFO L273 TraceCheckUtils]: 44: Hoare triple {5857#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5857#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:14,466 INFO L273 TraceCheckUtils]: 45: Hoare triple {5857#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5858#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:14,467 INFO L273 TraceCheckUtils]: 46: Hoare triple {5858#(<= main_~i~0 20)} assume !(~i~0 < 1024); {5837#false} is VALID [2018-11-23 13:05:14,467 INFO L273 TraceCheckUtils]: 47: Hoare triple {5837#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {5837#false} is VALID [2018-11-23 13:05:14,467 INFO L256 TraceCheckUtils]: 48: Hoare triple {5837#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {5837#false} is VALID [2018-11-23 13:05:14,468 INFO L273 TraceCheckUtils]: 49: Hoare triple {5837#false} ~cond := #in~cond; {5837#false} is VALID [2018-11-23 13:05:14,468 INFO L273 TraceCheckUtils]: 50: Hoare triple {5837#false} assume 0 == ~cond; {5837#false} is VALID [2018-11-23 13:05:14,468 INFO L273 TraceCheckUtils]: 51: Hoare triple {5837#false} assume !false; {5837#false} is VALID [2018-11-23 13:05:14,471 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:14,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:14,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 13:05:14,497 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 52 [2018-11-23 13:05:14,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:14,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 13:05:14,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:14,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 13:05:14,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 13:05:14,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 13:05:14,550 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 24 states. [2018-11-23 13:05:14,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:14,708 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-11-23 13:05:14,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 13:05:14,708 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 52 [2018-11-23 13:05:14,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:14,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:05:14,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 62 transitions. [2018-11-23 13:05:14,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:05:14,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 62 transitions. [2018-11-23 13:05:14,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 62 transitions. [2018-11-23 13:05:15,182 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 13:05:15,184 INFO L225 Difference]: With dead ends: 62 [2018-11-23 13:05:15,184 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 13:05:15,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 13:05:15,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 13:05:15,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-11-23 13:05:15,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:15,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 55 states. [2018-11-23 13:05:15,210 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 55 states. [2018-11-23 13:05:15,210 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 55 states. [2018-11-23 13:05:15,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:15,211 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-11-23 13:05:15,211 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-23 13:05:15,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:15,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:15,212 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 56 states. [2018-11-23 13:05:15,212 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 56 states. [2018-11-23 13:05:15,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:15,212 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-11-23 13:05:15,213 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-23 13:05:15,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:15,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:15,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:15,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:15,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 13:05:15,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-11-23 13:05:15,214 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-11-23 13:05:15,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:15,215 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-11-23 13:05:15,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 13:05:15,215 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-11-23 13:05:15,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 13:05:15,215 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:15,215 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:15,216 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:15,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:15,216 INFO L82 PathProgramCache]: Analyzing trace with hash 196441959, now seen corresponding path program 21 times [2018-11-23 13:05:15,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:15,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:15,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:15,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:15,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:16,352 INFO L256 TraceCheckUtils]: 0: Hoare triple {6302#true} call ULTIMATE.init(); {6302#true} is VALID [2018-11-23 13:05:16,353 INFO L273 TraceCheckUtils]: 1: Hoare triple {6302#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6302#true} is VALID [2018-11-23 13:05:16,353 INFO L273 TraceCheckUtils]: 2: Hoare triple {6302#true} assume true; {6302#true} is VALID [2018-11-23 13:05:16,353 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6302#true} {6302#true} #35#return; {6302#true} is VALID [2018-11-23 13:05:16,353 INFO L256 TraceCheckUtils]: 4: Hoare triple {6302#true} call #t~ret2 := main(); {6302#true} is VALID [2018-11-23 13:05:16,354 INFO L273 TraceCheckUtils]: 5: Hoare triple {6302#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {6304#(= main_~i~0 0)} is VALID [2018-11-23 13:05:16,354 INFO L273 TraceCheckUtils]: 6: Hoare triple {6304#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6304#(= main_~i~0 0)} is VALID [2018-11-23 13:05:16,355 INFO L273 TraceCheckUtils]: 7: Hoare triple {6304#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6305#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:16,355 INFO L273 TraceCheckUtils]: 8: Hoare triple {6305#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6305#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:16,356 INFO L273 TraceCheckUtils]: 9: Hoare triple {6305#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6306#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:16,356 INFO L273 TraceCheckUtils]: 10: Hoare triple {6306#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6306#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:16,357 INFO L273 TraceCheckUtils]: 11: Hoare triple {6306#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6307#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:16,357 INFO L273 TraceCheckUtils]: 12: Hoare triple {6307#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6307#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:16,358 INFO L273 TraceCheckUtils]: 13: Hoare triple {6307#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6308#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:16,358 INFO L273 TraceCheckUtils]: 14: Hoare triple {6308#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6308#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:16,359 INFO L273 TraceCheckUtils]: 15: Hoare triple {6308#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6309#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:16,359 INFO L273 TraceCheckUtils]: 16: Hoare triple {6309#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6309#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:16,360 INFO L273 TraceCheckUtils]: 17: Hoare triple {6309#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6310#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:16,361 INFO L273 TraceCheckUtils]: 18: Hoare triple {6310#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6310#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:16,361 INFO L273 TraceCheckUtils]: 19: Hoare triple {6310#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6311#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:16,362 INFO L273 TraceCheckUtils]: 20: Hoare triple {6311#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6311#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:16,363 INFO L273 TraceCheckUtils]: 21: Hoare triple {6311#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6312#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:16,363 INFO L273 TraceCheckUtils]: 22: Hoare triple {6312#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6312#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:16,364 INFO L273 TraceCheckUtils]: 23: Hoare triple {6312#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6313#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:16,364 INFO L273 TraceCheckUtils]: 24: Hoare triple {6313#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6313#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:16,365 INFO L273 TraceCheckUtils]: 25: Hoare triple {6313#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6314#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:16,366 INFO L273 TraceCheckUtils]: 26: Hoare triple {6314#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6314#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:16,366 INFO L273 TraceCheckUtils]: 27: Hoare triple {6314#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6315#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:16,367 INFO L273 TraceCheckUtils]: 28: Hoare triple {6315#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6315#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:16,368 INFO L273 TraceCheckUtils]: 29: Hoare triple {6315#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6316#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:16,368 INFO L273 TraceCheckUtils]: 30: Hoare triple {6316#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6316#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:16,369 INFO L273 TraceCheckUtils]: 31: Hoare triple {6316#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6317#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:16,370 INFO L273 TraceCheckUtils]: 32: Hoare triple {6317#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6317#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:16,370 INFO L273 TraceCheckUtils]: 33: Hoare triple {6317#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6318#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:16,371 INFO L273 TraceCheckUtils]: 34: Hoare triple {6318#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6318#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:16,372 INFO L273 TraceCheckUtils]: 35: Hoare triple {6318#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6319#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:16,372 INFO L273 TraceCheckUtils]: 36: Hoare triple {6319#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6319#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:16,373 INFO L273 TraceCheckUtils]: 37: Hoare triple {6319#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6320#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:16,373 INFO L273 TraceCheckUtils]: 38: Hoare triple {6320#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6320#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:16,374 INFO L273 TraceCheckUtils]: 39: Hoare triple {6320#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6321#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:16,375 INFO L273 TraceCheckUtils]: 40: Hoare triple {6321#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6321#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:16,375 INFO L273 TraceCheckUtils]: 41: Hoare triple {6321#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6322#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:16,376 INFO L273 TraceCheckUtils]: 42: Hoare triple {6322#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6322#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:16,377 INFO L273 TraceCheckUtils]: 43: Hoare triple {6322#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6323#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:16,377 INFO L273 TraceCheckUtils]: 44: Hoare triple {6323#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6323#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:16,378 INFO L273 TraceCheckUtils]: 45: Hoare triple {6323#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6324#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:16,378 INFO L273 TraceCheckUtils]: 46: Hoare triple {6324#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6324#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:16,379 INFO L273 TraceCheckUtils]: 47: Hoare triple {6324#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6325#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:16,380 INFO L273 TraceCheckUtils]: 48: Hoare triple {6325#(<= main_~i~0 21)} assume !(~i~0 < 1024); {6303#false} is VALID [2018-11-23 13:05:16,380 INFO L273 TraceCheckUtils]: 49: Hoare triple {6303#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {6303#false} is VALID [2018-11-23 13:05:16,380 INFO L256 TraceCheckUtils]: 50: Hoare triple {6303#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {6303#false} is VALID [2018-11-23 13:05:16,381 INFO L273 TraceCheckUtils]: 51: Hoare triple {6303#false} ~cond := #in~cond; {6303#false} is VALID [2018-11-23 13:05:16,381 INFO L273 TraceCheckUtils]: 52: Hoare triple {6303#false} assume 0 == ~cond; {6303#false} is VALID [2018-11-23 13:05:16,381 INFO L273 TraceCheckUtils]: 53: Hoare triple {6303#false} assume !false; {6303#false} is VALID [2018-11-23 13:05:16,384 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:16,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:16,385 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 13:05:16,393 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:05:16,748 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-23 13:05:16,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:16,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:16,914 INFO L256 TraceCheckUtils]: 0: Hoare triple {6302#true} call ULTIMATE.init(); {6302#true} is VALID [2018-11-23 13:05:16,915 INFO L273 TraceCheckUtils]: 1: Hoare triple {6302#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6302#true} is VALID [2018-11-23 13:05:16,915 INFO L273 TraceCheckUtils]: 2: Hoare triple {6302#true} assume true; {6302#true} is VALID [2018-11-23 13:05:16,915 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6302#true} {6302#true} #35#return; {6302#true} is VALID [2018-11-23 13:05:16,915 INFO L256 TraceCheckUtils]: 4: Hoare triple {6302#true} call #t~ret2 := main(); {6302#true} is VALID [2018-11-23 13:05:16,916 INFO L273 TraceCheckUtils]: 5: Hoare triple {6302#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {6344#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:16,916 INFO L273 TraceCheckUtils]: 6: Hoare triple {6344#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6344#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:16,917 INFO L273 TraceCheckUtils]: 7: Hoare triple {6344#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6305#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:16,918 INFO L273 TraceCheckUtils]: 8: Hoare triple {6305#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6305#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:16,918 INFO L273 TraceCheckUtils]: 9: Hoare triple {6305#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6306#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:16,919 INFO L273 TraceCheckUtils]: 10: Hoare triple {6306#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6306#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:16,919 INFO L273 TraceCheckUtils]: 11: Hoare triple {6306#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6307#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:16,920 INFO L273 TraceCheckUtils]: 12: Hoare triple {6307#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6307#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:16,920 INFO L273 TraceCheckUtils]: 13: Hoare triple {6307#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6308#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:16,921 INFO L273 TraceCheckUtils]: 14: Hoare triple {6308#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6308#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:16,922 INFO L273 TraceCheckUtils]: 15: Hoare triple {6308#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6309#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:16,922 INFO L273 TraceCheckUtils]: 16: Hoare triple {6309#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6309#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:16,923 INFO L273 TraceCheckUtils]: 17: Hoare triple {6309#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6310#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:16,923 INFO L273 TraceCheckUtils]: 18: Hoare triple {6310#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6310#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:16,924 INFO L273 TraceCheckUtils]: 19: Hoare triple {6310#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6311#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:16,925 INFO L273 TraceCheckUtils]: 20: Hoare triple {6311#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6311#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:16,925 INFO L273 TraceCheckUtils]: 21: Hoare triple {6311#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6312#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:16,926 INFO L273 TraceCheckUtils]: 22: Hoare triple {6312#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6312#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:16,927 INFO L273 TraceCheckUtils]: 23: Hoare triple {6312#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6313#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:16,927 INFO L273 TraceCheckUtils]: 24: Hoare triple {6313#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6313#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:16,928 INFO L273 TraceCheckUtils]: 25: Hoare triple {6313#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6314#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:16,928 INFO L273 TraceCheckUtils]: 26: Hoare triple {6314#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6314#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:16,929 INFO L273 TraceCheckUtils]: 27: Hoare triple {6314#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6315#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:16,930 INFO L273 TraceCheckUtils]: 28: Hoare triple {6315#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6315#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:16,931 INFO L273 TraceCheckUtils]: 29: Hoare triple {6315#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6316#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:16,931 INFO L273 TraceCheckUtils]: 30: Hoare triple {6316#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6316#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:16,932 INFO L273 TraceCheckUtils]: 31: Hoare triple {6316#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6317#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:16,932 INFO L273 TraceCheckUtils]: 32: Hoare triple {6317#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6317#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:16,933 INFO L273 TraceCheckUtils]: 33: Hoare triple {6317#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6318#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:16,934 INFO L273 TraceCheckUtils]: 34: Hoare triple {6318#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6318#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:16,934 INFO L273 TraceCheckUtils]: 35: Hoare triple {6318#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6319#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:16,935 INFO L273 TraceCheckUtils]: 36: Hoare triple {6319#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6319#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:16,936 INFO L273 TraceCheckUtils]: 37: Hoare triple {6319#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6320#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:16,936 INFO L273 TraceCheckUtils]: 38: Hoare triple {6320#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6320#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:16,937 INFO L273 TraceCheckUtils]: 39: Hoare triple {6320#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6321#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:16,937 INFO L273 TraceCheckUtils]: 40: Hoare triple {6321#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6321#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:16,938 INFO L273 TraceCheckUtils]: 41: Hoare triple {6321#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6322#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:16,939 INFO L273 TraceCheckUtils]: 42: Hoare triple {6322#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6322#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:16,939 INFO L273 TraceCheckUtils]: 43: Hoare triple {6322#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6323#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:16,940 INFO L273 TraceCheckUtils]: 44: Hoare triple {6323#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6323#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:16,941 INFO L273 TraceCheckUtils]: 45: Hoare triple {6323#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6324#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:16,941 INFO L273 TraceCheckUtils]: 46: Hoare triple {6324#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6324#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:16,942 INFO L273 TraceCheckUtils]: 47: Hoare triple {6324#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6325#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:16,943 INFO L273 TraceCheckUtils]: 48: Hoare triple {6325#(<= main_~i~0 21)} assume !(~i~0 < 1024); {6303#false} is VALID [2018-11-23 13:05:16,943 INFO L273 TraceCheckUtils]: 49: Hoare triple {6303#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {6303#false} is VALID [2018-11-23 13:05:16,943 INFO L256 TraceCheckUtils]: 50: Hoare triple {6303#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {6303#false} is VALID [2018-11-23 13:05:16,943 INFO L273 TraceCheckUtils]: 51: Hoare triple {6303#false} ~cond := #in~cond; {6303#false} is VALID [2018-11-23 13:05:16,944 INFO L273 TraceCheckUtils]: 52: Hoare triple {6303#false} assume 0 == ~cond; {6303#false} is VALID [2018-11-23 13:05:16,944 INFO L273 TraceCheckUtils]: 53: Hoare triple {6303#false} assume !false; {6303#false} is VALID [2018-11-23 13:05:16,947 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:16,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:16,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 13:05:16,967 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 54 [2018-11-23 13:05:16,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:16,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 13:05:17,021 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 13:05:17,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 13:05:17,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 13:05:17,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:05:17,022 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 25 states. [2018-11-23 13:05:17,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:17,401 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-11-23 13:05:17,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 13:05:17,401 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 54 [2018-11-23 13:05:17,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:17,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:05:17,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 64 transitions. [2018-11-23 13:05:17,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:05:17,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 64 transitions. [2018-11-23 13:05:17,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 64 transitions. [2018-11-23 13:05:17,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:17,464 INFO L225 Difference]: With dead ends: 64 [2018-11-23 13:05:17,464 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 13:05:17,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:05:17,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 13:05:17,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-11-23 13:05:17,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:17,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 57 states. [2018-11-23 13:05:17,497 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 57 states. [2018-11-23 13:05:17,497 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 57 states. [2018-11-23 13:05:17,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:17,498 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-23 13:05:17,498 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-23 13:05:17,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:17,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:17,499 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 58 states. [2018-11-23 13:05:17,499 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 58 states. [2018-11-23 13:05:17,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:17,500 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-23 13:05:17,500 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-23 13:05:17,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:17,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:17,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:17,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:17,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 13:05:17,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-11-23 13:05:17,501 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-11-23 13:05:17,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:17,501 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-11-23 13:05:17,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 13:05:17,501 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-23 13:05:17,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 13:05:17,502 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:17,502 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:17,502 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:17,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:17,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1038560119, now seen corresponding path program 22 times [2018-11-23 13:05:17,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:17,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:17,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:17,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:17,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:18,177 INFO L256 TraceCheckUtils]: 0: Hoare triple {6785#true} call ULTIMATE.init(); {6785#true} is VALID [2018-11-23 13:05:18,177 INFO L273 TraceCheckUtils]: 1: Hoare triple {6785#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6785#true} is VALID [2018-11-23 13:05:18,178 INFO L273 TraceCheckUtils]: 2: Hoare triple {6785#true} assume true; {6785#true} is VALID [2018-11-23 13:05:18,178 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6785#true} {6785#true} #35#return; {6785#true} is VALID [2018-11-23 13:05:18,178 INFO L256 TraceCheckUtils]: 4: Hoare triple {6785#true} call #t~ret2 := main(); {6785#true} is VALID [2018-11-23 13:05:18,178 INFO L273 TraceCheckUtils]: 5: Hoare triple {6785#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {6787#(= main_~i~0 0)} is VALID [2018-11-23 13:05:18,179 INFO L273 TraceCheckUtils]: 6: Hoare triple {6787#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6787#(= main_~i~0 0)} is VALID [2018-11-23 13:05:18,180 INFO L273 TraceCheckUtils]: 7: Hoare triple {6787#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6788#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:18,180 INFO L273 TraceCheckUtils]: 8: Hoare triple {6788#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6788#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:18,181 INFO L273 TraceCheckUtils]: 9: Hoare triple {6788#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6789#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:18,181 INFO L273 TraceCheckUtils]: 10: Hoare triple {6789#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6789#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:18,182 INFO L273 TraceCheckUtils]: 11: Hoare triple {6789#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6790#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:18,182 INFO L273 TraceCheckUtils]: 12: Hoare triple {6790#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6790#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:18,182 INFO L273 TraceCheckUtils]: 13: Hoare triple {6790#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6791#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:18,183 INFO L273 TraceCheckUtils]: 14: Hoare triple {6791#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6791#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:18,184 INFO L273 TraceCheckUtils]: 15: Hoare triple {6791#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6792#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:18,184 INFO L273 TraceCheckUtils]: 16: Hoare triple {6792#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6792#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:18,185 INFO L273 TraceCheckUtils]: 17: Hoare triple {6792#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6793#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:18,185 INFO L273 TraceCheckUtils]: 18: Hoare triple {6793#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6793#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:18,186 INFO L273 TraceCheckUtils]: 19: Hoare triple {6793#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6794#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:18,187 INFO L273 TraceCheckUtils]: 20: Hoare triple {6794#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6794#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:18,187 INFO L273 TraceCheckUtils]: 21: Hoare triple {6794#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6795#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:18,188 INFO L273 TraceCheckUtils]: 22: Hoare triple {6795#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6795#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:18,189 INFO L273 TraceCheckUtils]: 23: Hoare triple {6795#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6796#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:18,189 INFO L273 TraceCheckUtils]: 24: Hoare triple {6796#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6796#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:18,190 INFO L273 TraceCheckUtils]: 25: Hoare triple {6796#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6797#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:18,190 INFO L273 TraceCheckUtils]: 26: Hoare triple {6797#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6797#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:18,191 INFO L273 TraceCheckUtils]: 27: Hoare triple {6797#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6798#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:18,192 INFO L273 TraceCheckUtils]: 28: Hoare triple {6798#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6798#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:18,192 INFO L273 TraceCheckUtils]: 29: Hoare triple {6798#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6799#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:18,193 INFO L273 TraceCheckUtils]: 30: Hoare triple {6799#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6799#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:18,194 INFO L273 TraceCheckUtils]: 31: Hoare triple {6799#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6800#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:18,194 INFO L273 TraceCheckUtils]: 32: Hoare triple {6800#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6800#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:18,195 INFO L273 TraceCheckUtils]: 33: Hoare triple {6800#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6801#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:18,196 INFO L273 TraceCheckUtils]: 34: Hoare triple {6801#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6801#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:18,196 INFO L273 TraceCheckUtils]: 35: Hoare triple {6801#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6802#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:18,197 INFO L273 TraceCheckUtils]: 36: Hoare triple {6802#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6802#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:18,198 INFO L273 TraceCheckUtils]: 37: Hoare triple {6802#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6803#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:18,198 INFO L273 TraceCheckUtils]: 38: Hoare triple {6803#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6803#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:18,199 INFO L273 TraceCheckUtils]: 39: Hoare triple {6803#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6804#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:18,199 INFO L273 TraceCheckUtils]: 40: Hoare triple {6804#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6804#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:18,200 INFO L273 TraceCheckUtils]: 41: Hoare triple {6804#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6805#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:18,201 INFO L273 TraceCheckUtils]: 42: Hoare triple {6805#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6805#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:18,201 INFO L273 TraceCheckUtils]: 43: Hoare triple {6805#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6806#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:18,202 INFO L273 TraceCheckUtils]: 44: Hoare triple {6806#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6806#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:18,203 INFO L273 TraceCheckUtils]: 45: Hoare triple {6806#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6807#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:18,203 INFO L273 TraceCheckUtils]: 46: Hoare triple {6807#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6807#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:18,204 INFO L273 TraceCheckUtils]: 47: Hoare triple {6807#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6808#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:18,204 INFO L273 TraceCheckUtils]: 48: Hoare triple {6808#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6808#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:18,205 INFO L273 TraceCheckUtils]: 49: Hoare triple {6808#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6809#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:18,206 INFO L273 TraceCheckUtils]: 50: Hoare triple {6809#(<= main_~i~0 22)} assume !(~i~0 < 1024); {6786#false} is VALID [2018-11-23 13:05:18,206 INFO L273 TraceCheckUtils]: 51: Hoare triple {6786#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {6786#false} is VALID [2018-11-23 13:05:18,206 INFO L256 TraceCheckUtils]: 52: Hoare triple {6786#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {6786#false} is VALID [2018-11-23 13:05:18,206 INFO L273 TraceCheckUtils]: 53: Hoare triple {6786#false} ~cond := #in~cond; {6786#false} is VALID [2018-11-23 13:05:18,207 INFO L273 TraceCheckUtils]: 54: Hoare triple {6786#false} assume 0 == ~cond; {6786#false} is VALID [2018-11-23 13:05:18,207 INFO L273 TraceCheckUtils]: 55: Hoare triple {6786#false} assume !false; {6786#false} is VALID [2018-11-23 13:05:18,210 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:18,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:18,210 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 13:05:18,223 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:05:18,246 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:05:18,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:18,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:18,550 INFO L256 TraceCheckUtils]: 0: Hoare triple {6785#true} call ULTIMATE.init(); {6785#true} is VALID [2018-11-23 13:05:18,550 INFO L273 TraceCheckUtils]: 1: Hoare triple {6785#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6785#true} is VALID [2018-11-23 13:05:18,550 INFO L273 TraceCheckUtils]: 2: Hoare triple {6785#true} assume true; {6785#true} is VALID [2018-11-23 13:05:18,550 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6785#true} {6785#true} #35#return; {6785#true} is VALID [2018-11-23 13:05:18,550 INFO L256 TraceCheckUtils]: 4: Hoare triple {6785#true} call #t~ret2 := main(); {6785#true} is VALID [2018-11-23 13:05:18,551 INFO L273 TraceCheckUtils]: 5: Hoare triple {6785#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {6828#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:18,551 INFO L273 TraceCheckUtils]: 6: Hoare triple {6828#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6828#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:18,552 INFO L273 TraceCheckUtils]: 7: Hoare triple {6828#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6788#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:18,552 INFO L273 TraceCheckUtils]: 8: Hoare triple {6788#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6788#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:18,553 INFO L273 TraceCheckUtils]: 9: Hoare triple {6788#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6789#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:18,553 INFO L273 TraceCheckUtils]: 10: Hoare triple {6789#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6789#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:18,554 INFO L273 TraceCheckUtils]: 11: Hoare triple {6789#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6790#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:18,555 INFO L273 TraceCheckUtils]: 12: Hoare triple {6790#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6790#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:18,555 INFO L273 TraceCheckUtils]: 13: Hoare triple {6790#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6791#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:18,556 INFO L273 TraceCheckUtils]: 14: Hoare triple {6791#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6791#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:18,557 INFO L273 TraceCheckUtils]: 15: Hoare triple {6791#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6792#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:18,557 INFO L273 TraceCheckUtils]: 16: Hoare triple {6792#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6792#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:18,558 INFO L273 TraceCheckUtils]: 17: Hoare triple {6792#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6793#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:18,558 INFO L273 TraceCheckUtils]: 18: Hoare triple {6793#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6793#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:18,559 INFO L273 TraceCheckUtils]: 19: Hoare triple {6793#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6794#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:18,560 INFO L273 TraceCheckUtils]: 20: Hoare triple {6794#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6794#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:18,560 INFO L273 TraceCheckUtils]: 21: Hoare triple {6794#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6795#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:18,561 INFO L273 TraceCheckUtils]: 22: Hoare triple {6795#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6795#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:18,562 INFO L273 TraceCheckUtils]: 23: Hoare triple {6795#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6796#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:18,562 INFO L273 TraceCheckUtils]: 24: Hoare triple {6796#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6796#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:18,563 INFO L273 TraceCheckUtils]: 25: Hoare triple {6796#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6797#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:18,563 INFO L273 TraceCheckUtils]: 26: Hoare triple {6797#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6797#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:18,564 INFO L273 TraceCheckUtils]: 27: Hoare triple {6797#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6798#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:18,565 INFO L273 TraceCheckUtils]: 28: Hoare triple {6798#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6798#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:18,565 INFO L273 TraceCheckUtils]: 29: Hoare triple {6798#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6799#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:18,566 INFO L273 TraceCheckUtils]: 30: Hoare triple {6799#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6799#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:18,567 INFO L273 TraceCheckUtils]: 31: Hoare triple {6799#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6800#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:18,567 INFO L273 TraceCheckUtils]: 32: Hoare triple {6800#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6800#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:18,568 INFO L273 TraceCheckUtils]: 33: Hoare triple {6800#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6801#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:18,569 INFO L273 TraceCheckUtils]: 34: Hoare triple {6801#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6801#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:18,569 INFO L273 TraceCheckUtils]: 35: Hoare triple {6801#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6802#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:18,570 INFO L273 TraceCheckUtils]: 36: Hoare triple {6802#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6802#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:18,571 INFO L273 TraceCheckUtils]: 37: Hoare triple {6802#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6803#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:18,571 INFO L273 TraceCheckUtils]: 38: Hoare triple {6803#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6803#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:18,572 INFO L273 TraceCheckUtils]: 39: Hoare triple {6803#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6804#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:18,572 INFO L273 TraceCheckUtils]: 40: Hoare triple {6804#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6804#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:18,573 INFO L273 TraceCheckUtils]: 41: Hoare triple {6804#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6805#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:18,574 INFO L273 TraceCheckUtils]: 42: Hoare triple {6805#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6805#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:18,574 INFO L273 TraceCheckUtils]: 43: Hoare triple {6805#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6806#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:18,575 INFO L273 TraceCheckUtils]: 44: Hoare triple {6806#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6806#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:18,576 INFO L273 TraceCheckUtils]: 45: Hoare triple {6806#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6807#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:18,576 INFO L273 TraceCheckUtils]: 46: Hoare triple {6807#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6807#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:18,577 INFO L273 TraceCheckUtils]: 47: Hoare triple {6807#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6808#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:18,577 INFO L273 TraceCheckUtils]: 48: Hoare triple {6808#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6808#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:18,578 INFO L273 TraceCheckUtils]: 49: Hoare triple {6808#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6809#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:18,579 INFO L273 TraceCheckUtils]: 50: Hoare triple {6809#(<= main_~i~0 22)} assume !(~i~0 < 1024); {6786#false} is VALID [2018-11-23 13:05:18,579 INFO L273 TraceCheckUtils]: 51: Hoare triple {6786#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {6786#false} is VALID [2018-11-23 13:05:18,579 INFO L256 TraceCheckUtils]: 52: Hoare triple {6786#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {6786#false} is VALID [2018-11-23 13:05:18,579 INFO L273 TraceCheckUtils]: 53: Hoare triple {6786#false} ~cond := #in~cond; {6786#false} is VALID [2018-11-23 13:05:18,580 INFO L273 TraceCheckUtils]: 54: Hoare triple {6786#false} assume 0 == ~cond; {6786#false} is VALID [2018-11-23 13:05:18,580 INFO L273 TraceCheckUtils]: 55: Hoare triple {6786#false} assume !false; {6786#false} is VALID [2018-11-23 13:05:18,583 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:18,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:18,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 13:05:18,602 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2018-11-23 13:05:18,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:18,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 13:05:18,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:18,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 13:05:18,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 13:05:18,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 13:05:18,679 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 26 states. [2018-11-23 13:05:18,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:18,991 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-23 13:05:18,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 13:05:18,991 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2018-11-23 13:05:18,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:18,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:05:18,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 66 transitions. [2018-11-23 13:05:18,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:05:18,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 66 transitions. [2018-11-23 13:05:18,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 66 transitions. [2018-11-23 13:05:19,055 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 13:05:19,056 INFO L225 Difference]: With dead ends: 66 [2018-11-23 13:05:19,056 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 13:05:19,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 13:05:19,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 13:05:19,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-11-23 13:05:19,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:19,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 59 states. [2018-11-23 13:05:19,079 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 59 states. [2018-11-23 13:05:19,079 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 59 states. [2018-11-23 13:05:19,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:19,080 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-23 13:05:19,080 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-23 13:05:19,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:19,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:19,081 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 60 states. [2018-11-23 13:05:19,081 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 60 states. [2018-11-23 13:05:19,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:19,082 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-23 13:05:19,082 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-23 13:05:19,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:19,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:19,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:19,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:19,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 13:05:19,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-11-23 13:05:19,084 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-11-23 13:05:19,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:19,084 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-11-23 13:05:19,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 13:05:19,084 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-11-23 13:05:19,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 13:05:19,084 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:19,085 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:19,085 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:19,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:19,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1830383915, now seen corresponding path program 23 times [2018-11-23 13:05:19,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:19,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:19,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:19,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:19,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:19,658 INFO L256 TraceCheckUtils]: 0: Hoare triple {7285#true} call ULTIMATE.init(); {7285#true} is VALID [2018-11-23 13:05:19,658 INFO L273 TraceCheckUtils]: 1: Hoare triple {7285#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7285#true} is VALID [2018-11-23 13:05:19,658 INFO L273 TraceCheckUtils]: 2: Hoare triple {7285#true} assume true; {7285#true} is VALID [2018-11-23 13:05:19,658 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7285#true} {7285#true} #35#return; {7285#true} is VALID [2018-11-23 13:05:19,659 INFO L256 TraceCheckUtils]: 4: Hoare triple {7285#true} call #t~ret2 := main(); {7285#true} is VALID [2018-11-23 13:05:19,659 INFO L273 TraceCheckUtils]: 5: Hoare triple {7285#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {7287#(= main_~i~0 0)} is VALID [2018-11-23 13:05:19,659 INFO L273 TraceCheckUtils]: 6: Hoare triple {7287#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7287#(= main_~i~0 0)} is VALID [2018-11-23 13:05:19,660 INFO L273 TraceCheckUtils]: 7: Hoare triple {7287#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7288#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:19,660 INFO L273 TraceCheckUtils]: 8: Hoare triple {7288#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7288#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:19,660 INFO L273 TraceCheckUtils]: 9: Hoare triple {7288#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7289#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:19,661 INFO L273 TraceCheckUtils]: 10: Hoare triple {7289#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7289#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:19,661 INFO L273 TraceCheckUtils]: 11: Hoare triple {7289#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7290#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:19,662 INFO L273 TraceCheckUtils]: 12: Hoare triple {7290#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7290#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:19,662 INFO L273 TraceCheckUtils]: 13: Hoare triple {7290#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7291#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:19,662 INFO L273 TraceCheckUtils]: 14: Hoare triple {7291#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7291#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:19,663 INFO L273 TraceCheckUtils]: 15: Hoare triple {7291#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7292#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:19,664 INFO L273 TraceCheckUtils]: 16: Hoare triple {7292#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7292#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:19,664 INFO L273 TraceCheckUtils]: 17: Hoare triple {7292#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7293#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:19,665 INFO L273 TraceCheckUtils]: 18: Hoare triple {7293#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7293#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:19,665 INFO L273 TraceCheckUtils]: 19: Hoare triple {7293#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7294#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:19,666 INFO L273 TraceCheckUtils]: 20: Hoare triple {7294#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7294#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:19,667 INFO L273 TraceCheckUtils]: 21: Hoare triple {7294#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7295#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:19,667 INFO L273 TraceCheckUtils]: 22: Hoare triple {7295#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7295#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:19,668 INFO L273 TraceCheckUtils]: 23: Hoare triple {7295#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7296#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:19,668 INFO L273 TraceCheckUtils]: 24: Hoare triple {7296#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7296#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:19,669 INFO L273 TraceCheckUtils]: 25: Hoare triple {7296#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7297#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:19,670 INFO L273 TraceCheckUtils]: 26: Hoare triple {7297#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7297#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:19,670 INFO L273 TraceCheckUtils]: 27: Hoare triple {7297#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7298#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:19,671 INFO L273 TraceCheckUtils]: 28: Hoare triple {7298#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7298#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:19,671 INFO L273 TraceCheckUtils]: 29: Hoare triple {7298#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7299#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:19,672 INFO L273 TraceCheckUtils]: 30: Hoare triple {7299#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7299#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:19,673 INFO L273 TraceCheckUtils]: 31: Hoare triple {7299#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7300#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:19,673 INFO L273 TraceCheckUtils]: 32: Hoare triple {7300#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7300#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:19,674 INFO L273 TraceCheckUtils]: 33: Hoare triple {7300#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7301#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:19,674 INFO L273 TraceCheckUtils]: 34: Hoare triple {7301#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7301#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:19,675 INFO L273 TraceCheckUtils]: 35: Hoare triple {7301#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7302#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:19,675 INFO L273 TraceCheckUtils]: 36: Hoare triple {7302#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7302#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:19,676 INFO L273 TraceCheckUtils]: 37: Hoare triple {7302#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7303#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:19,677 INFO L273 TraceCheckUtils]: 38: Hoare triple {7303#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7303#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:19,677 INFO L273 TraceCheckUtils]: 39: Hoare triple {7303#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7304#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:19,678 INFO L273 TraceCheckUtils]: 40: Hoare triple {7304#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7304#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:19,679 INFO L273 TraceCheckUtils]: 41: Hoare triple {7304#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7305#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:19,679 INFO L273 TraceCheckUtils]: 42: Hoare triple {7305#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7305#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:19,680 INFO L273 TraceCheckUtils]: 43: Hoare triple {7305#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7306#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:19,680 INFO L273 TraceCheckUtils]: 44: Hoare triple {7306#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7306#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:19,681 INFO L273 TraceCheckUtils]: 45: Hoare triple {7306#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7307#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:19,681 INFO L273 TraceCheckUtils]: 46: Hoare triple {7307#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7307#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:19,682 INFO L273 TraceCheckUtils]: 47: Hoare triple {7307#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7308#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:19,683 INFO L273 TraceCheckUtils]: 48: Hoare triple {7308#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7308#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:19,683 INFO L273 TraceCheckUtils]: 49: Hoare triple {7308#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7309#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:19,684 INFO L273 TraceCheckUtils]: 50: Hoare triple {7309#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7309#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:19,685 INFO L273 TraceCheckUtils]: 51: Hoare triple {7309#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7310#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:19,685 INFO L273 TraceCheckUtils]: 52: Hoare triple {7310#(<= main_~i~0 23)} assume !(~i~0 < 1024); {7286#false} is VALID [2018-11-23 13:05:19,685 INFO L273 TraceCheckUtils]: 53: Hoare triple {7286#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {7286#false} is VALID [2018-11-23 13:05:19,686 INFO L256 TraceCheckUtils]: 54: Hoare triple {7286#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {7286#false} is VALID [2018-11-23 13:05:19,686 INFO L273 TraceCheckUtils]: 55: Hoare triple {7286#false} ~cond := #in~cond; {7286#false} is VALID [2018-11-23 13:05:19,686 INFO L273 TraceCheckUtils]: 56: Hoare triple {7286#false} assume 0 == ~cond; {7286#false} is VALID [2018-11-23 13:05:19,686 INFO L273 TraceCheckUtils]: 57: Hoare triple {7286#false} assume !false; {7286#false} is VALID [2018-11-23 13:05:19,689 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:19,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:19,689 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 13:05:19,698 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:05:20,057 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-23 13:05:20,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:20,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:20,304 INFO L256 TraceCheckUtils]: 0: Hoare triple {7285#true} call ULTIMATE.init(); {7285#true} is VALID [2018-11-23 13:05:20,305 INFO L273 TraceCheckUtils]: 1: Hoare triple {7285#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7285#true} is VALID [2018-11-23 13:05:20,305 INFO L273 TraceCheckUtils]: 2: Hoare triple {7285#true} assume true; {7285#true} is VALID [2018-11-23 13:05:20,305 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7285#true} {7285#true} #35#return; {7285#true} is VALID [2018-11-23 13:05:20,305 INFO L256 TraceCheckUtils]: 4: Hoare triple {7285#true} call #t~ret2 := main(); {7285#true} is VALID [2018-11-23 13:05:20,306 INFO L273 TraceCheckUtils]: 5: Hoare triple {7285#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {7329#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:20,307 INFO L273 TraceCheckUtils]: 6: Hoare triple {7329#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7329#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:20,307 INFO L273 TraceCheckUtils]: 7: Hoare triple {7329#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7288#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:20,308 INFO L273 TraceCheckUtils]: 8: Hoare triple {7288#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7288#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:20,309 INFO L273 TraceCheckUtils]: 9: Hoare triple {7288#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7289#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:20,309 INFO L273 TraceCheckUtils]: 10: Hoare triple {7289#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7289#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:20,310 INFO L273 TraceCheckUtils]: 11: Hoare triple {7289#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7290#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:20,310 INFO L273 TraceCheckUtils]: 12: Hoare triple {7290#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7290#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:20,311 INFO L273 TraceCheckUtils]: 13: Hoare triple {7290#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7291#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:20,312 INFO L273 TraceCheckUtils]: 14: Hoare triple {7291#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7291#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:20,312 INFO L273 TraceCheckUtils]: 15: Hoare triple {7291#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7292#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:20,313 INFO L273 TraceCheckUtils]: 16: Hoare triple {7292#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7292#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:20,314 INFO L273 TraceCheckUtils]: 17: Hoare triple {7292#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7293#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:20,314 INFO L273 TraceCheckUtils]: 18: Hoare triple {7293#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7293#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:20,315 INFO L273 TraceCheckUtils]: 19: Hoare triple {7293#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7294#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:20,316 INFO L273 TraceCheckUtils]: 20: Hoare triple {7294#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7294#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:20,316 INFO L273 TraceCheckUtils]: 21: Hoare triple {7294#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7295#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:20,317 INFO L273 TraceCheckUtils]: 22: Hoare triple {7295#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7295#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:20,318 INFO L273 TraceCheckUtils]: 23: Hoare triple {7295#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7296#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:20,318 INFO L273 TraceCheckUtils]: 24: Hoare triple {7296#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7296#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:20,319 INFO L273 TraceCheckUtils]: 25: Hoare triple {7296#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7297#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:20,319 INFO L273 TraceCheckUtils]: 26: Hoare triple {7297#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7297#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:20,320 INFO L273 TraceCheckUtils]: 27: Hoare triple {7297#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7298#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:20,321 INFO L273 TraceCheckUtils]: 28: Hoare triple {7298#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7298#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:20,335 INFO L273 TraceCheckUtils]: 29: Hoare triple {7298#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7299#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:20,336 INFO L273 TraceCheckUtils]: 30: Hoare triple {7299#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7299#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:20,336 INFO L273 TraceCheckUtils]: 31: Hoare triple {7299#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7300#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:20,336 INFO L273 TraceCheckUtils]: 32: Hoare triple {7300#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7300#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:20,337 INFO L273 TraceCheckUtils]: 33: Hoare triple {7300#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7301#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:20,337 INFO L273 TraceCheckUtils]: 34: Hoare triple {7301#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7301#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:20,338 INFO L273 TraceCheckUtils]: 35: Hoare triple {7301#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7302#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:20,338 INFO L273 TraceCheckUtils]: 36: Hoare triple {7302#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7302#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:20,338 INFO L273 TraceCheckUtils]: 37: Hoare triple {7302#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7303#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:20,339 INFO L273 TraceCheckUtils]: 38: Hoare triple {7303#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7303#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:20,339 INFO L273 TraceCheckUtils]: 39: Hoare triple {7303#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7304#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:20,339 INFO L273 TraceCheckUtils]: 40: Hoare triple {7304#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7304#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:20,340 INFO L273 TraceCheckUtils]: 41: Hoare triple {7304#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7305#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:20,340 INFO L273 TraceCheckUtils]: 42: Hoare triple {7305#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7305#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:20,341 INFO L273 TraceCheckUtils]: 43: Hoare triple {7305#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7306#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:20,342 INFO L273 TraceCheckUtils]: 44: Hoare triple {7306#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7306#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:20,342 INFO L273 TraceCheckUtils]: 45: Hoare triple {7306#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7307#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:20,343 INFO L273 TraceCheckUtils]: 46: Hoare triple {7307#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7307#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:20,344 INFO L273 TraceCheckUtils]: 47: Hoare triple {7307#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7308#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:20,344 INFO L273 TraceCheckUtils]: 48: Hoare triple {7308#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7308#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:20,345 INFO L273 TraceCheckUtils]: 49: Hoare triple {7308#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7309#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:20,346 INFO L273 TraceCheckUtils]: 50: Hoare triple {7309#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7309#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:20,346 INFO L273 TraceCheckUtils]: 51: Hoare triple {7309#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7310#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:20,347 INFO L273 TraceCheckUtils]: 52: Hoare triple {7310#(<= main_~i~0 23)} assume !(~i~0 < 1024); {7286#false} is VALID [2018-11-23 13:05:20,347 INFO L273 TraceCheckUtils]: 53: Hoare triple {7286#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {7286#false} is VALID [2018-11-23 13:05:20,347 INFO L256 TraceCheckUtils]: 54: Hoare triple {7286#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {7286#false} is VALID [2018-11-23 13:05:20,348 INFO L273 TraceCheckUtils]: 55: Hoare triple {7286#false} ~cond := #in~cond; {7286#false} is VALID [2018-11-23 13:05:20,348 INFO L273 TraceCheckUtils]: 56: Hoare triple {7286#false} assume 0 == ~cond; {7286#false} is VALID [2018-11-23 13:05:20,348 INFO L273 TraceCheckUtils]: 57: Hoare triple {7286#false} assume !false; {7286#false} is VALID [2018-11-23 13:05:20,352 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:20,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:20,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-23 13:05:20,371 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 58 [2018-11-23 13:05:20,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:20,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 13:05:20,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:20,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 13:05:20,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 13:05:20,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 13:05:20,436 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 27 states. [2018-11-23 13:05:20,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:20,693 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-11-23 13:05:20,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 13:05:20,693 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 58 [2018-11-23 13:05:20,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:20,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:05:20,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 68 transitions. [2018-11-23 13:05:20,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:05:20,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 68 transitions. [2018-11-23 13:05:20,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 68 transitions. [2018-11-23 13:05:20,760 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:20,761 INFO L225 Difference]: With dead ends: 68 [2018-11-23 13:05:20,761 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 13:05:20,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 13:05:20,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 13:05:20,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-11-23 13:05:20,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:20,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 61 states. [2018-11-23 13:05:20,803 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 61 states. [2018-11-23 13:05:20,803 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 61 states. [2018-11-23 13:05:20,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:20,804 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-11-23 13:05:20,804 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-11-23 13:05:20,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:20,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:20,804 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 62 states. [2018-11-23 13:05:20,804 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 62 states. [2018-11-23 13:05:20,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:20,805 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-11-23 13:05:20,806 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-11-23 13:05:20,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:20,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:20,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:20,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:20,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 13:05:20,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-11-23 13:05:20,807 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-11-23 13:05:20,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:20,808 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-11-23 13:05:20,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 13:05:20,808 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-11-23 13:05:20,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 13:05:20,808 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:20,809 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:20,809 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:20,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:20,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1516596557, now seen corresponding path program 24 times [2018-11-23 13:05:20,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:20,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:20,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:20,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:20,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:21,952 INFO L256 TraceCheckUtils]: 0: Hoare triple {7802#true} call ULTIMATE.init(); {7802#true} is VALID [2018-11-23 13:05:21,952 INFO L273 TraceCheckUtils]: 1: Hoare triple {7802#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7802#true} is VALID [2018-11-23 13:05:21,952 INFO L273 TraceCheckUtils]: 2: Hoare triple {7802#true} assume true; {7802#true} is VALID [2018-11-23 13:05:21,953 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7802#true} {7802#true} #35#return; {7802#true} is VALID [2018-11-23 13:05:21,953 INFO L256 TraceCheckUtils]: 4: Hoare triple {7802#true} call #t~ret2 := main(); {7802#true} is VALID [2018-11-23 13:05:21,953 INFO L273 TraceCheckUtils]: 5: Hoare triple {7802#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {7804#(= main_~i~0 0)} is VALID [2018-11-23 13:05:21,954 INFO L273 TraceCheckUtils]: 6: Hoare triple {7804#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7804#(= main_~i~0 0)} is VALID [2018-11-23 13:05:21,955 INFO L273 TraceCheckUtils]: 7: Hoare triple {7804#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7805#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:21,955 INFO L273 TraceCheckUtils]: 8: Hoare triple {7805#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7805#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:21,956 INFO L273 TraceCheckUtils]: 9: Hoare triple {7805#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7806#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:21,956 INFO L273 TraceCheckUtils]: 10: Hoare triple {7806#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7806#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:21,957 INFO L273 TraceCheckUtils]: 11: Hoare triple {7806#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7807#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:21,958 INFO L273 TraceCheckUtils]: 12: Hoare triple {7807#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7807#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:21,958 INFO L273 TraceCheckUtils]: 13: Hoare triple {7807#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7808#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:21,959 INFO L273 TraceCheckUtils]: 14: Hoare triple {7808#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7808#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:21,960 INFO L273 TraceCheckUtils]: 15: Hoare triple {7808#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7809#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:21,960 INFO L273 TraceCheckUtils]: 16: Hoare triple {7809#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7809#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:21,961 INFO L273 TraceCheckUtils]: 17: Hoare triple {7809#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7810#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:21,961 INFO L273 TraceCheckUtils]: 18: Hoare triple {7810#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7810#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:21,962 INFO L273 TraceCheckUtils]: 19: Hoare triple {7810#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7811#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:21,963 INFO L273 TraceCheckUtils]: 20: Hoare triple {7811#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7811#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:21,963 INFO L273 TraceCheckUtils]: 21: Hoare triple {7811#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7812#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:21,964 INFO L273 TraceCheckUtils]: 22: Hoare triple {7812#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7812#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:21,965 INFO L273 TraceCheckUtils]: 23: Hoare triple {7812#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7813#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:21,965 INFO L273 TraceCheckUtils]: 24: Hoare triple {7813#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7813#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:21,966 INFO L273 TraceCheckUtils]: 25: Hoare triple {7813#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7814#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:21,966 INFO L273 TraceCheckUtils]: 26: Hoare triple {7814#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7814#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:21,967 INFO L273 TraceCheckUtils]: 27: Hoare triple {7814#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7815#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:21,968 INFO L273 TraceCheckUtils]: 28: Hoare triple {7815#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7815#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:21,968 INFO L273 TraceCheckUtils]: 29: Hoare triple {7815#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7816#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:21,969 INFO L273 TraceCheckUtils]: 30: Hoare triple {7816#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7816#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:21,970 INFO L273 TraceCheckUtils]: 31: Hoare triple {7816#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7817#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:21,970 INFO L273 TraceCheckUtils]: 32: Hoare triple {7817#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7817#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:21,971 INFO L273 TraceCheckUtils]: 33: Hoare triple {7817#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7818#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:21,971 INFO L273 TraceCheckUtils]: 34: Hoare triple {7818#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7818#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:21,972 INFO L273 TraceCheckUtils]: 35: Hoare triple {7818#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7819#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:21,973 INFO L273 TraceCheckUtils]: 36: Hoare triple {7819#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7819#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:21,973 INFO L273 TraceCheckUtils]: 37: Hoare triple {7819#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7820#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:21,974 INFO L273 TraceCheckUtils]: 38: Hoare triple {7820#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7820#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:21,975 INFO L273 TraceCheckUtils]: 39: Hoare triple {7820#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7821#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:21,975 INFO L273 TraceCheckUtils]: 40: Hoare triple {7821#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7821#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:21,976 INFO L273 TraceCheckUtils]: 41: Hoare triple {7821#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7822#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:21,976 INFO L273 TraceCheckUtils]: 42: Hoare triple {7822#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7822#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:21,977 INFO L273 TraceCheckUtils]: 43: Hoare triple {7822#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7823#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:21,978 INFO L273 TraceCheckUtils]: 44: Hoare triple {7823#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7823#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:21,978 INFO L273 TraceCheckUtils]: 45: Hoare triple {7823#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7824#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:21,979 INFO L273 TraceCheckUtils]: 46: Hoare triple {7824#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7824#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:21,980 INFO L273 TraceCheckUtils]: 47: Hoare triple {7824#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7825#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:21,980 INFO L273 TraceCheckUtils]: 48: Hoare triple {7825#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7825#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:21,981 INFO L273 TraceCheckUtils]: 49: Hoare triple {7825#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7826#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:21,981 INFO L273 TraceCheckUtils]: 50: Hoare triple {7826#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7826#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:21,982 INFO L273 TraceCheckUtils]: 51: Hoare triple {7826#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7827#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:21,983 INFO L273 TraceCheckUtils]: 52: Hoare triple {7827#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7827#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:21,983 INFO L273 TraceCheckUtils]: 53: Hoare triple {7827#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7828#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:21,984 INFO L273 TraceCheckUtils]: 54: Hoare triple {7828#(<= main_~i~0 24)} assume !(~i~0 < 1024); {7803#false} is VALID [2018-11-23 13:05:21,984 INFO L273 TraceCheckUtils]: 55: Hoare triple {7803#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {7803#false} is VALID [2018-11-23 13:05:21,984 INFO L256 TraceCheckUtils]: 56: Hoare triple {7803#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {7803#false} is VALID [2018-11-23 13:05:21,985 INFO L273 TraceCheckUtils]: 57: Hoare triple {7803#false} ~cond := #in~cond; {7803#false} is VALID [2018-11-23 13:05:21,985 INFO L273 TraceCheckUtils]: 58: Hoare triple {7803#false} assume 0 == ~cond; {7803#false} is VALID [2018-11-23 13:05:21,985 INFO L273 TraceCheckUtils]: 59: Hoare triple {7803#false} assume !false; {7803#false} is VALID [2018-11-23 13:05:21,989 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:21,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:21,989 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:21,998 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:05:23,419 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-11-23 13:05:23,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:23,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:23,618 INFO L256 TraceCheckUtils]: 0: Hoare triple {7802#true} call ULTIMATE.init(); {7802#true} is VALID [2018-11-23 13:05:23,618 INFO L273 TraceCheckUtils]: 1: Hoare triple {7802#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7802#true} is VALID [2018-11-23 13:05:23,619 INFO L273 TraceCheckUtils]: 2: Hoare triple {7802#true} assume true; {7802#true} is VALID [2018-11-23 13:05:23,619 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7802#true} {7802#true} #35#return; {7802#true} is VALID [2018-11-23 13:05:23,619 INFO L256 TraceCheckUtils]: 4: Hoare triple {7802#true} call #t~ret2 := main(); {7802#true} is VALID [2018-11-23 13:05:23,620 INFO L273 TraceCheckUtils]: 5: Hoare triple {7802#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {7847#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:23,620 INFO L273 TraceCheckUtils]: 6: Hoare triple {7847#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7847#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:23,621 INFO L273 TraceCheckUtils]: 7: Hoare triple {7847#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7805#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:23,621 INFO L273 TraceCheckUtils]: 8: Hoare triple {7805#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7805#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:23,621 INFO L273 TraceCheckUtils]: 9: Hoare triple {7805#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7806#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:23,622 INFO L273 TraceCheckUtils]: 10: Hoare triple {7806#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7806#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:23,622 INFO L273 TraceCheckUtils]: 11: Hoare triple {7806#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7807#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:23,622 INFO L273 TraceCheckUtils]: 12: Hoare triple {7807#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7807#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:23,623 INFO L273 TraceCheckUtils]: 13: Hoare triple {7807#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7808#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:23,623 INFO L273 TraceCheckUtils]: 14: Hoare triple {7808#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7808#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:23,624 INFO L273 TraceCheckUtils]: 15: Hoare triple {7808#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7809#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:23,625 INFO L273 TraceCheckUtils]: 16: Hoare triple {7809#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7809#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:23,625 INFO L273 TraceCheckUtils]: 17: Hoare triple {7809#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7810#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:23,626 INFO L273 TraceCheckUtils]: 18: Hoare triple {7810#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7810#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:23,627 INFO L273 TraceCheckUtils]: 19: Hoare triple {7810#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7811#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:23,627 INFO L273 TraceCheckUtils]: 20: Hoare triple {7811#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7811#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:23,628 INFO L273 TraceCheckUtils]: 21: Hoare triple {7811#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7812#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:23,628 INFO L273 TraceCheckUtils]: 22: Hoare triple {7812#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7812#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:23,629 INFO L273 TraceCheckUtils]: 23: Hoare triple {7812#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7813#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:23,630 INFO L273 TraceCheckUtils]: 24: Hoare triple {7813#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7813#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:23,630 INFO L273 TraceCheckUtils]: 25: Hoare triple {7813#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7814#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:23,631 INFO L273 TraceCheckUtils]: 26: Hoare triple {7814#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7814#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:23,632 INFO L273 TraceCheckUtils]: 27: Hoare triple {7814#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7815#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:23,632 INFO L273 TraceCheckUtils]: 28: Hoare triple {7815#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7815#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:23,633 INFO L273 TraceCheckUtils]: 29: Hoare triple {7815#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7816#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:23,633 INFO L273 TraceCheckUtils]: 30: Hoare triple {7816#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7816#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:23,634 INFO L273 TraceCheckUtils]: 31: Hoare triple {7816#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7817#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:23,635 INFO L273 TraceCheckUtils]: 32: Hoare triple {7817#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7817#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:23,635 INFO L273 TraceCheckUtils]: 33: Hoare triple {7817#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7818#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:23,636 INFO L273 TraceCheckUtils]: 34: Hoare triple {7818#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7818#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:23,637 INFO L273 TraceCheckUtils]: 35: Hoare triple {7818#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7819#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:23,637 INFO L273 TraceCheckUtils]: 36: Hoare triple {7819#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7819#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:23,638 INFO L273 TraceCheckUtils]: 37: Hoare triple {7819#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7820#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:23,639 INFO L273 TraceCheckUtils]: 38: Hoare triple {7820#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7820#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:23,639 INFO L273 TraceCheckUtils]: 39: Hoare triple {7820#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7821#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:23,640 INFO L273 TraceCheckUtils]: 40: Hoare triple {7821#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7821#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:23,641 INFO L273 TraceCheckUtils]: 41: Hoare triple {7821#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7822#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:23,641 INFO L273 TraceCheckUtils]: 42: Hoare triple {7822#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7822#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:23,642 INFO L273 TraceCheckUtils]: 43: Hoare triple {7822#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7823#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:23,642 INFO L273 TraceCheckUtils]: 44: Hoare triple {7823#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7823#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:23,643 INFO L273 TraceCheckUtils]: 45: Hoare triple {7823#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7824#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:23,644 INFO L273 TraceCheckUtils]: 46: Hoare triple {7824#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7824#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:23,644 INFO L273 TraceCheckUtils]: 47: Hoare triple {7824#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7825#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:23,645 INFO L273 TraceCheckUtils]: 48: Hoare triple {7825#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7825#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:23,646 INFO L273 TraceCheckUtils]: 49: Hoare triple {7825#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7826#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:23,646 INFO L273 TraceCheckUtils]: 50: Hoare triple {7826#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7826#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:23,647 INFO L273 TraceCheckUtils]: 51: Hoare triple {7826#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7827#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:23,647 INFO L273 TraceCheckUtils]: 52: Hoare triple {7827#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7827#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:23,648 INFO L273 TraceCheckUtils]: 53: Hoare triple {7827#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7828#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:23,649 INFO L273 TraceCheckUtils]: 54: Hoare triple {7828#(<= main_~i~0 24)} assume !(~i~0 < 1024); {7803#false} is VALID [2018-11-23 13:05:23,649 INFO L273 TraceCheckUtils]: 55: Hoare triple {7803#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {7803#false} is VALID [2018-11-23 13:05:23,649 INFO L256 TraceCheckUtils]: 56: Hoare triple {7803#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {7803#false} is VALID [2018-11-23 13:05:23,649 INFO L273 TraceCheckUtils]: 57: Hoare triple {7803#false} ~cond := #in~cond; {7803#false} is VALID [2018-11-23 13:05:23,650 INFO L273 TraceCheckUtils]: 58: Hoare triple {7803#false} assume 0 == ~cond; {7803#false} is VALID [2018-11-23 13:05:23,650 INFO L273 TraceCheckUtils]: 59: Hoare triple {7803#false} assume !false; {7803#false} is VALID [2018-11-23 13:05:23,654 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:23,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:23,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-11-23 13:05:23,673 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-11-23 13:05:23,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:23,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 13:05:23,734 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 13:05:23,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 13:05:23,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 13:05:23,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 13:05:23,736 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2018-11-23 13:05:24,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:24,036 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-11-23 13:05:24,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 13:05:24,037 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-11-23 13:05:24,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:24,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:05:24,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 70 transitions. [2018-11-23 13:05:24,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:05:24,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 70 transitions. [2018-11-23 13:05:24,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 70 transitions. [2018-11-23 13:05:24,107 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:24,109 INFO L225 Difference]: With dead ends: 70 [2018-11-23 13:05:24,109 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 13:05:24,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 13:05:24,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 13:05:24,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-11-23 13:05:24,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:24,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 63 states. [2018-11-23 13:05:24,133 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 63 states. [2018-11-23 13:05:24,133 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 63 states. [2018-11-23 13:05:24,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:24,135 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-11-23 13:05:24,135 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-11-23 13:05:24,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:24,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:24,136 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 64 states. [2018-11-23 13:05:24,136 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 64 states. [2018-11-23 13:05:24,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:24,137 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-11-23 13:05:24,137 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-11-23 13:05:24,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:24,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:24,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:24,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:24,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 13:05:24,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-11-23 13:05:24,138 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-11-23 13:05:24,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:24,139 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-11-23 13:05:24,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 13:05:24,139 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-11-23 13:05:24,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 13:05:24,140 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:24,140 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:24,140 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:24,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:24,140 INFO L82 PathProgramCache]: Analyzing trace with hash 614656239, now seen corresponding path program 25 times [2018-11-23 13:05:24,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:24,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:24,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:24,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:24,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:25,162 INFO L256 TraceCheckUtils]: 0: Hoare triple {8336#true} call ULTIMATE.init(); {8336#true} is VALID [2018-11-23 13:05:25,162 INFO L273 TraceCheckUtils]: 1: Hoare triple {8336#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8336#true} is VALID [2018-11-23 13:05:25,162 INFO L273 TraceCheckUtils]: 2: Hoare triple {8336#true} assume true; {8336#true} is VALID [2018-11-23 13:05:25,162 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8336#true} {8336#true} #35#return; {8336#true} is VALID [2018-11-23 13:05:25,162 INFO L256 TraceCheckUtils]: 4: Hoare triple {8336#true} call #t~ret2 := main(); {8336#true} is VALID [2018-11-23 13:05:25,163 INFO L273 TraceCheckUtils]: 5: Hoare triple {8336#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {8338#(= main_~i~0 0)} is VALID [2018-11-23 13:05:25,163 INFO L273 TraceCheckUtils]: 6: Hoare triple {8338#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8338#(= main_~i~0 0)} is VALID [2018-11-23 13:05:25,163 INFO L273 TraceCheckUtils]: 7: Hoare triple {8338#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8339#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:25,164 INFO L273 TraceCheckUtils]: 8: Hoare triple {8339#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8339#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:25,164 INFO L273 TraceCheckUtils]: 9: Hoare triple {8339#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8340#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:25,165 INFO L273 TraceCheckUtils]: 10: Hoare triple {8340#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8340#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:25,166 INFO L273 TraceCheckUtils]: 11: Hoare triple {8340#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8341#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:25,166 INFO L273 TraceCheckUtils]: 12: Hoare triple {8341#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8341#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:25,167 INFO L273 TraceCheckUtils]: 13: Hoare triple {8341#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8342#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:25,167 INFO L273 TraceCheckUtils]: 14: Hoare triple {8342#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8342#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:25,168 INFO L273 TraceCheckUtils]: 15: Hoare triple {8342#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8343#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:25,169 INFO L273 TraceCheckUtils]: 16: Hoare triple {8343#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8343#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:25,169 INFO L273 TraceCheckUtils]: 17: Hoare triple {8343#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8344#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:25,170 INFO L273 TraceCheckUtils]: 18: Hoare triple {8344#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8344#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:25,171 INFO L273 TraceCheckUtils]: 19: Hoare triple {8344#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8345#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:25,171 INFO L273 TraceCheckUtils]: 20: Hoare triple {8345#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8345#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:25,172 INFO L273 TraceCheckUtils]: 21: Hoare triple {8345#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8346#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:25,172 INFO L273 TraceCheckUtils]: 22: Hoare triple {8346#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8346#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:25,173 INFO L273 TraceCheckUtils]: 23: Hoare triple {8346#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8347#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:25,174 INFO L273 TraceCheckUtils]: 24: Hoare triple {8347#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8347#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:25,174 INFO L273 TraceCheckUtils]: 25: Hoare triple {8347#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8348#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:25,175 INFO L273 TraceCheckUtils]: 26: Hoare triple {8348#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8348#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:25,176 INFO L273 TraceCheckUtils]: 27: Hoare triple {8348#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8349#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:25,176 INFO L273 TraceCheckUtils]: 28: Hoare triple {8349#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8349#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:25,177 INFO L273 TraceCheckUtils]: 29: Hoare triple {8349#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8350#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:25,178 INFO L273 TraceCheckUtils]: 30: Hoare triple {8350#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8350#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:25,178 INFO L273 TraceCheckUtils]: 31: Hoare triple {8350#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8351#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:25,179 INFO L273 TraceCheckUtils]: 32: Hoare triple {8351#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8351#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:25,180 INFO L273 TraceCheckUtils]: 33: Hoare triple {8351#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8352#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:25,180 INFO L273 TraceCheckUtils]: 34: Hoare triple {8352#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8352#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:25,181 INFO L273 TraceCheckUtils]: 35: Hoare triple {8352#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8353#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:25,181 INFO L273 TraceCheckUtils]: 36: Hoare triple {8353#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8353#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:25,182 INFO L273 TraceCheckUtils]: 37: Hoare triple {8353#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8354#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:25,183 INFO L273 TraceCheckUtils]: 38: Hoare triple {8354#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8354#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:25,183 INFO L273 TraceCheckUtils]: 39: Hoare triple {8354#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8355#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:25,184 INFO L273 TraceCheckUtils]: 40: Hoare triple {8355#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8355#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:25,185 INFO L273 TraceCheckUtils]: 41: Hoare triple {8355#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8356#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:25,185 INFO L273 TraceCheckUtils]: 42: Hoare triple {8356#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8356#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:25,186 INFO L273 TraceCheckUtils]: 43: Hoare triple {8356#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8357#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:25,186 INFO L273 TraceCheckUtils]: 44: Hoare triple {8357#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8357#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:25,187 INFO L273 TraceCheckUtils]: 45: Hoare triple {8357#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8358#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:25,188 INFO L273 TraceCheckUtils]: 46: Hoare triple {8358#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8358#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:25,188 INFO L273 TraceCheckUtils]: 47: Hoare triple {8358#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8359#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:25,189 INFO L273 TraceCheckUtils]: 48: Hoare triple {8359#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8359#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:25,190 INFO L273 TraceCheckUtils]: 49: Hoare triple {8359#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8360#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:25,190 INFO L273 TraceCheckUtils]: 50: Hoare triple {8360#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8360#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:25,191 INFO L273 TraceCheckUtils]: 51: Hoare triple {8360#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8361#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:25,191 INFO L273 TraceCheckUtils]: 52: Hoare triple {8361#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8361#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:25,192 INFO L273 TraceCheckUtils]: 53: Hoare triple {8361#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8362#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:25,193 INFO L273 TraceCheckUtils]: 54: Hoare triple {8362#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8362#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:25,193 INFO L273 TraceCheckUtils]: 55: Hoare triple {8362#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8363#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:25,194 INFO L273 TraceCheckUtils]: 56: Hoare triple {8363#(<= main_~i~0 25)} assume !(~i~0 < 1024); {8337#false} is VALID [2018-11-23 13:05:25,194 INFO L273 TraceCheckUtils]: 57: Hoare triple {8337#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {8337#false} is VALID [2018-11-23 13:05:25,195 INFO L256 TraceCheckUtils]: 58: Hoare triple {8337#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {8337#false} is VALID [2018-11-23 13:05:25,195 INFO L273 TraceCheckUtils]: 59: Hoare triple {8337#false} ~cond := #in~cond; {8337#false} is VALID [2018-11-23 13:05:25,195 INFO L273 TraceCheckUtils]: 60: Hoare triple {8337#false} assume 0 == ~cond; {8337#false} is VALID [2018-11-23 13:05:25,195 INFO L273 TraceCheckUtils]: 61: Hoare triple {8337#false} assume !false; {8337#false} is VALID [2018-11-23 13:05:25,201 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:25,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:25,201 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:25,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:25,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:25,504 INFO L256 TraceCheckUtils]: 0: Hoare triple {8336#true} call ULTIMATE.init(); {8336#true} is VALID [2018-11-23 13:05:25,505 INFO L273 TraceCheckUtils]: 1: Hoare triple {8336#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8336#true} is VALID [2018-11-23 13:05:25,505 INFO L273 TraceCheckUtils]: 2: Hoare triple {8336#true} assume true; {8336#true} is VALID [2018-11-23 13:05:25,505 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8336#true} {8336#true} #35#return; {8336#true} is VALID [2018-11-23 13:05:25,505 INFO L256 TraceCheckUtils]: 4: Hoare triple {8336#true} call #t~ret2 := main(); {8336#true} is VALID [2018-11-23 13:05:25,506 INFO L273 TraceCheckUtils]: 5: Hoare triple {8336#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {8382#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:25,506 INFO L273 TraceCheckUtils]: 6: Hoare triple {8382#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8382#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:25,507 INFO L273 TraceCheckUtils]: 7: Hoare triple {8382#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8339#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:25,507 INFO L273 TraceCheckUtils]: 8: Hoare triple {8339#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8339#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:25,508 INFO L273 TraceCheckUtils]: 9: Hoare triple {8339#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8340#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:25,508 INFO L273 TraceCheckUtils]: 10: Hoare triple {8340#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8340#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:25,508 INFO L273 TraceCheckUtils]: 11: Hoare triple {8340#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8341#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:25,509 INFO L273 TraceCheckUtils]: 12: Hoare triple {8341#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8341#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:25,509 INFO L273 TraceCheckUtils]: 13: Hoare triple {8341#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8342#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:25,510 INFO L273 TraceCheckUtils]: 14: Hoare triple {8342#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8342#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:25,510 INFO L273 TraceCheckUtils]: 15: Hoare triple {8342#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8343#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:25,511 INFO L273 TraceCheckUtils]: 16: Hoare triple {8343#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8343#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:25,512 INFO L273 TraceCheckUtils]: 17: Hoare triple {8343#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8344#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:25,512 INFO L273 TraceCheckUtils]: 18: Hoare triple {8344#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8344#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:25,513 INFO L273 TraceCheckUtils]: 19: Hoare triple {8344#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8345#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:25,513 INFO L273 TraceCheckUtils]: 20: Hoare triple {8345#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8345#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:25,514 INFO L273 TraceCheckUtils]: 21: Hoare triple {8345#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8346#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:25,515 INFO L273 TraceCheckUtils]: 22: Hoare triple {8346#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8346#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:25,515 INFO L273 TraceCheckUtils]: 23: Hoare triple {8346#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8347#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:25,516 INFO L273 TraceCheckUtils]: 24: Hoare triple {8347#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8347#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:25,517 INFO L273 TraceCheckUtils]: 25: Hoare triple {8347#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8348#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:25,517 INFO L273 TraceCheckUtils]: 26: Hoare triple {8348#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8348#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:25,518 INFO L273 TraceCheckUtils]: 27: Hoare triple {8348#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8349#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:25,519 INFO L273 TraceCheckUtils]: 28: Hoare triple {8349#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8349#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:25,519 INFO L273 TraceCheckUtils]: 29: Hoare triple {8349#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8350#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:25,520 INFO L273 TraceCheckUtils]: 30: Hoare triple {8350#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8350#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:25,521 INFO L273 TraceCheckUtils]: 31: Hoare triple {8350#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8351#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:25,521 INFO L273 TraceCheckUtils]: 32: Hoare triple {8351#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8351#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:25,522 INFO L273 TraceCheckUtils]: 33: Hoare triple {8351#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8352#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:25,522 INFO L273 TraceCheckUtils]: 34: Hoare triple {8352#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8352#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:25,523 INFO L273 TraceCheckUtils]: 35: Hoare triple {8352#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8353#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:25,524 INFO L273 TraceCheckUtils]: 36: Hoare triple {8353#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8353#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:25,524 INFO L273 TraceCheckUtils]: 37: Hoare triple {8353#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8354#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:25,525 INFO L273 TraceCheckUtils]: 38: Hoare triple {8354#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8354#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:25,526 INFO L273 TraceCheckUtils]: 39: Hoare triple {8354#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8355#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:25,526 INFO L273 TraceCheckUtils]: 40: Hoare triple {8355#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8355#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:25,527 INFO L273 TraceCheckUtils]: 41: Hoare triple {8355#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8356#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:25,546 INFO L273 TraceCheckUtils]: 42: Hoare triple {8356#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8356#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:25,560 INFO L273 TraceCheckUtils]: 43: Hoare triple {8356#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8357#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:25,573 INFO L273 TraceCheckUtils]: 44: Hoare triple {8357#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8357#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:25,582 INFO L273 TraceCheckUtils]: 45: Hoare triple {8357#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8358#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:25,596 INFO L273 TraceCheckUtils]: 46: Hoare triple {8358#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8358#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:25,605 INFO L273 TraceCheckUtils]: 47: Hoare triple {8358#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8359#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:25,613 INFO L273 TraceCheckUtils]: 48: Hoare triple {8359#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8359#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:25,618 INFO L273 TraceCheckUtils]: 49: Hoare triple {8359#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8360#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:25,626 INFO L273 TraceCheckUtils]: 50: Hoare triple {8360#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8360#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:25,639 INFO L273 TraceCheckUtils]: 51: Hoare triple {8360#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8361#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:25,653 INFO L273 TraceCheckUtils]: 52: Hoare triple {8361#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8361#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:25,666 INFO L273 TraceCheckUtils]: 53: Hoare triple {8361#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8362#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:25,674 INFO L273 TraceCheckUtils]: 54: Hoare triple {8362#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8362#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:25,687 INFO L273 TraceCheckUtils]: 55: Hoare triple {8362#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8363#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:25,699 INFO L273 TraceCheckUtils]: 56: Hoare triple {8363#(<= main_~i~0 25)} assume !(~i~0 < 1024); {8337#false} is VALID [2018-11-23 13:05:25,700 INFO L273 TraceCheckUtils]: 57: Hoare triple {8337#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {8337#false} is VALID [2018-11-23 13:05:25,700 INFO L256 TraceCheckUtils]: 58: Hoare triple {8337#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {8337#false} is VALID [2018-11-23 13:05:25,700 INFO L273 TraceCheckUtils]: 59: Hoare triple {8337#false} ~cond := #in~cond; {8337#false} is VALID [2018-11-23 13:05:25,700 INFO L273 TraceCheckUtils]: 60: Hoare triple {8337#false} assume 0 == ~cond; {8337#false} is VALID [2018-11-23 13:05:25,700 INFO L273 TraceCheckUtils]: 61: Hoare triple {8337#false} assume !false; {8337#false} is VALID [2018-11-23 13:05:25,705 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:25,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:25,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 13:05:25,739 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2018-11-23 13:05:25,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:25,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 13:05:26,073 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:26,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 13:05:26,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 13:05:26,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 13:05:26,074 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 29 states. [2018-11-23 13:05:26,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:26,548 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-11-23 13:05:26,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 13:05:26,549 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2018-11-23 13:05:26,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:26,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:05:26,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 72 transitions. [2018-11-23 13:05:26,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:05:26,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 72 transitions. [2018-11-23 13:05:26,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 72 transitions. [2018-11-23 13:05:26,618 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 13:05:26,619 INFO L225 Difference]: With dead ends: 72 [2018-11-23 13:05:26,619 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 13:05:26,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 13:05:26,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 13:05:26,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-11-23 13:05:26,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:26,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 65 states. [2018-11-23 13:05:26,639 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 65 states. [2018-11-23 13:05:26,639 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 65 states. [2018-11-23 13:05:26,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:26,641 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-23 13:05:26,641 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-11-23 13:05:26,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:26,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:26,642 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 66 states. [2018-11-23 13:05:26,642 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 66 states. [2018-11-23 13:05:26,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:26,643 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-23 13:05:26,643 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-11-23 13:05:26,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:26,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:26,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:26,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:26,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 13:05:26,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-11-23 13:05:26,645 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-11-23 13:05:26,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:26,645 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-11-23 13:05:26,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 13:05:26,645 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-11-23 13:05:26,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 13:05:26,646 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:26,646 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:26,646 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:26,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:26,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1433404433, now seen corresponding path program 26 times [2018-11-23 13:05:26,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:26,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:26,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:26,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:26,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:27,692 INFO L256 TraceCheckUtils]: 0: Hoare triple {8887#true} call ULTIMATE.init(); {8887#true} is VALID [2018-11-23 13:05:27,692 INFO L273 TraceCheckUtils]: 1: Hoare triple {8887#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8887#true} is VALID [2018-11-23 13:05:27,692 INFO L273 TraceCheckUtils]: 2: Hoare triple {8887#true} assume true; {8887#true} is VALID [2018-11-23 13:05:27,693 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8887#true} {8887#true} #35#return; {8887#true} is VALID [2018-11-23 13:05:27,693 INFO L256 TraceCheckUtils]: 4: Hoare triple {8887#true} call #t~ret2 := main(); {8887#true} is VALID [2018-11-23 13:05:27,693 INFO L273 TraceCheckUtils]: 5: Hoare triple {8887#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {8889#(= main_~i~0 0)} is VALID [2018-11-23 13:05:27,694 INFO L273 TraceCheckUtils]: 6: Hoare triple {8889#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8889#(= main_~i~0 0)} is VALID [2018-11-23 13:05:27,695 INFO L273 TraceCheckUtils]: 7: Hoare triple {8889#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8890#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:27,695 INFO L273 TraceCheckUtils]: 8: Hoare triple {8890#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8890#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:27,696 INFO L273 TraceCheckUtils]: 9: Hoare triple {8890#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8891#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:27,696 INFO L273 TraceCheckUtils]: 10: Hoare triple {8891#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8891#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:27,697 INFO L273 TraceCheckUtils]: 11: Hoare triple {8891#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8892#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:27,698 INFO L273 TraceCheckUtils]: 12: Hoare triple {8892#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8892#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:27,698 INFO L273 TraceCheckUtils]: 13: Hoare triple {8892#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8893#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:27,699 INFO L273 TraceCheckUtils]: 14: Hoare triple {8893#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8893#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:27,700 INFO L273 TraceCheckUtils]: 15: Hoare triple {8893#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8894#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:27,700 INFO L273 TraceCheckUtils]: 16: Hoare triple {8894#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8894#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:27,701 INFO L273 TraceCheckUtils]: 17: Hoare triple {8894#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8895#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:27,701 INFO L273 TraceCheckUtils]: 18: Hoare triple {8895#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8895#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:27,702 INFO L273 TraceCheckUtils]: 19: Hoare triple {8895#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8896#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:27,703 INFO L273 TraceCheckUtils]: 20: Hoare triple {8896#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8896#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:27,703 INFO L273 TraceCheckUtils]: 21: Hoare triple {8896#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8897#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:27,704 INFO L273 TraceCheckUtils]: 22: Hoare triple {8897#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8897#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:27,705 INFO L273 TraceCheckUtils]: 23: Hoare triple {8897#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8898#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:27,705 INFO L273 TraceCheckUtils]: 24: Hoare triple {8898#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8898#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:27,706 INFO L273 TraceCheckUtils]: 25: Hoare triple {8898#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8899#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:27,706 INFO L273 TraceCheckUtils]: 26: Hoare triple {8899#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8899#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:27,707 INFO L273 TraceCheckUtils]: 27: Hoare triple {8899#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8900#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:27,708 INFO L273 TraceCheckUtils]: 28: Hoare triple {8900#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8900#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:27,708 INFO L273 TraceCheckUtils]: 29: Hoare triple {8900#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8901#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:27,709 INFO L273 TraceCheckUtils]: 30: Hoare triple {8901#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8901#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:27,710 INFO L273 TraceCheckUtils]: 31: Hoare triple {8901#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8902#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:27,710 INFO L273 TraceCheckUtils]: 32: Hoare triple {8902#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8902#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:27,711 INFO L273 TraceCheckUtils]: 33: Hoare triple {8902#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8903#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:27,711 INFO L273 TraceCheckUtils]: 34: Hoare triple {8903#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8903#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:27,712 INFO L273 TraceCheckUtils]: 35: Hoare triple {8903#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8904#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:27,713 INFO L273 TraceCheckUtils]: 36: Hoare triple {8904#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8904#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:27,713 INFO L273 TraceCheckUtils]: 37: Hoare triple {8904#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8905#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:27,714 INFO L273 TraceCheckUtils]: 38: Hoare triple {8905#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8905#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:27,715 INFO L273 TraceCheckUtils]: 39: Hoare triple {8905#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8906#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:27,715 INFO L273 TraceCheckUtils]: 40: Hoare triple {8906#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8906#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:27,716 INFO L273 TraceCheckUtils]: 41: Hoare triple {8906#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8907#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:27,716 INFO L273 TraceCheckUtils]: 42: Hoare triple {8907#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8907#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:27,717 INFO L273 TraceCheckUtils]: 43: Hoare triple {8907#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8908#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:27,718 INFO L273 TraceCheckUtils]: 44: Hoare triple {8908#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8908#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:27,718 INFO L273 TraceCheckUtils]: 45: Hoare triple {8908#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8909#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:27,719 INFO L273 TraceCheckUtils]: 46: Hoare triple {8909#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8909#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:27,720 INFO L273 TraceCheckUtils]: 47: Hoare triple {8909#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8910#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:27,720 INFO L273 TraceCheckUtils]: 48: Hoare triple {8910#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8910#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:27,721 INFO L273 TraceCheckUtils]: 49: Hoare triple {8910#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8911#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:27,721 INFO L273 TraceCheckUtils]: 50: Hoare triple {8911#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8911#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:27,722 INFO L273 TraceCheckUtils]: 51: Hoare triple {8911#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8912#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:27,723 INFO L273 TraceCheckUtils]: 52: Hoare triple {8912#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8912#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:27,723 INFO L273 TraceCheckUtils]: 53: Hoare triple {8912#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8913#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:27,724 INFO L273 TraceCheckUtils]: 54: Hoare triple {8913#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8913#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:27,725 INFO L273 TraceCheckUtils]: 55: Hoare triple {8913#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8914#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:27,725 INFO L273 TraceCheckUtils]: 56: Hoare triple {8914#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8914#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:27,726 INFO L273 TraceCheckUtils]: 57: Hoare triple {8914#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8915#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:27,727 INFO L273 TraceCheckUtils]: 58: Hoare triple {8915#(<= main_~i~0 26)} assume !(~i~0 < 1024); {8888#false} is VALID [2018-11-23 13:05:27,727 INFO L273 TraceCheckUtils]: 59: Hoare triple {8888#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {8888#false} is VALID [2018-11-23 13:05:27,727 INFO L256 TraceCheckUtils]: 60: Hoare triple {8888#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {8888#false} is VALID [2018-11-23 13:05:27,727 INFO L273 TraceCheckUtils]: 61: Hoare triple {8888#false} ~cond := #in~cond; {8888#false} is VALID [2018-11-23 13:05:27,727 INFO L273 TraceCheckUtils]: 62: Hoare triple {8888#false} assume 0 == ~cond; {8888#false} is VALID [2018-11-23 13:05:27,728 INFO L273 TraceCheckUtils]: 63: Hoare triple {8888#false} assume !false; {8888#false} is VALID [2018-11-23 13:05:27,733 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:27,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:27,733 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:27,741 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:05:27,767 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:05:27,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:27,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:27,960 INFO L256 TraceCheckUtils]: 0: Hoare triple {8887#true} call ULTIMATE.init(); {8887#true} is VALID [2018-11-23 13:05:27,960 INFO L273 TraceCheckUtils]: 1: Hoare triple {8887#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8887#true} is VALID [2018-11-23 13:05:27,960 INFO L273 TraceCheckUtils]: 2: Hoare triple {8887#true} assume true; {8887#true} is VALID [2018-11-23 13:05:27,960 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8887#true} {8887#true} #35#return; {8887#true} is VALID [2018-11-23 13:05:27,961 INFO L256 TraceCheckUtils]: 4: Hoare triple {8887#true} call #t~ret2 := main(); {8887#true} is VALID [2018-11-23 13:05:27,961 INFO L273 TraceCheckUtils]: 5: Hoare triple {8887#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {8934#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:27,961 INFO L273 TraceCheckUtils]: 6: Hoare triple {8934#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8934#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:27,962 INFO L273 TraceCheckUtils]: 7: Hoare triple {8934#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8890#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:27,962 INFO L273 TraceCheckUtils]: 8: Hoare triple {8890#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8890#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:27,963 INFO L273 TraceCheckUtils]: 9: Hoare triple {8890#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8891#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:27,963 INFO L273 TraceCheckUtils]: 10: Hoare triple {8891#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8891#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:27,963 INFO L273 TraceCheckUtils]: 11: Hoare triple {8891#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8892#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:27,964 INFO L273 TraceCheckUtils]: 12: Hoare triple {8892#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8892#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:27,964 INFO L273 TraceCheckUtils]: 13: Hoare triple {8892#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8893#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:27,964 INFO L273 TraceCheckUtils]: 14: Hoare triple {8893#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8893#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:27,965 INFO L273 TraceCheckUtils]: 15: Hoare triple {8893#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8894#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:27,965 INFO L273 TraceCheckUtils]: 16: Hoare triple {8894#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8894#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:27,966 INFO L273 TraceCheckUtils]: 17: Hoare triple {8894#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8895#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:27,967 INFO L273 TraceCheckUtils]: 18: Hoare triple {8895#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8895#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:27,967 INFO L273 TraceCheckUtils]: 19: Hoare triple {8895#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8896#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:27,968 INFO L273 TraceCheckUtils]: 20: Hoare triple {8896#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8896#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:27,968 INFO L273 TraceCheckUtils]: 21: Hoare triple {8896#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8897#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:27,969 INFO L273 TraceCheckUtils]: 22: Hoare triple {8897#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8897#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:27,970 INFO L273 TraceCheckUtils]: 23: Hoare triple {8897#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8898#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:27,970 INFO L273 TraceCheckUtils]: 24: Hoare triple {8898#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8898#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:27,971 INFO L273 TraceCheckUtils]: 25: Hoare triple {8898#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8899#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:27,972 INFO L273 TraceCheckUtils]: 26: Hoare triple {8899#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8899#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:27,972 INFO L273 TraceCheckUtils]: 27: Hoare triple {8899#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8900#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:27,973 INFO L273 TraceCheckUtils]: 28: Hoare triple {8900#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8900#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:27,973 INFO L273 TraceCheckUtils]: 29: Hoare triple {8900#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8901#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:27,974 INFO L273 TraceCheckUtils]: 30: Hoare triple {8901#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8901#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:27,975 INFO L273 TraceCheckUtils]: 31: Hoare triple {8901#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8902#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:27,975 INFO L273 TraceCheckUtils]: 32: Hoare triple {8902#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8902#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:27,976 INFO L273 TraceCheckUtils]: 33: Hoare triple {8902#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8903#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:27,976 INFO L273 TraceCheckUtils]: 34: Hoare triple {8903#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8903#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:27,977 INFO L273 TraceCheckUtils]: 35: Hoare triple {8903#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8904#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:27,978 INFO L273 TraceCheckUtils]: 36: Hoare triple {8904#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8904#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:27,978 INFO L273 TraceCheckUtils]: 37: Hoare triple {8904#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8905#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:27,979 INFO L273 TraceCheckUtils]: 38: Hoare triple {8905#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8905#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:27,980 INFO L273 TraceCheckUtils]: 39: Hoare triple {8905#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8906#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:27,980 INFO L273 TraceCheckUtils]: 40: Hoare triple {8906#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8906#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:27,981 INFO L273 TraceCheckUtils]: 41: Hoare triple {8906#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8907#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:27,982 INFO L273 TraceCheckUtils]: 42: Hoare triple {8907#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8907#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:27,982 INFO L273 TraceCheckUtils]: 43: Hoare triple {8907#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8908#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:27,983 INFO L273 TraceCheckUtils]: 44: Hoare triple {8908#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8908#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:27,983 INFO L273 TraceCheckUtils]: 45: Hoare triple {8908#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8909#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:27,984 INFO L273 TraceCheckUtils]: 46: Hoare triple {8909#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8909#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:27,985 INFO L273 TraceCheckUtils]: 47: Hoare triple {8909#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8910#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:27,985 INFO L273 TraceCheckUtils]: 48: Hoare triple {8910#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8910#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:27,986 INFO L273 TraceCheckUtils]: 49: Hoare triple {8910#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8911#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:27,987 INFO L273 TraceCheckUtils]: 50: Hoare triple {8911#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8911#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:27,987 INFO L273 TraceCheckUtils]: 51: Hoare triple {8911#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8912#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:27,988 INFO L273 TraceCheckUtils]: 52: Hoare triple {8912#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8912#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:27,988 INFO L273 TraceCheckUtils]: 53: Hoare triple {8912#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8913#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:27,989 INFO L273 TraceCheckUtils]: 54: Hoare triple {8913#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8913#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:27,990 INFO L273 TraceCheckUtils]: 55: Hoare triple {8913#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8914#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:27,990 INFO L273 TraceCheckUtils]: 56: Hoare triple {8914#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8914#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:27,991 INFO L273 TraceCheckUtils]: 57: Hoare triple {8914#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8915#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:27,992 INFO L273 TraceCheckUtils]: 58: Hoare triple {8915#(<= main_~i~0 26)} assume !(~i~0 < 1024); {8888#false} is VALID [2018-11-23 13:05:27,992 INFO L273 TraceCheckUtils]: 59: Hoare triple {8888#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {8888#false} is VALID [2018-11-23 13:05:27,992 INFO L256 TraceCheckUtils]: 60: Hoare triple {8888#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {8888#false} is VALID [2018-11-23 13:05:27,992 INFO L273 TraceCheckUtils]: 61: Hoare triple {8888#false} ~cond := #in~cond; {8888#false} is VALID [2018-11-23 13:05:27,993 INFO L273 TraceCheckUtils]: 62: Hoare triple {8888#false} assume 0 == ~cond; {8888#false} is VALID [2018-11-23 13:05:27,993 INFO L273 TraceCheckUtils]: 63: Hoare triple {8888#false} assume !false; {8888#false} is VALID [2018-11-23 13:05:27,997 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:28,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:28,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 13:05:28,015 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 64 [2018-11-23 13:05:28,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:28,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 13:05:28,079 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:28,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 13:05:28,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 13:05:28,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 13:05:28,081 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 30 states. [2018-11-23 13:05:28,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:28,376 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-11-23 13:05:28,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 13:05:28,376 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 64 [2018-11-23 13:05:28,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:28,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:05:28,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 74 transitions. [2018-11-23 13:05:28,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:05:28,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 74 transitions. [2018-11-23 13:05:28,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 74 transitions. [2018-11-23 13:05:28,482 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:28,483 INFO L225 Difference]: With dead ends: 74 [2018-11-23 13:05:28,484 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 13:05:28,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 13:05:28,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 13:05:28,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-11-23 13:05:28,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:28,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 67 states. [2018-11-23 13:05:28,658 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 67 states. [2018-11-23 13:05:28,658 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 67 states. [2018-11-23 13:05:28,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:28,659 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-11-23 13:05:28,659 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-11-23 13:05:28,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:28,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:28,659 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 68 states. [2018-11-23 13:05:28,660 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 68 states. [2018-11-23 13:05:28,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:28,661 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-11-23 13:05:28,661 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-11-23 13:05:28,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:28,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:28,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:28,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:28,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 13:05:28,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-11-23 13:05:28,663 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-11-23 13:05:28,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:28,663 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-11-23 13:05:28,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 13:05:28,664 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-11-23 13:05:28,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 13:05:28,664 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:28,664 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:28,664 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:28,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:28,665 INFO L82 PathProgramCache]: Analyzing trace with hash -2023563597, now seen corresponding path program 27 times [2018-11-23 13:05:28,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:28,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:28,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:28,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:28,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:29,200 INFO L256 TraceCheckUtils]: 0: Hoare triple {9455#true} call ULTIMATE.init(); {9455#true} is VALID [2018-11-23 13:05:29,201 INFO L273 TraceCheckUtils]: 1: Hoare triple {9455#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9455#true} is VALID [2018-11-23 13:05:29,201 INFO L273 TraceCheckUtils]: 2: Hoare triple {9455#true} assume true; {9455#true} is VALID [2018-11-23 13:05:29,201 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9455#true} {9455#true} #35#return; {9455#true} is VALID [2018-11-23 13:05:29,201 INFO L256 TraceCheckUtils]: 4: Hoare triple {9455#true} call #t~ret2 := main(); {9455#true} is VALID [2018-11-23 13:05:29,202 INFO L273 TraceCheckUtils]: 5: Hoare triple {9455#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {9457#(= main_~i~0 0)} is VALID [2018-11-23 13:05:29,203 INFO L273 TraceCheckUtils]: 6: Hoare triple {9457#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9457#(= main_~i~0 0)} is VALID [2018-11-23 13:05:29,204 INFO L273 TraceCheckUtils]: 7: Hoare triple {9457#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9458#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:29,204 INFO L273 TraceCheckUtils]: 8: Hoare triple {9458#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9458#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:29,205 INFO L273 TraceCheckUtils]: 9: Hoare triple {9458#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9459#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:29,206 INFO L273 TraceCheckUtils]: 10: Hoare triple {9459#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9459#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:29,206 INFO L273 TraceCheckUtils]: 11: Hoare triple {9459#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9460#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:29,207 INFO L273 TraceCheckUtils]: 12: Hoare triple {9460#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9460#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:29,208 INFO L273 TraceCheckUtils]: 13: Hoare triple {9460#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9461#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:29,208 INFO L273 TraceCheckUtils]: 14: Hoare triple {9461#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9461#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:29,209 INFO L273 TraceCheckUtils]: 15: Hoare triple {9461#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9462#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:29,210 INFO L273 TraceCheckUtils]: 16: Hoare triple {9462#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9462#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:29,211 INFO L273 TraceCheckUtils]: 17: Hoare triple {9462#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9463#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:29,211 INFO L273 TraceCheckUtils]: 18: Hoare triple {9463#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9463#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:29,212 INFO L273 TraceCheckUtils]: 19: Hoare triple {9463#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9464#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:29,213 INFO L273 TraceCheckUtils]: 20: Hoare triple {9464#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9464#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:29,214 INFO L273 TraceCheckUtils]: 21: Hoare triple {9464#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9465#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:29,214 INFO L273 TraceCheckUtils]: 22: Hoare triple {9465#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9465#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:29,215 INFO L273 TraceCheckUtils]: 23: Hoare triple {9465#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9466#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:29,216 INFO L273 TraceCheckUtils]: 24: Hoare triple {9466#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9466#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:29,217 INFO L273 TraceCheckUtils]: 25: Hoare triple {9466#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9467#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:29,217 INFO L273 TraceCheckUtils]: 26: Hoare triple {9467#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9467#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:29,218 INFO L273 TraceCheckUtils]: 27: Hoare triple {9467#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9468#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:29,219 INFO L273 TraceCheckUtils]: 28: Hoare triple {9468#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9468#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:29,219 INFO L273 TraceCheckUtils]: 29: Hoare triple {9468#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9469#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:29,220 INFO L273 TraceCheckUtils]: 30: Hoare triple {9469#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9469#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:29,221 INFO L273 TraceCheckUtils]: 31: Hoare triple {9469#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9470#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:29,222 INFO L273 TraceCheckUtils]: 32: Hoare triple {9470#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9470#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:29,222 INFO L273 TraceCheckUtils]: 33: Hoare triple {9470#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9471#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:29,223 INFO L273 TraceCheckUtils]: 34: Hoare triple {9471#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9471#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:29,224 INFO L273 TraceCheckUtils]: 35: Hoare triple {9471#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9472#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:29,224 INFO L273 TraceCheckUtils]: 36: Hoare triple {9472#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9472#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:29,225 INFO L273 TraceCheckUtils]: 37: Hoare triple {9472#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9473#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:29,226 INFO L273 TraceCheckUtils]: 38: Hoare triple {9473#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9473#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:29,227 INFO L273 TraceCheckUtils]: 39: Hoare triple {9473#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9474#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:29,227 INFO L273 TraceCheckUtils]: 40: Hoare triple {9474#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9474#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:29,228 INFO L273 TraceCheckUtils]: 41: Hoare triple {9474#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9475#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:29,229 INFO L273 TraceCheckUtils]: 42: Hoare triple {9475#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9475#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:29,230 INFO L273 TraceCheckUtils]: 43: Hoare triple {9475#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9476#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:29,230 INFO L273 TraceCheckUtils]: 44: Hoare triple {9476#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9476#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:29,231 INFO L273 TraceCheckUtils]: 45: Hoare triple {9476#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9477#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:29,232 INFO L273 TraceCheckUtils]: 46: Hoare triple {9477#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9477#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:29,232 INFO L273 TraceCheckUtils]: 47: Hoare triple {9477#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9478#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:29,233 INFO L273 TraceCheckUtils]: 48: Hoare triple {9478#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9478#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:29,234 INFO L273 TraceCheckUtils]: 49: Hoare triple {9478#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9479#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:29,234 INFO L273 TraceCheckUtils]: 50: Hoare triple {9479#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9479#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:29,235 INFO L273 TraceCheckUtils]: 51: Hoare triple {9479#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9480#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:29,236 INFO L273 TraceCheckUtils]: 52: Hoare triple {9480#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9480#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:29,237 INFO L273 TraceCheckUtils]: 53: Hoare triple {9480#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9481#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:29,237 INFO L273 TraceCheckUtils]: 54: Hoare triple {9481#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9481#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:29,238 INFO L273 TraceCheckUtils]: 55: Hoare triple {9481#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9482#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:29,239 INFO L273 TraceCheckUtils]: 56: Hoare triple {9482#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9482#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:29,240 INFO L273 TraceCheckUtils]: 57: Hoare triple {9482#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9483#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:29,240 INFO L273 TraceCheckUtils]: 58: Hoare triple {9483#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9483#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:29,241 INFO L273 TraceCheckUtils]: 59: Hoare triple {9483#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9484#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:29,242 INFO L273 TraceCheckUtils]: 60: Hoare triple {9484#(<= main_~i~0 27)} assume !(~i~0 < 1024); {9456#false} is VALID [2018-11-23 13:05:29,242 INFO L273 TraceCheckUtils]: 61: Hoare triple {9456#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {9456#false} is VALID [2018-11-23 13:05:29,242 INFO L256 TraceCheckUtils]: 62: Hoare triple {9456#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {9456#false} is VALID [2018-11-23 13:05:29,243 INFO L273 TraceCheckUtils]: 63: Hoare triple {9456#false} ~cond := #in~cond; {9456#false} is VALID [2018-11-23 13:05:29,243 INFO L273 TraceCheckUtils]: 64: Hoare triple {9456#false} assume 0 == ~cond; {9456#false} is VALID [2018-11-23 13:05:29,243 INFO L273 TraceCheckUtils]: 65: Hoare triple {9456#false} assume !false; {9456#false} is VALID [2018-11-23 13:05:29,249 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:29,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:29,249 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:29,258 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:05:31,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-11-23 13:05:31,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:31,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:31,281 INFO L256 TraceCheckUtils]: 0: Hoare triple {9455#true} call ULTIMATE.init(); {9455#true} is VALID [2018-11-23 13:05:31,281 INFO L273 TraceCheckUtils]: 1: Hoare triple {9455#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9455#true} is VALID [2018-11-23 13:05:31,281 INFO L273 TraceCheckUtils]: 2: Hoare triple {9455#true} assume true; {9455#true} is VALID [2018-11-23 13:05:31,281 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9455#true} {9455#true} #35#return; {9455#true} is VALID [2018-11-23 13:05:31,282 INFO L256 TraceCheckUtils]: 4: Hoare triple {9455#true} call #t~ret2 := main(); {9455#true} is VALID [2018-11-23 13:05:31,283 INFO L273 TraceCheckUtils]: 5: Hoare triple {9455#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {9503#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:31,283 INFO L273 TraceCheckUtils]: 6: Hoare triple {9503#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9503#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:31,285 INFO L273 TraceCheckUtils]: 7: Hoare triple {9503#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9458#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:31,285 INFO L273 TraceCheckUtils]: 8: Hoare triple {9458#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9458#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:31,287 INFO L273 TraceCheckUtils]: 9: Hoare triple {9458#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9459#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:31,287 INFO L273 TraceCheckUtils]: 10: Hoare triple {9459#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9459#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:31,289 INFO L273 TraceCheckUtils]: 11: Hoare triple {9459#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9460#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:31,289 INFO L273 TraceCheckUtils]: 12: Hoare triple {9460#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9460#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:31,291 INFO L273 TraceCheckUtils]: 13: Hoare triple {9460#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9461#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:31,291 INFO L273 TraceCheckUtils]: 14: Hoare triple {9461#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9461#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:31,293 INFO L273 TraceCheckUtils]: 15: Hoare triple {9461#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9462#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:31,293 INFO L273 TraceCheckUtils]: 16: Hoare triple {9462#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9462#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:31,295 INFO L273 TraceCheckUtils]: 17: Hoare triple {9462#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9463#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:31,295 INFO L273 TraceCheckUtils]: 18: Hoare triple {9463#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9463#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:31,297 INFO L273 TraceCheckUtils]: 19: Hoare triple {9463#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9464#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:31,297 INFO L273 TraceCheckUtils]: 20: Hoare triple {9464#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9464#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:31,299 INFO L273 TraceCheckUtils]: 21: Hoare triple {9464#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9465#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:31,299 INFO L273 TraceCheckUtils]: 22: Hoare triple {9465#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9465#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:31,301 INFO L273 TraceCheckUtils]: 23: Hoare triple {9465#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9466#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:31,301 INFO L273 TraceCheckUtils]: 24: Hoare triple {9466#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9466#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:31,303 INFO L273 TraceCheckUtils]: 25: Hoare triple {9466#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9467#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:31,303 INFO L273 TraceCheckUtils]: 26: Hoare triple {9467#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9467#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:31,306 INFO L273 TraceCheckUtils]: 27: Hoare triple {9467#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9468#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:31,306 INFO L273 TraceCheckUtils]: 28: Hoare triple {9468#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9468#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:31,308 INFO L273 TraceCheckUtils]: 29: Hoare triple {9468#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9469#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:31,308 INFO L273 TraceCheckUtils]: 30: Hoare triple {9469#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9469#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:31,310 INFO L273 TraceCheckUtils]: 31: Hoare triple {9469#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9470#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:31,310 INFO L273 TraceCheckUtils]: 32: Hoare triple {9470#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9470#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:31,312 INFO L273 TraceCheckUtils]: 33: Hoare triple {9470#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9471#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:31,314 INFO L273 TraceCheckUtils]: 34: Hoare triple {9471#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9471#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:31,314 INFO L273 TraceCheckUtils]: 35: Hoare triple {9471#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9472#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:31,316 INFO L273 TraceCheckUtils]: 36: Hoare triple {9472#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9472#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:31,316 INFO L273 TraceCheckUtils]: 37: Hoare triple {9472#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9473#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:31,318 INFO L273 TraceCheckUtils]: 38: Hoare triple {9473#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9473#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:31,318 INFO L273 TraceCheckUtils]: 39: Hoare triple {9473#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9474#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:31,320 INFO L273 TraceCheckUtils]: 40: Hoare triple {9474#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9474#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:31,320 INFO L273 TraceCheckUtils]: 41: Hoare triple {9474#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9475#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:31,322 INFO L273 TraceCheckUtils]: 42: Hoare triple {9475#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9475#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:31,323 INFO L273 TraceCheckUtils]: 43: Hoare triple {9475#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9476#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:31,324 INFO L273 TraceCheckUtils]: 44: Hoare triple {9476#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9476#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:31,324 INFO L273 TraceCheckUtils]: 45: Hoare triple {9476#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9477#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:31,326 INFO L273 TraceCheckUtils]: 46: Hoare triple {9477#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9477#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:31,326 INFO L273 TraceCheckUtils]: 47: Hoare triple {9477#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9478#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:31,328 INFO L273 TraceCheckUtils]: 48: Hoare triple {9478#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9478#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:31,328 INFO L273 TraceCheckUtils]: 49: Hoare triple {9478#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9479#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:31,330 INFO L273 TraceCheckUtils]: 50: Hoare triple {9479#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9479#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:31,330 INFO L273 TraceCheckUtils]: 51: Hoare triple {9479#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9480#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:31,332 INFO L273 TraceCheckUtils]: 52: Hoare triple {9480#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9480#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:31,332 INFO L273 TraceCheckUtils]: 53: Hoare triple {9480#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9481#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:31,334 INFO L273 TraceCheckUtils]: 54: Hoare triple {9481#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9481#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:31,334 INFO L273 TraceCheckUtils]: 55: Hoare triple {9481#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9482#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:31,336 INFO L273 TraceCheckUtils]: 56: Hoare triple {9482#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9482#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:31,337 INFO L273 TraceCheckUtils]: 57: Hoare triple {9482#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9483#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:31,338 INFO L273 TraceCheckUtils]: 58: Hoare triple {9483#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9483#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:31,339 INFO L273 TraceCheckUtils]: 59: Hoare triple {9483#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9484#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:31,360 INFO L273 TraceCheckUtils]: 60: Hoare triple {9484#(<= main_~i~0 27)} assume !(~i~0 < 1024); {9456#false} is VALID [2018-11-23 13:05:31,360 INFO L273 TraceCheckUtils]: 61: Hoare triple {9456#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {9456#false} is VALID [2018-11-23 13:05:31,360 INFO L256 TraceCheckUtils]: 62: Hoare triple {9456#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {9456#false} is VALID [2018-11-23 13:05:31,360 INFO L273 TraceCheckUtils]: 63: Hoare triple {9456#false} ~cond := #in~cond; {9456#false} is VALID [2018-11-23 13:05:31,360 INFO L273 TraceCheckUtils]: 64: Hoare triple {9456#false} assume 0 == ~cond; {9456#false} is VALID [2018-11-23 13:05:31,360 INFO L273 TraceCheckUtils]: 65: Hoare triple {9456#false} assume !false; {9456#false} is VALID [2018-11-23 13:05:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:31,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:31,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-23 13:05:31,384 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 66 [2018-11-23 13:05:31,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:31,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 13:05:31,474 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 13:05:31,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 13:05:31,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 13:05:31,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 13:05:31,475 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 31 states. [2018-11-23 13:05:31,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:31,798 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-11-23 13:05:31,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 13:05:31,798 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 66 [2018-11-23 13:05:31,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:31,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:05:31,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 76 transitions. [2018-11-23 13:05:31,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:05:31,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 76 transitions. [2018-11-23 13:05:31,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 76 transitions. [2018-11-23 13:05:31,875 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:31,876 INFO L225 Difference]: With dead ends: 76 [2018-11-23 13:05:31,876 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 13:05:31,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 13:05:31,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 13:05:31,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-23 13:05:31,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:31,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 69 states. [2018-11-23 13:05:31,902 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 69 states. [2018-11-23 13:05:31,902 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 69 states. [2018-11-23 13:05:31,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:31,903 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-11-23 13:05:31,904 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-11-23 13:05:31,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:31,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:31,904 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 70 states. [2018-11-23 13:05:31,904 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 70 states. [2018-11-23 13:05:31,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:31,905 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-11-23 13:05:31,905 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-11-23 13:05:31,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:31,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:31,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:31,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:31,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 13:05:31,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-11-23 13:05:31,907 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-11-23 13:05:31,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:31,907 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-11-23 13:05:31,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 13:05:31,907 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-11-23 13:05:31,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 13:05:31,908 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:31,908 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:31,908 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:31,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:31,908 INFO L82 PathProgramCache]: Analyzing trace with hash 134846677, now seen corresponding path program 28 times [2018-11-23 13:05:31,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:31,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:31,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:31,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:31,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:32,389 INFO L256 TraceCheckUtils]: 0: Hoare triple {10040#true} call ULTIMATE.init(); {10040#true} is VALID [2018-11-23 13:05:32,389 INFO L273 TraceCheckUtils]: 1: Hoare triple {10040#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10040#true} is VALID [2018-11-23 13:05:32,389 INFO L273 TraceCheckUtils]: 2: Hoare triple {10040#true} assume true; {10040#true} is VALID [2018-11-23 13:05:32,389 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10040#true} {10040#true} #35#return; {10040#true} is VALID [2018-11-23 13:05:32,390 INFO L256 TraceCheckUtils]: 4: Hoare triple {10040#true} call #t~ret2 := main(); {10040#true} is VALID [2018-11-23 13:05:32,390 INFO L273 TraceCheckUtils]: 5: Hoare triple {10040#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {10042#(= main_~i~0 0)} is VALID [2018-11-23 13:05:32,390 INFO L273 TraceCheckUtils]: 6: Hoare triple {10042#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10042#(= main_~i~0 0)} is VALID [2018-11-23 13:05:32,391 INFO L273 TraceCheckUtils]: 7: Hoare triple {10042#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10043#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:32,391 INFO L273 TraceCheckUtils]: 8: Hoare triple {10043#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10043#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:32,392 INFO L273 TraceCheckUtils]: 9: Hoare triple {10043#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10044#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:32,393 INFO L273 TraceCheckUtils]: 10: Hoare triple {10044#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10044#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:32,393 INFO L273 TraceCheckUtils]: 11: Hoare triple {10044#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10045#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:32,394 INFO L273 TraceCheckUtils]: 12: Hoare triple {10045#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10045#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:32,394 INFO L273 TraceCheckUtils]: 13: Hoare triple {10045#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10046#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:32,395 INFO L273 TraceCheckUtils]: 14: Hoare triple {10046#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10046#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:32,396 INFO L273 TraceCheckUtils]: 15: Hoare triple {10046#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10047#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:32,396 INFO L273 TraceCheckUtils]: 16: Hoare triple {10047#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10047#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:32,397 INFO L273 TraceCheckUtils]: 17: Hoare triple {10047#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10048#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:32,397 INFO L273 TraceCheckUtils]: 18: Hoare triple {10048#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10048#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:32,398 INFO L273 TraceCheckUtils]: 19: Hoare triple {10048#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10049#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:32,398 INFO L273 TraceCheckUtils]: 20: Hoare triple {10049#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10049#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:32,399 INFO L273 TraceCheckUtils]: 21: Hoare triple {10049#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10050#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:32,400 INFO L273 TraceCheckUtils]: 22: Hoare triple {10050#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10050#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:32,400 INFO L273 TraceCheckUtils]: 23: Hoare triple {10050#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10051#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:32,401 INFO L273 TraceCheckUtils]: 24: Hoare triple {10051#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10051#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:32,402 INFO L273 TraceCheckUtils]: 25: Hoare triple {10051#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10052#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:32,402 INFO L273 TraceCheckUtils]: 26: Hoare triple {10052#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10052#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:32,403 INFO L273 TraceCheckUtils]: 27: Hoare triple {10052#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10053#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:32,403 INFO L273 TraceCheckUtils]: 28: Hoare triple {10053#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10053#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:32,404 INFO L273 TraceCheckUtils]: 29: Hoare triple {10053#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10054#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:32,405 INFO L273 TraceCheckUtils]: 30: Hoare triple {10054#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10054#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:32,405 INFO L273 TraceCheckUtils]: 31: Hoare triple {10054#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10055#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:32,406 INFO L273 TraceCheckUtils]: 32: Hoare triple {10055#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10055#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:32,407 INFO L273 TraceCheckUtils]: 33: Hoare triple {10055#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10056#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:32,407 INFO L273 TraceCheckUtils]: 34: Hoare triple {10056#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10056#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:32,408 INFO L273 TraceCheckUtils]: 35: Hoare triple {10056#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10057#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:32,408 INFO L273 TraceCheckUtils]: 36: Hoare triple {10057#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10057#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:32,409 INFO L273 TraceCheckUtils]: 37: Hoare triple {10057#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10058#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:32,409 INFO L273 TraceCheckUtils]: 38: Hoare triple {10058#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10058#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:32,410 INFO L273 TraceCheckUtils]: 39: Hoare triple {10058#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10059#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:32,411 INFO L273 TraceCheckUtils]: 40: Hoare triple {10059#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10059#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:32,411 INFO L273 TraceCheckUtils]: 41: Hoare triple {10059#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10060#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:32,412 INFO L273 TraceCheckUtils]: 42: Hoare triple {10060#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10060#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:32,412 INFO L273 TraceCheckUtils]: 43: Hoare triple {10060#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10061#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:32,413 INFO L273 TraceCheckUtils]: 44: Hoare triple {10061#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10061#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:32,414 INFO L273 TraceCheckUtils]: 45: Hoare triple {10061#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10062#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:32,414 INFO L273 TraceCheckUtils]: 46: Hoare triple {10062#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10062#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:32,415 INFO L273 TraceCheckUtils]: 47: Hoare triple {10062#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10063#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:32,415 INFO L273 TraceCheckUtils]: 48: Hoare triple {10063#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10063#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:32,416 INFO L273 TraceCheckUtils]: 49: Hoare triple {10063#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10064#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:32,416 INFO L273 TraceCheckUtils]: 50: Hoare triple {10064#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10064#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:32,417 INFO L273 TraceCheckUtils]: 51: Hoare triple {10064#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10065#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:32,418 INFO L273 TraceCheckUtils]: 52: Hoare triple {10065#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10065#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:32,418 INFO L273 TraceCheckUtils]: 53: Hoare triple {10065#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10066#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:32,419 INFO L273 TraceCheckUtils]: 54: Hoare triple {10066#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10066#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:32,420 INFO L273 TraceCheckUtils]: 55: Hoare triple {10066#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10067#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:32,420 INFO L273 TraceCheckUtils]: 56: Hoare triple {10067#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10067#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:32,421 INFO L273 TraceCheckUtils]: 57: Hoare triple {10067#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10068#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:32,421 INFO L273 TraceCheckUtils]: 58: Hoare triple {10068#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10068#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:32,422 INFO L273 TraceCheckUtils]: 59: Hoare triple {10068#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10069#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:32,422 INFO L273 TraceCheckUtils]: 60: Hoare triple {10069#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10069#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:32,423 INFO L273 TraceCheckUtils]: 61: Hoare triple {10069#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10070#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:32,424 INFO L273 TraceCheckUtils]: 62: Hoare triple {10070#(<= main_~i~0 28)} assume !(~i~0 < 1024); {10041#false} is VALID [2018-11-23 13:05:32,424 INFO L273 TraceCheckUtils]: 63: Hoare triple {10041#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {10041#false} is VALID [2018-11-23 13:05:32,424 INFO L256 TraceCheckUtils]: 64: Hoare triple {10041#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {10041#false} is VALID [2018-11-23 13:05:32,424 INFO L273 TraceCheckUtils]: 65: Hoare triple {10041#false} ~cond := #in~cond; {10041#false} is VALID [2018-11-23 13:05:32,425 INFO L273 TraceCheckUtils]: 66: Hoare triple {10041#false} assume 0 == ~cond; {10041#false} is VALID [2018-11-23 13:05:32,425 INFO L273 TraceCheckUtils]: 67: Hoare triple {10041#false} assume !false; {10041#false} is VALID [2018-11-23 13:05:32,429 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:32,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:32,429 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:32,438 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:05:32,463 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:05:32,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:32,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:32,718 INFO L256 TraceCheckUtils]: 0: Hoare triple {10040#true} call ULTIMATE.init(); {10040#true} is VALID [2018-11-23 13:05:32,718 INFO L273 TraceCheckUtils]: 1: Hoare triple {10040#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10040#true} is VALID [2018-11-23 13:05:32,718 INFO L273 TraceCheckUtils]: 2: Hoare triple {10040#true} assume true; {10040#true} is VALID [2018-11-23 13:05:32,718 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10040#true} {10040#true} #35#return; {10040#true} is VALID [2018-11-23 13:05:32,718 INFO L256 TraceCheckUtils]: 4: Hoare triple {10040#true} call #t~ret2 := main(); {10040#true} is VALID [2018-11-23 13:05:32,719 INFO L273 TraceCheckUtils]: 5: Hoare triple {10040#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {10089#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:32,720 INFO L273 TraceCheckUtils]: 6: Hoare triple {10089#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10089#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:32,720 INFO L273 TraceCheckUtils]: 7: Hoare triple {10089#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10043#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:32,721 INFO L273 TraceCheckUtils]: 8: Hoare triple {10043#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10043#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:32,721 INFO L273 TraceCheckUtils]: 9: Hoare triple {10043#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10044#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:32,721 INFO L273 TraceCheckUtils]: 10: Hoare triple {10044#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10044#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:32,722 INFO L273 TraceCheckUtils]: 11: Hoare triple {10044#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10045#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:32,722 INFO L273 TraceCheckUtils]: 12: Hoare triple {10045#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10045#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:32,723 INFO L273 TraceCheckUtils]: 13: Hoare triple {10045#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10046#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:32,723 INFO L273 TraceCheckUtils]: 14: Hoare triple {10046#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10046#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:32,724 INFO L273 TraceCheckUtils]: 15: Hoare triple {10046#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10047#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:32,725 INFO L273 TraceCheckUtils]: 16: Hoare triple {10047#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10047#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:32,725 INFO L273 TraceCheckUtils]: 17: Hoare triple {10047#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10048#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:32,726 INFO L273 TraceCheckUtils]: 18: Hoare triple {10048#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10048#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:32,726 INFO L273 TraceCheckUtils]: 19: Hoare triple {10048#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10049#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:32,727 INFO L273 TraceCheckUtils]: 20: Hoare triple {10049#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10049#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:32,728 INFO L273 TraceCheckUtils]: 21: Hoare triple {10049#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10050#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:32,728 INFO L273 TraceCheckUtils]: 22: Hoare triple {10050#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10050#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:32,729 INFO L273 TraceCheckUtils]: 23: Hoare triple {10050#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10051#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:32,729 INFO L273 TraceCheckUtils]: 24: Hoare triple {10051#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10051#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:32,730 INFO L273 TraceCheckUtils]: 25: Hoare triple {10051#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10052#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:32,731 INFO L273 TraceCheckUtils]: 26: Hoare triple {10052#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10052#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:32,731 INFO L273 TraceCheckUtils]: 27: Hoare triple {10052#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10053#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:32,732 INFO L273 TraceCheckUtils]: 28: Hoare triple {10053#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10053#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:32,732 INFO L273 TraceCheckUtils]: 29: Hoare triple {10053#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10054#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:32,733 INFO L273 TraceCheckUtils]: 30: Hoare triple {10054#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10054#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:32,734 INFO L273 TraceCheckUtils]: 31: Hoare triple {10054#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10055#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:32,734 INFO L273 TraceCheckUtils]: 32: Hoare triple {10055#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10055#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:32,735 INFO L273 TraceCheckUtils]: 33: Hoare triple {10055#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10056#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:32,735 INFO L273 TraceCheckUtils]: 34: Hoare triple {10056#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10056#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:32,736 INFO L273 TraceCheckUtils]: 35: Hoare triple {10056#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10057#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:32,737 INFO L273 TraceCheckUtils]: 36: Hoare triple {10057#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10057#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:32,737 INFO L273 TraceCheckUtils]: 37: Hoare triple {10057#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10058#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:32,738 INFO L273 TraceCheckUtils]: 38: Hoare triple {10058#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10058#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:32,738 INFO L273 TraceCheckUtils]: 39: Hoare triple {10058#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10059#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:32,739 INFO L273 TraceCheckUtils]: 40: Hoare triple {10059#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10059#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:32,740 INFO L273 TraceCheckUtils]: 41: Hoare triple {10059#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10060#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:32,740 INFO L273 TraceCheckUtils]: 42: Hoare triple {10060#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10060#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:32,741 INFO L273 TraceCheckUtils]: 43: Hoare triple {10060#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10061#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:32,741 INFO L273 TraceCheckUtils]: 44: Hoare triple {10061#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10061#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:32,742 INFO L273 TraceCheckUtils]: 45: Hoare triple {10061#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10062#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:32,743 INFO L273 TraceCheckUtils]: 46: Hoare triple {10062#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10062#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:32,743 INFO L273 TraceCheckUtils]: 47: Hoare triple {10062#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10063#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:32,744 INFO L273 TraceCheckUtils]: 48: Hoare triple {10063#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10063#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:32,745 INFO L273 TraceCheckUtils]: 49: Hoare triple {10063#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10064#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:32,745 INFO L273 TraceCheckUtils]: 50: Hoare triple {10064#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10064#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:32,746 INFO L273 TraceCheckUtils]: 51: Hoare triple {10064#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10065#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:32,746 INFO L273 TraceCheckUtils]: 52: Hoare triple {10065#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10065#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:32,747 INFO L273 TraceCheckUtils]: 53: Hoare triple {10065#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10066#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:32,747 INFO L273 TraceCheckUtils]: 54: Hoare triple {10066#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10066#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:32,748 INFO L273 TraceCheckUtils]: 55: Hoare triple {10066#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10067#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:32,749 INFO L273 TraceCheckUtils]: 56: Hoare triple {10067#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10067#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:32,749 INFO L273 TraceCheckUtils]: 57: Hoare triple {10067#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10068#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:32,750 INFO L273 TraceCheckUtils]: 58: Hoare triple {10068#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10068#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:32,750 INFO L273 TraceCheckUtils]: 59: Hoare triple {10068#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10069#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:32,751 INFO L273 TraceCheckUtils]: 60: Hoare triple {10069#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10069#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:32,752 INFO L273 TraceCheckUtils]: 61: Hoare triple {10069#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10070#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:32,752 INFO L273 TraceCheckUtils]: 62: Hoare triple {10070#(<= main_~i~0 28)} assume !(~i~0 < 1024); {10041#false} is VALID [2018-11-23 13:05:32,752 INFO L273 TraceCheckUtils]: 63: Hoare triple {10041#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {10041#false} is VALID [2018-11-23 13:05:32,753 INFO L256 TraceCheckUtils]: 64: Hoare triple {10041#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {10041#false} is VALID [2018-11-23 13:05:32,753 INFO L273 TraceCheckUtils]: 65: Hoare triple {10041#false} ~cond := #in~cond; {10041#false} is VALID [2018-11-23 13:05:32,753 INFO L273 TraceCheckUtils]: 66: Hoare triple {10041#false} assume 0 == ~cond; {10041#false} is VALID [2018-11-23 13:05:32,753 INFO L273 TraceCheckUtils]: 67: Hoare triple {10041#false} assume !false; {10041#false} is VALID [2018-11-23 13:05:32,757 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:32,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:32,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-23 13:05:32,776 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 68 [2018-11-23 13:05:32,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:32,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 13:05:32,842 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:32,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 13:05:32,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 13:05:32,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 13:05:32,844 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 32 states. [2018-11-23 13:05:33,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:33,179 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-11-23 13:05:33,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 13:05:33,180 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 68 [2018-11-23 13:05:33,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:33,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:05:33,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 78 transitions. [2018-11-23 13:05:33,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:05:33,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 78 transitions. [2018-11-23 13:05:33,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 78 transitions. [2018-11-23 13:05:33,256 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 13:05:33,258 INFO L225 Difference]: With dead ends: 78 [2018-11-23 13:05:33,258 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 13:05:33,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 13:05:33,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 13:05:33,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-11-23 13:05:33,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:33,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 71 states. [2018-11-23 13:05:33,285 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 71 states. [2018-11-23 13:05:33,286 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 71 states. [2018-11-23 13:05:33,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:33,287 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-11-23 13:05:33,287 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-11-23 13:05:33,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:33,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:33,288 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 72 states. [2018-11-23 13:05:33,288 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 72 states. [2018-11-23 13:05:33,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:33,289 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-11-23 13:05:33,289 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-11-23 13:05:33,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:33,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:33,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:33,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:33,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 13:05:33,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-11-23 13:05:33,291 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-11-23 13:05:33,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:33,291 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-11-23 13:05:33,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 13:05:33,291 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-11-23 13:05:33,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 13:05:33,291 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:33,291 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:33,292 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:33,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:33,292 INFO L82 PathProgramCache]: Analyzing trace with hash -102083977, now seen corresponding path program 29 times [2018-11-23 13:05:33,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:33,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:33,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:33,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:33,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:33,959 INFO L256 TraceCheckUtils]: 0: Hoare triple {10642#true} call ULTIMATE.init(); {10642#true} is VALID [2018-11-23 13:05:33,959 INFO L273 TraceCheckUtils]: 1: Hoare triple {10642#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10642#true} is VALID [2018-11-23 13:05:33,960 INFO L273 TraceCheckUtils]: 2: Hoare triple {10642#true} assume true; {10642#true} is VALID [2018-11-23 13:05:33,960 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10642#true} {10642#true} #35#return; {10642#true} is VALID [2018-11-23 13:05:33,960 INFO L256 TraceCheckUtils]: 4: Hoare triple {10642#true} call #t~ret2 := main(); {10642#true} is VALID [2018-11-23 13:05:33,961 INFO L273 TraceCheckUtils]: 5: Hoare triple {10642#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {10644#(= main_~i~0 0)} is VALID [2018-11-23 13:05:33,961 INFO L273 TraceCheckUtils]: 6: Hoare triple {10644#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10644#(= main_~i~0 0)} is VALID [2018-11-23 13:05:33,962 INFO L273 TraceCheckUtils]: 7: Hoare triple {10644#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10645#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:33,962 INFO L273 TraceCheckUtils]: 8: Hoare triple {10645#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10645#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:33,963 INFO L273 TraceCheckUtils]: 9: Hoare triple {10645#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10646#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:33,964 INFO L273 TraceCheckUtils]: 10: Hoare triple {10646#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10646#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:33,964 INFO L273 TraceCheckUtils]: 11: Hoare triple {10646#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10647#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:33,965 INFO L273 TraceCheckUtils]: 12: Hoare triple {10647#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10647#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:33,966 INFO L273 TraceCheckUtils]: 13: Hoare triple {10647#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10648#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:33,966 INFO L273 TraceCheckUtils]: 14: Hoare triple {10648#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10648#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:33,967 INFO L273 TraceCheckUtils]: 15: Hoare triple {10648#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10649#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:33,967 INFO L273 TraceCheckUtils]: 16: Hoare triple {10649#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10649#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:33,968 INFO L273 TraceCheckUtils]: 17: Hoare triple {10649#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10650#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:33,969 INFO L273 TraceCheckUtils]: 18: Hoare triple {10650#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10650#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:33,969 INFO L273 TraceCheckUtils]: 19: Hoare triple {10650#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10651#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:33,970 INFO L273 TraceCheckUtils]: 20: Hoare triple {10651#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10651#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:33,971 INFO L273 TraceCheckUtils]: 21: Hoare triple {10651#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10652#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:33,971 INFO L273 TraceCheckUtils]: 22: Hoare triple {10652#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10652#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:33,972 INFO L273 TraceCheckUtils]: 23: Hoare triple {10652#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10653#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:33,972 INFO L273 TraceCheckUtils]: 24: Hoare triple {10653#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10653#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:33,973 INFO L273 TraceCheckUtils]: 25: Hoare triple {10653#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10654#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:33,974 INFO L273 TraceCheckUtils]: 26: Hoare triple {10654#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10654#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:33,974 INFO L273 TraceCheckUtils]: 27: Hoare triple {10654#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10655#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:33,975 INFO L273 TraceCheckUtils]: 28: Hoare triple {10655#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10655#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:33,976 INFO L273 TraceCheckUtils]: 29: Hoare triple {10655#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10656#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:33,976 INFO L273 TraceCheckUtils]: 30: Hoare triple {10656#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10656#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:33,977 INFO L273 TraceCheckUtils]: 31: Hoare triple {10656#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10657#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:33,977 INFO L273 TraceCheckUtils]: 32: Hoare triple {10657#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10657#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:33,978 INFO L273 TraceCheckUtils]: 33: Hoare triple {10657#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10658#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:33,979 INFO L273 TraceCheckUtils]: 34: Hoare triple {10658#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10658#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:33,979 INFO L273 TraceCheckUtils]: 35: Hoare triple {10658#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10659#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:33,980 INFO L273 TraceCheckUtils]: 36: Hoare triple {10659#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10659#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:33,981 INFO L273 TraceCheckUtils]: 37: Hoare triple {10659#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10660#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:33,981 INFO L273 TraceCheckUtils]: 38: Hoare triple {10660#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10660#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:33,982 INFO L273 TraceCheckUtils]: 39: Hoare triple {10660#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10661#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:33,982 INFO L273 TraceCheckUtils]: 40: Hoare triple {10661#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10661#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:33,983 INFO L273 TraceCheckUtils]: 41: Hoare triple {10661#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10662#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:33,984 INFO L273 TraceCheckUtils]: 42: Hoare triple {10662#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10662#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:33,984 INFO L273 TraceCheckUtils]: 43: Hoare triple {10662#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10663#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:33,985 INFO L273 TraceCheckUtils]: 44: Hoare triple {10663#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10663#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:33,986 INFO L273 TraceCheckUtils]: 45: Hoare triple {10663#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10664#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:33,986 INFO L273 TraceCheckUtils]: 46: Hoare triple {10664#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10664#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:33,987 INFO L273 TraceCheckUtils]: 47: Hoare triple {10664#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10665#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:33,987 INFO L273 TraceCheckUtils]: 48: Hoare triple {10665#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10665#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:33,988 INFO L273 TraceCheckUtils]: 49: Hoare triple {10665#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10666#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:33,989 INFO L273 TraceCheckUtils]: 50: Hoare triple {10666#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10666#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:33,989 INFO L273 TraceCheckUtils]: 51: Hoare triple {10666#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10667#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:33,990 INFO L273 TraceCheckUtils]: 52: Hoare triple {10667#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10667#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:33,991 INFO L273 TraceCheckUtils]: 53: Hoare triple {10667#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10668#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:33,991 INFO L273 TraceCheckUtils]: 54: Hoare triple {10668#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10668#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:33,992 INFO L273 TraceCheckUtils]: 55: Hoare triple {10668#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10669#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:33,992 INFO L273 TraceCheckUtils]: 56: Hoare triple {10669#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10669#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:33,993 INFO L273 TraceCheckUtils]: 57: Hoare triple {10669#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10670#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:33,994 INFO L273 TraceCheckUtils]: 58: Hoare triple {10670#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10670#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:33,994 INFO L273 TraceCheckUtils]: 59: Hoare triple {10670#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10671#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:33,995 INFO L273 TraceCheckUtils]: 60: Hoare triple {10671#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10671#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:33,996 INFO L273 TraceCheckUtils]: 61: Hoare triple {10671#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10672#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:33,996 INFO L273 TraceCheckUtils]: 62: Hoare triple {10672#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10672#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:33,997 INFO L273 TraceCheckUtils]: 63: Hoare triple {10672#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10673#(<= main_~i~0 29)} is VALID [2018-11-23 13:05:33,997 INFO L273 TraceCheckUtils]: 64: Hoare triple {10673#(<= main_~i~0 29)} assume !(~i~0 < 1024); {10643#false} is VALID [2018-11-23 13:05:33,998 INFO L273 TraceCheckUtils]: 65: Hoare triple {10643#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {10643#false} is VALID [2018-11-23 13:05:33,998 INFO L256 TraceCheckUtils]: 66: Hoare triple {10643#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {10643#false} is VALID [2018-11-23 13:05:33,998 INFO L273 TraceCheckUtils]: 67: Hoare triple {10643#false} ~cond := #in~cond; {10643#false} is VALID [2018-11-23 13:05:33,998 INFO L273 TraceCheckUtils]: 68: Hoare triple {10643#false} assume 0 == ~cond; {10643#false} is VALID [2018-11-23 13:05:33,999 INFO L273 TraceCheckUtils]: 69: Hoare triple {10643#false} assume !false; {10643#false} is VALID [2018-11-23 13:05:34,004 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:34,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:34,004 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:34,012 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:05:34,685 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-11-23 13:05:34,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:34,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:34,961 INFO L256 TraceCheckUtils]: 0: Hoare triple {10642#true} call ULTIMATE.init(); {10642#true} is VALID [2018-11-23 13:05:34,961 INFO L273 TraceCheckUtils]: 1: Hoare triple {10642#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10642#true} is VALID [2018-11-23 13:05:34,961 INFO L273 TraceCheckUtils]: 2: Hoare triple {10642#true} assume true; {10642#true} is VALID [2018-11-23 13:05:34,961 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10642#true} {10642#true} #35#return; {10642#true} is VALID [2018-11-23 13:05:34,962 INFO L256 TraceCheckUtils]: 4: Hoare triple {10642#true} call #t~ret2 := main(); {10642#true} is VALID [2018-11-23 13:05:34,962 INFO L273 TraceCheckUtils]: 5: Hoare triple {10642#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {10692#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:34,963 INFO L273 TraceCheckUtils]: 6: Hoare triple {10692#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10692#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:34,963 INFO L273 TraceCheckUtils]: 7: Hoare triple {10692#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10645#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:34,964 INFO L273 TraceCheckUtils]: 8: Hoare triple {10645#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10645#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:34,964 INFO L273 TraceCheckUtils]: 9: Hoare triple {10645#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10646#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:34,965 INFO L273 TraceCheckUtils]: 10: Hoare triple {10646#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10646#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:34,965 INFO L273 TraceCheckUtils]: 11: Hoare triple {10646#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10647#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:34,965 INFO L273 TraceCheckUtils]: 12: Hoare triple {10647#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10647#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:34,966 INFO L273 TraceCheckUtils]: 13: Hoare triple {10647#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10648#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:34,967 INFO L273 TraceCheckUtils]: 14: Hoare triple {10648#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10648#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:34,967 INFO L273 TraceCheckUtils]: 15: Hoare triple {10648#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10649#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:34,968 INFO L273 TraceCheckUtils]: 16: Hoare triple {10649#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10649#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:34,969 INFO L273 TraceCheckUtils]: 17: Hoare triple {10649#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10650#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:34,969 INFO L273 TraceCheckUtils]: 18: Hoare triple {10650#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10650#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:34,970 INFO L273 TraceCheckUtils]: 19: Hoare triple {10650#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10651#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:34,970 INFO L273 TraceCheckUtils]: 20: Hoare triple {10651#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10651#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:34,971 INFO L273 TraceCheckUtils]: 21: Hoare triple {10651#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10652#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:34,972 INFO L273 TraceCheckUtils]: 22: Hoare triple {10652#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10652#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:34,972 INFO L273 TraceCheckUtils]: 23: Hoare triple {10652#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10653#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:34,973 INFO L273 TraceCheckUtils]: 24: Hoare triple {10653#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10653#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:34,974 INFO L273 TraceCheckUtils]: 25: Hoare triple {10653#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10654#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:34,974 INFO L273 TraceCheckUtils]: 26: Hoare triple {10654#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10654#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:34,975 INFO L273 TraceCheckUtils]: 27: Hoare triple {10654#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10655#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:34,975 INFO L273 TraceCheckUtils]: 28: Hoare triple {10655#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10655#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:34,976 INFO L273 TraceCheckUtils]: 29: Hoare triple {10655#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10656#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:34,977 INFO L273 TraceCheckUtils]: 30: Hoare triple {10656#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10656#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:34,977 INFO L273 TraceCheckUtils]: 31: Hoare triple {10656#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10657#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:34,978 INFO L273 TraceCheckUtils]: 32: Hoare triple {10657#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10657#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:34,979 INFO L273 TraceCheckUtils]: 33: Hoare triple {10657#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10658#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:34,979 INFO L273 TraceCheckUtils]: 34: Hoare triple {10658#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10658#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:34,980 INFO L273 TraceCheckUtils]: 35: Hoare triple {10658#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10659#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:34,980 INFO L273 TraceCheckUtils]: 36: Hoare triple {10659#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10659#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:34,981 INFO L273 TraceCheckUtils]: 37: Hoare triple {10659#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10660#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:34,982 INFO L273 TraceCheckUtils]: 38: Hoare triple {10660#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10660#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:34,982 INFO L273 TraceCheckUtils]: 39: Hoare triple {10660#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10661#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:34,983 INFO L273 TraceCheckUtils]: 40: Hoare triple {10661#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10661#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:34,984 INFO L273 TraceCheckUtils]: 41: Hoare triple {10661#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10662#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:34,984 INFO L273 TraceCheckUtils]: 42: Hoare triple {10662#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10662#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:34,985 INFO L273 TraceCheckUtils]: 43: Hoare triple {10662#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10663#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:34,985 INFO L273 TraceCheckUtils]: 44: Hoare triple {10663#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10663#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:34,986 INFO L273 TraceCheckUtils]: 45: Hoare triple {10663#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10664#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:34,987 INFO L273 TraceCheckUtils]: 46: Hoare triple {10664#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10664#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:34,987 INFO L273 TraceCheckUtils]: 47: Hoare triple {10664#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10665#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:34,988 INFO L273 TraceCheckUtils]: 48: Hoare triple {10665#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10665#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:34,989 INFO L273 TraceCheckUtils]: 49: Hoare triple {10665#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10666#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:34,989 INFO L273 TraceCheckUtils]: 50: Hoare triple {10666#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10666#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:34,990 INFO L273 TraceCheckUtils]: 51: Hoare triple {10666#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10667#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:34,990 INFO L273 TraceCheckUtils]: 52: Hoare triple {10667#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10667#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:34,991 INFO L273 TraceCheckUtils]: 53: Hoare triple {10667#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10668#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:34,992 INFO L273 TraceCheckUtils]: 54: Hoare triple {10668#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10668#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:34,992 INFO L273 TraceCheckUtils]: 55: Hoare triple {10668#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10669#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:34,993 INFO L273 TraceCheckUtils]: 56: Hoare triple {10669#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10669#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:34,994 INFO L273 TraceCheckUtils]: 57: Hoare triple {10669#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10670#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:34,994 INFO L273 TraceCheckUtils]: 58: Hoare triple {10670#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10670#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:34,995 INFO L273 TraceCheckUtils]: 59: Hoare triple {10670#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10671#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:34,995 INFO L273 TraceCheckUtils]: 60: Hoare triple {10671#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10671#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:34,996 INFO L273 TraceCheckUtils]: 61: Hoare triple {10671#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10672#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:34,997 INFO L273 TraceCheckUtils]: 62: Hoare triple {10672#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10672#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:34,997 INFO L273 TraceCheckUtils]: 63: Hoare triple {10672#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10673#(<= main_~i~0 29)} is VALID [2018-11-23 13:05:34,998 INFO L273 TraceCheckUtils]: 64: Hoare triple {10673#(<= main_~i~0 29)} assume !(~i~0 < 1024); {10643#false} is VALID [2018-11-23 13:05:34,998 INFO L273 TraceCheckUtils]: 65: Hoare triple {10643#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {10643#false} is VALID [2018-11-23 13:05:34,998 INFO L256 TraceCheckUtils]: 66: Hoare triple {10643#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {10643#false} is VALID [2018-11-23 13:05:34,999 INFO L273 TraceCheckUtils]: 67: Hoare triple {10643#false} ~cond := #in~cond; {10643#false} is VALID [2018-11-23 13:05:34,999 INFO L273 TraceCheckUtils]: 68: Hoare triple {10643#false} assume 0 == ~cond; {10643#false} is VALID [2018-11-23 13:05:34,999 INFO L273 TraceCheckUtils]: 69: Hoare triple {10643#false} assume !false; {10643#false} is VALID [2018-11-23 13:05:35,003 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:35,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:35,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-11-23 13:05:35,024 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 70 [2018-11-23 13:05:35,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:35,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 13:05:35,112 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:35,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 13:05:35,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 13:05:35,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 13:05:35,113 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 33 states. [2018-11-23 13:05:35,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:35,557 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-11-23 13:05:35,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 13:05:35,557 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 70 [2018-11-23 13:05:35,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:35,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:05:35,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 80 transitions. [2018-11-23 13:05:35,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:05:35,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 80 transitions. [2018-11-23 13:05:35,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 80 transitions. [2018-11-23 13:05:35,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:35,849 INFO L225 Difference]: With dead ends: 80 [2018-11-23 13:05:35,850 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 13:05:35,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 13:05:35,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 13:05:35,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-11-23 13:05:35,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:35,875 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 73 states. [2018-11-23 13:05:35,875 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 73 states. [2018-11-23 13:05:35,875 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 73 states. [2018-11-23 13:05:35,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:35,876 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-11-23 13:05:35,876 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-11-23 13:05:35,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:35,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:35,877 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 74 states. [2018-11-23 13:05:35,877 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 74 states. [2018-11-23 13:05:35,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:35,878 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-11-23 13:05:35,878 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-11-23 13:05:35,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:35,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:35,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:35,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:35,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 13:05:35,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-11-23 13:05:35,880 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-11-23 13:05:35,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:35,880 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-11-23 13:05:35,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 13:05:35,881 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-11-23 13:05:35,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 13:05:35,881 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:35,881 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:35,882 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:35,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:35,882 INFO L82 PathProgramCache]: Analyzing trace with hash -159175783, now seen corresponding path program 30 times [2018-11-23 13:05:35,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:35,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:35,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:35,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:35,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:36,928 INFO L256 TraceCheckUtils]: 0: Hoare triple {11261#true} call ULTIMATE.init(); {11261#true} is VALID [2018-11-23 13:05:36,928 INFO L273 TraceCheckUtils]: 1: Hoare triple {11261#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11261#true} is VALID [2018-11-23 13:05:36,929 INFO L273 TraceCheckUtils]: 2: Hoare triple {11261#true} assume true; {11261#true} is VALID [2018-11-23 13:05:36,929 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11261#true} {11261#true} #35#return; {11261#true} is VALID [2018-11-23 13:05:36,929 INFO L256 TraceCheckUtils]: 4: Hoare triple {11261#true} call #t~ret2 := main(); {11261#true} is VALID [2018-11-23 13:05:36,929 INFO L273 TraceCheckUtils]: 5: Hoare triple {11261#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {11263#(= main_~i~0 0)} is VALID [2018-11-23 13:05:36,930 INFO L273 TraceCheckUtils]: 6: Hoare triple {11263#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11263#(= main_~i~0 0)} is VALID [2018-11-23 13:05:36,930 INFO L273 TraceCheckUtils]: 7: Hoare triple {11263#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11264#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:36,931 INFO L273 TraceCheckUtils]: 8: Hoare triple {11264#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11264#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:36,931 INFO L273 TraceCheckUtils]: 9: Hoare triple {11264#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11265#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:36,931 INFO L273 TraceCheckUtils]: 10: Hoare triple {11265#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11265#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:36,932 INFO L273 TraceCheckUtils]: 11: Hoare triple {11265#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11266#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:36,932 INFO L273 TraceCheckUtils]: 12: Hoare triple {11266#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11266#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:36,933 INFO L273 TraceCheckUtils]: 13: Hoare triple {11266#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11267#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:36,933 INFO L273 TraceCheckUtils]: 14: Hoare triple {11267#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11267#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:36,934 INFO L273 TraceCheckUtils]: 15: Hoare triple {11267#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11268#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:36,934 INFO L273 TraceCheckUtils]: 16: Hoare triple {11268#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11268#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:36,935 INFO L273 TraceCheckUtils]: 17: Hoare triple {11268#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11269#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:36,935 INFO L273 TraceCheckUtils]: 18: Hoare triple {11269#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11269#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:36,936 INFO L273 TraceCheckUtils]: 19: Hoare triple {11269#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11270#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:36,937 INFO L273 TraceCheckUtils]: 20: Hoare triple {11270#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11270#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:36,937 INFO L273 TraceCheckUtils]: 21: Hoare triple {11270#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11271#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:36,938 INFO L273 TraceCheckUtils]: 22: Hoare triple {11271#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11271#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:36,939 INFO L273 TraceCheckUtils]: 23: Hoare triple {11271#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11272#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:36,939 INFO L273 TraceCheckUtils]: 24: Hoare triple {11272#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11272#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:36,940 INFO L273 TraceCheckUtils]: 25: Hoare triple {11272#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11273#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:36,940 INFO L273 TraceCheckUtils]: 26: Hoare triple {11273#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11273#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:36,941 INFO L273 TraceCheckUtils]: 27: Hoare triple {11273#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11274#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:36,942 INFO L273 TraceCheckUtils]: 28: Hoare triple {11274#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11274#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:36,942 INFO L273 TraceCheckUtils]: 29: Hoare triple {11274#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11275#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:36,943 INFO L273 TraceCheckUtils]: 30: Hoare triple {11275#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11275#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:36,944 INFO L273 TraceCheckUtils]: 31: Hoare triple {11275#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11276#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:36,944 INFO L273 TraceCheckUtils]: 32: Hoare triple {11276#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11276#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:36,945 INFO L273 TraceCheckUtils]: 33: Hoare triple {11276#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11277#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:36,945 INFO L273 TraceCheckUtils]: 34: Hoare triple {11277#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11277#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:36,946 INFO L273 TraceCheckUtils]: 35: Hoare triple {11277#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11278#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:36,947 INFO L273 TraceCheckUtils]: 36: Hoare triple {11278#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11278#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:36,947 INFO L273 TraceCheckUtils]: 37: Hoare triple {11278#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11279#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:36,948 INFO L273 TraceCheckUtils]: 38: Hoare triple {11279#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11279#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:36,949 INFO L273 TraceCheckUtils]: 39: Hoare triple {11279#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11280#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:36,949 INFO L273 TraceCheckUtils]: 40: Hoare triple {11280#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11280#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:36,950 INFO L273 TraceCheckUtils]: 41: Hoare triple {11280#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11281#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:36,950 INFO L273 TraceCheckUtils]: 42: Hoare triple {11281#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11281#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:36,951 INFO L273 TraceCheckUtils]: 43: Hoare triple {11281#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11282#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:36,952 INFO L273 TraceCheckUtils]: 44: Hoare triple {11282#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11282#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:36,952 INFO L273 TraceCheckUtils]: 45: Hoare triple {11282#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11283#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:36,953 INFO L273 TraceCheckUtils]: 46: Hoare triple {11283#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11283#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:36,954 INFO L273 TraceCheckUtils]: 47: Hoare triple {11283#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11284#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:36,954 INFO L273 TraceCheckUtils]: 48: Hoare triple {11284#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11284#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:36,955 INFO L273 TraceCheckUtils]: 49: Hoare triple {11284#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11285#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:36,955 INFO L273 TraceCheckUtils]: 50: Hoare triple {11285#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11285#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:36,956 INFO L273 TraceCheckUtils]: 51: Hoare triple {11285#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11286#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:36,957 INFO L273 TraceCheckUtils]: 52: Hoare triple {11286#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11286#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:36,957 INFO L273 TraceCheckUtils]: 53: Hoare triple {11286#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11287#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:36,958 INFO L273 TraceCheckUtils]: 54: Hoare triple {11287#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11287#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:36,959 INFO L273 TraceCheckUtils]: 55: Hoare triple {11287#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11288#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:36,959 INFO L273 TraceCheckUtils]: 56: Hoare triple {11288#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11288#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:36,960 INFO L273 TraceCheckUtils]: 57: Hoare triple {11288#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11289#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:36,960 INFO L273 TraceCheckUtils]: 58: Hoare triple {11289#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11289#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:36,961 INFO L273 TraceCheckUtils]: 59: Hoare triple {11289#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11290#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:36,962 INFO L273 TraceCheckUtils]: 60: Hoare triple {11290#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11290#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:36,962 INFO L273 TraceCheckUtils]: 61: Hoare triple {11290#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11291#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:36,963 INFO L273 TraceCheckUtils]: 62: Hoare triple {11291#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11291#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:36,964 INFO L273 TraceCheckUtils]: 63: Hoare triple {11291#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11292#(<= main_~i~0 29)} is VALID [2018-11-23 13:05:36,964 INFO L273 TraceCheckUtils]: 64: Hoare triple {11292#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11292#(<= main_~i~0 29)} is VALID [2018-11-23 13:05:36,965 INFO L273 TraceCheckUtils]: 65: Hoare triple {11292#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11293#(<= main_~i~0 30)} is VALID [2018-11-23 13:05:36,966 INFO L273 TraceCheckUtils]: 66: Hoare triple {11293#(<= main_~i~0 30)} assume !(~i~0 < 1024); {11262#false} is VALID [2018-11-23 13:05:36,966 INFO L273 TraceCheckUtils]: 67: Hoare triple {11262#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {11262#false} is VALID [2018-11-23 13:05:36,966 INFO L256 TraceCheckUtils]: 68: Hoare triple {11262#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {11262#false} is VALID [2018-11-23 13:05:36,966 INFO L273 TraceCheckUtils]: 69: Hoare triple {11262#false} ~cond := #in~cond; {11262#false} is VALID [2018-11-23 13:05:36,966 INFO L273 TraceCheckUtils]: 70: Hoare triple {11262#false} assume 0 == ~cond; {11262#false} is VALID [2018-11-23 13:05:36,967 INFO L273 TraceCheckUtils]: 71: Hoare triple {11262#false} assume !false; {11262#false} is VALID [2018-11-23 13:05:36,973 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:36,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:36,973 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:36,980 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:05:40,055 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-11-23 13:05:40,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:40,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:40,318 INFO L256 TraceCheckUtils]: 0: Hoare triple {11261#true} call ULTIMATE.init(); {11261#true} is VALID [2018-11-23 13:05:40,318 INFO L273 TraceCheckUtils]: 1: Hoare triple {11261#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11261#true} is VALID [2018-11-23 13:05:40,318 INFO L273 TraceCheckUtils]: 2: Hoare triple {11261#true} assume true; {11261#true} is VALID [2018-11-23 13:05:40,319 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11261#true} {11261#true} #35#return; {11261#true} is VALID [2018-11-23 13:05:40,319 INFO L256 TraceCheckUtils]: 4: Hoare triple {11261#true} call #t~ret2 := main(); {11261#true} is VALID [2018-11-23 13:05:40,320 INFO L273 TraceCheckUtils]: 5: Hoare triple {11261#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {11312#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:40,320 INFO L273 TraceCheckUtils]: 6: Hoare triple {11312#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11312#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:40,321 INFO L273 TraceCheckUtils]: 7: Hoare triple {11312#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11264#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:40,321 INFO L273 TraceCheckUtils]: 8: Hoare triple {11264#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11264#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:40,321 INFO L273 TraceCheckUtils]: 9: Hoare triple {11264#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11265#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:40,322 INFO L273 TraceCheckUtils]: 10: Hoare triple {11265#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11265#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:40,322 INFO L273 TraceCheckUtils]: 11: Hoare triple {11265#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11266#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:40,323 INFO L273 TraceCheckUtils]: 12: Hoare triple {11266#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11266#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:40,323 INFO L273 TraceCheckUtils]: 13: Hoare triple {11266#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11267#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:40,324 INFO L273 TraceCheckUtils]: 14: Hoare triple {11267#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11267#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:40,325 INFO L273 TraceCheckUtils]: 15: Hoare triple {11267#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11268#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:40,325 INFO L273 TraceCheckUtils]: 16: Hoare triple {11268#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11268#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:40,326 INFO L273 TraceCheckUtils]: 17: Hoare triple {11268#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11269#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:40,326 INFO L273 TraceCheckUtils]: 18: Hoare triple {11269#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11269#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:40,327 INFO L273 TraceCheckUtils]: 19: Hoare triple {11269#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11270#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:40,328 INFO L273 TraceCheckUtils]: 20: Hoare triple {11270#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11270#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:40,328 INFO L273 TraceCheckUtils]: 21: Hoare triple {11270#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11271#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:40,329 INFO L273 TraceCheckUtils]: 22: Hoare triple {11271#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11271#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:40,330 INFO L273 TraceCheckUtils]: 23: Hoare triple {11271#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11272#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:40,330 INFO L273 TraceCheckUtils]: 24: Hoare triple {11272#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11272#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:40,331 INFO L273 TraceCheckUtils]: 25: Hoare triple {11272#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11273#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:40,331 INFO L273 TraceCheckUtils]: 26: Hoare triple {11273#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11273#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:40,332 INFO L273 TraceCheckUtils]: 27: Hoare triple {11273#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11274#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:40,333 INFO L273 TraceCheckUtils]: 28: Hoare triple {11274#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11274#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:40,333 INFO L273 TraceCheckUtils]: 29: Hoare triple {11274#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11275#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:40,334 INFO L273 TraceCheckUtils]: 30: Hoare triple {11275#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11275#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:40,335 INFO L273 TraceCheckUtils]: 31: Hoare triple {11275#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11276#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:40,335 INFO L273 TraceCheckUtils]: 32: Hoare triple {11276#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11276#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:40,336 INFO L273 TraceCheckUtils]: 33: Hoare triple {11276#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11277#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:40,336 INFO L273 TraceCheckUtils]: 34: Hoare triple {11277#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11277#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:40,337 INFO L273 TraceCheckUtils]: 35: Hoare triple {11277#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11278#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:40,338 INFO L273 TraceCheckUtils]: 36: Hoare triple {11278#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11278#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:40,338 INFO L273 TraceCheckUtils]: 37: Hoare triple {11278#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11279#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:40,339 INFO L273 TraceCheckUtils]: 38: Hoare triple {11279#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11279#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:40,340 INFO L273 TraceCheckUtils]: 39: Hoare triple {11279#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11280#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:40,340 INFO L273 TraceCheckUtils]: 40: Hoare triple {11280#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11280#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:40,341 INFO L273 TraceCheckUtils]: 41: Hoare triple {11280#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11281#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:40,341 INFO L273 TraceCheckUtils]: 42: Hoare triple {11281#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11281#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:40,342 INFO L273 TraceCheckUtils]: 43: Hoare triple {11281#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11282#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:40,343 INFO L273 TraceCheckUtils]: 44: Hoare triple {11282#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11282#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:40,343 INFO L273 TraceCheckUtils]: 45: Hoare triple {11282#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11283#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:40,344 INFO L273 TraceCheckUtils]: 46: Hoare triple {11283#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11283#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:40,345 INFO L273 TraceCheckUtils]: 47: Hoare triple {11283#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11284#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:40,345 INFO L273 TraceCheckUtils]: 48: Hoare triple {11284#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11284#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:40,346 INFO L273 TraceCheckUtils]: 49: Hoare triple {11284#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11285#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:40,346 INFO L273 TraceCheckUtils]: 50: Hoare triple {11285#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11285#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:40,347 INFO L273 TraceCheckUtils]: 51: Hoare triple {11285#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11286#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:40,348 INFO L273 TraceCheckUtils]: 52: Hoare triple {11286#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11286#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:40,348 INFO L273 TraceCheckUtils]: 53: Hoare triple {11286#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11287#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:40,349 INFO L273 TraceCheckUtils]: 54: Hoare triple {11287#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11287#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:40,350 INFO L273 TraceCheckUtils]: 55: Hoare triple {11287#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11288#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:40,350 INFO L273 TraceCheckUtils]: 56: Hoare triple {11288#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11288#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:40,351 INFO L273 TraceCheckUtils]: 57: Hoare triple {11288#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11289#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:40,351 INFO L273 TraceCheckUtils]: 58: Hoare triple {11289#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11289#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:40,352 INFO L273 TraceCheckUtils]: 59: Hoare triple {11289#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11290#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:40,353 INFO L273 TraceCheckUtils]: 60: Hoare triple {11290#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11290#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:40,353 INFO L273 TraceCheckUtils]: 61: Hoare triple {11290#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11291#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:40,354 INFO L273 TraceCheckUtils]: 62: Hoare triple {11291#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11291#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:40,354 INFO L273 TraceCheckUtils]: 63: Hoare triple {11291#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11292#(<= main_~i~0 29)} is VALID [2018-11-23 13:05:40,355 INFO L273 TraceCheckUtils]: 64: Hoare triple {11292#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11292#(<= main_~i~0 29)} is VALID [2018-11-23 13:05:40,356 INFO L273 TraceCheckUtils]: 65: Hoare triple {11292#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11293#(<= main_~i~0 30)} is VALID [2018-11-23 13:05:40,356 INFO L273 TraceCheckUtils]: 66: Hoare triple {11293#(<= main_~i~0 30)} assume !(~i~0 < 1024); {11262#false} is VALID [2018-11-23 13:05:40,357 INFO L273 TraceCheckUtils]: 67: Hoare triple {11262#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {11262#false} is VALID [2018-11-23 13:05:40,357 INFO L256 TraceCheckUtils]: 68: Hoare triple {11262#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {11262#false} is VALID [2018-11-23 13:05:40,357 INFO L273 TraceCheckUtils]: 69: Hoare triple {11262#false} ~cond := #in~cond; {11262#false} is VALID [2018-11-23 13:05:40,357 INFO L273 TraceCheckUtils]: 70: Hoare triple {11262#false} assume 0 == ~cond; {11262#false} is VALID [2018-11-23 13:05:40,357 INFO L273 TraceCheckUtils]: 71: Hoare triple {11262#false} assume !false; {11262#false} is VALID [2018-11-23 13:05:40,362 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:40,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:40,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-11-23 13:05:40,383 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 72 [2018-11-23 13:05:40,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:40,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 13:05:40,461 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 13:05:40,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 13:05:40,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 13:05:40,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 13:05:40,462 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 34 states. [2018-11-23 13:05:41,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:41,146 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-11-23 13:05:41,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 13:05:41,147 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 72 [2018-11-23 13:05:41,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:41,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 13:05:41,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 82 transitions. [2018-11-23 13:05:41,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 13:05:41,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 82 transitions. [2018-11-23 13:05:41,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 82 transitions. [2018-11-23 13:05:41,283 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:41,284 INFO L225 Difference]: With dead ends: 82 [2018-11-23 13:05:41,285 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 13:05:41,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 13:05:41,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 13:05:41,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-11-23 13:05:41,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:41,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 75 states. [2018-11-23 13:05:41,320 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 75 states. [2018-11-23 13:05:41,320 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 75 states. [2018-11-23 13:05:41,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:41,321 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-11-23 13:05:41,322 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-11-23 13:05:41,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:41,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:41,322 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 76 states. [2018-11-23 13:05:41,322 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 76 states. [2018-11-23 13:05:41,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:41,323 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-11-23 13:05:41,323 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-11-23 13:05:41,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:41,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:41,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:41,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:41,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 13:05:41,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-11-23 13:05:41,325 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-11-23 13:05:41,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:41,325 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-11-23 13:05:41,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 13:05:41,325 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-11-23 13:05:41,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-23 13:05:41,325 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:41,325 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:41,326 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:41,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:41,326 INFO L82 PathProgramCache]: Analyzing trace with hash 810173499, now seen corresponding path program 31 times [2018-11-23 13:05:41,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:41,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:41,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:41,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:41,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:42,811 INFO L256 TraceCheckUtils]: 0: Hoare triple {11897#true} call ULTIMATE.init(); {11897#true} is VALID [2018-11-23 13:05:42,811 INFO L273 TraceCheckUtils]: 1: Hoare triple {11897#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11897#true} is VALID [2018-11-23 13:05:42,811 INFO L273 TraceCheckUtils]: 2: Hoare triple {11897#true} assume true; {11897#true} is VALID [2018-11-23 13:05:42,811 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11897#true} {11897#true} #35#return; {11897#true} is VALID [2018-11-23 13:05:42,812 INFO L256 TraceCheckUtils]: 4: Hoare triple {11897#true} call #t~ret2 := main(); {11897#true} is VALID [2018-11-23 13:05:42,812 INFO L273 TraceCheckUtils]: 5: Hoare triple {11897#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {11899#(= main_~i~0 0)} is VALID [2018-11-23 13:05:42,812 INFO L273 TraceCheckUtils]: 6: Hoare triple {11899#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11899#(= main_~i~0 0)} is VALID [2018-11-23 13:05:42,813 INFO L273 TraceCheckUtils]: 7: Hoare triple {11899#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11900#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:42,813 INFO L273 TraceCheckUtils]: 8: Hoare triple {11900#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11900#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:42,814 INFO L273 TraceCheckUtils]: 9: Hoare triple {11900#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11901#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:42,814 INFO L273 TraceCheckUtils]: 10: Hoare triple {11901#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11901#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:42,815 INFO L273 TraceCheckUtils]: 11: Hoare triple {11901#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11902#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:42,824 INFO L273 TraceCheckUtils]: 12: Hoare triple {11902#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11902#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:42,824 INFO L273 TraceCheckUtils]: 13: Hoare triple {11902#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11903#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:42,825 INFO L273 TraceCheckUtils]: 14: Hoare triple {11903#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11903#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:42,825 INFO L273 TraceCheckUtils]: 15: Hoare triple {11903#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11904#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:42,826 INFO L273 TraceCheckUtils]: 16: Hoare triple {11904#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11904#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:42,826 INFO L273 TraceCheckUtils]: 17: Hoare triple {11904#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11905#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:42,826 INFO L273 TraceCheckUtils]: 18: Hoare triple {11905#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11905#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:42,827 INFO L273 TraceCheckUtils]: 19: Hoare triple {11905#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11906#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:42,827 INFO L273 TraceCheckUtils]: 20: Hoare triple {11906#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11906#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:42,828 INFO L273 TraceCheckUtils]: 21: Hoare triple {11906#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11907#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:42,828 INFO L273 TraceCheckUtils]: 22: Hoare triple {11907#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11907#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:42,829 INFO L273 TraceCheckUtils]: 23: Hoare triple {11907#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11908#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:42,830 INFO L273 TraceCheckUtils]: 24: Hoare triple {11908#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11908#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:42,830 INFO L273 TraceCheckUtils]: 25: Hoare triple {11908#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11909#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:42,831 INFO L273 TraceCheckUtils]: 26: Hoare triple {11909#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11909#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:42,832 INFO L273 TraceCheckUtils]: 27: Hoare triple {11909#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11910#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:42,832 INFO L273 TraceCheckUtils]: 28: Hoare triple {11910#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11910#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:42,833 INFO L273 TraceCheckUtils]: 29: Hoare triple {11910#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11911#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:42,833 INFO L273 TraceCheckUtils]: 30: Hoare triple {11911#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11911#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:42,834 INFO L273 TraceCheckUtils]: 31: Hoare triple {11911#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11912#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:42,835 INFO L273 TraceCheckUtils]: 32: Hoare triple {11912#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11912#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:42,835 INFO L273 TraceCheckUtils]: 33: Hoare triple {11912#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11913#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:42,836 INFO L273 TraceCheckUtils]: 34: Hoare triple {11913#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11913#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:42,837 INFO L273 TraceCheckUtils]: 35: Hoare triple {11913#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11914#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:42,837 INFO L273 TraceCheckUtils]: 36: Hoare triple {11914#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11914#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:42,838 INFO L273 TraceCheckUtils]: 37: Hoare triple {11914#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11915#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:42,838 INFO L273 TraceCheckUtils]: 38: Hoare triple {11915#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11915#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:42,839 INFO L273 TraceCheckUtils]: 39: Hoare triple {11915#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11916#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:42,840 INFO L273 TraceCheckUtils]: 40: Hoare triple {11916#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11916#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:42,840 INFO L273 TraceCheckUtils]: 41: Hoare triple {11916#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11917#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:42,841 INFO L273 TraceCheckUtils]: 42: Hoare triple {11917#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11917#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:42,842 INFO L273 TraceCheckUtils]: 43: Hoare triple {11917#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11918#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:42,842 INFO L273 TraceCheckUtils]: 44: Hoare triple {11918#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11918#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:42,843 INFO L273 TraceCheckUtils]: 45: Hoare triple {11918#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11919#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:42,843 INFO L273 TraceCheckUtils]: 46: Hoare triple {11919#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11919#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:42,844 INFO L273 TraceCheckUtils]: 47: Hoare triple {11919#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11920#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:42,845 INFO L273 TraceCheckUtils]: 48: Hoare triple {11920#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11920#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:42,845 INFO L273 TraceCheckUtils]: 49: Hoare triple {11920#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11921#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:42,846 INFO L273 TraceCheckUtils]: 50: Hoare triple {11921#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11921#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:42,847 INFO L273 TraceCheckUtils]: 51: Hoare triple {11921#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11922#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:42,847 INFO L273 TraceCheckUtils]: 52: Hoare triple {11922#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11922#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:42,848 INFO L273 TraceCheckUtils]: 53: Hoare triple {11922#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11923#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:42,848 INFO L273 TraceCheckUtils]: 54: Hoare triple {11923#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11923#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:42,849 INFO L273 TraceCheckUtils]: 55: Hoare triple {11923#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11924#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:42,850 INFO L273 TraceCheckUtils]: 56: Hoare triple {11924#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11924#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:42,850 INFO L273 TraceCheckUtils]: 57: Hoare triple {11924#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11925#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:42,851 INFO L273 TraceCheckUtils]: 58: Hoare triple {11925#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11925#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:42,852 INFO L273 TraceCheckUtils]: 59: Hoare triple {11925#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11926#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:42,852 INFO L273 TraceCheckUtils]: 60: Hoare triple {11926#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11926#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:42,853 INFO L273 TraceCheckUtils]: 61: Hoare triple {11926#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11927#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:42,853 INFO L273 TraceCheckUtils]: 62: Hoare triple {11927#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11927#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:42,854 INFO L273 TraceCheckUtils]: 63: Hoare triple {11927#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11928#(<= main_~i~0 29)} is VALID [2018-11-23 13:05:42,855 INFO L273 TraceCheckUtils]: 64: Hoare triple {11928#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11928#(<= main_~i~0 29)} is VALID [2018-11-23 13:05:42,855 INFO L273 TraceCheckUtils]: 65: Hoare triple {11928#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11929#(<= main_~i~0 30)} is VALID [2018-11-23 13:05:42,856 INFO L273 TraceCheckUtils]: 66: Hoare triple {11929#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11929#(<= main_~i~0 30)} is VALID [2018-11-23 13:05:42,857 INFO L273 TraceCheckUtils]: 67: Hoare triple {11929#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11930#(<= main_~i~0 31)} is VALID [2018-11-23 13:05:42,857 INFO L273 TraceCheckUtils]: 68: Hoare triple {11930#(<= main_~i~0 31)} assume !(~i~0 < 1024); {11898#false} is VALID [2018-11-23 13:05:42,858 INFO L273 TraceCheckUtils]: 69: Hoare triple {11898#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {11898#false} is VALID [2018-11-23 13:05:42,858 INFO L256 TraceCheckUtils]: 70: Hoare triple {11898#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {11898#false} is VALID [2018-11-23 13:05:42,858 INFO L273 TraceCheckUtils]: 71: Hoare triple {11898#false} ~cond := #in~cond; {11898#false} is VALID [2018-11-23 13:05:42,858 INFO L273 TraceCheckUtils]: 72: Hoare triple {11898#false} assume 0 == ~cond; {11898#false} is VALID [2018-11-23 13:05:42,858 INFO L273 TraceCheckUtils]: 73: Hoare triple {11898#false} assume !false; {11898#false} is VALID [2018-11-23 13:05:42,864 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:42,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:42,864 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:42,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:42,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:43,102 INFO L256 TraceCheckUtils]: 0: Hoare triple {11897#true} call ULTIMATE.init(); {11897#true} is VALID [2018-11-23 13:05:43,102 INFO L273 TraceCheckUtils]: 1: Hoare triple {11897#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11897#true} is VALID [2018-11-23 13:05:43,102 INFO L273 TraceCheckUtils]: 2: Hoare triple {11897#true} assume true; {11897#true} is VALID [2018-11-23 13:05:43,103 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11897#true} {11897#true} #35#return; {11897#true} is VALID [2018-11-23 13:05:43,103 INFO L256 TraceCheckUtils]: 4: Hoare triple {11897#true} call #t~ret2 := main(); {11897#true} is VALID [2018-11-23 13:05:43,103 INFO L273 TraceCheckUtils]: 5: Hoare triple {11897#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {11949#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:43,104 INFO L273 TraceCheckUtils]: 6: Hoare triple {11949#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11949#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:43,105 INFO L273 TraceCheckUtils]: 7: Hoare triple {11949#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11900#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:43,105 INFO L273 TraceCheckUtils]: 8: Hoare triple {11900#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11900#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:43,105 INFO L273 TraceCheckUtils]: 9: Hoare triple {11900#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11901#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:43,107 INFO L273 TraceCheckUtils]: 10: Hoare triple {11901#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11901#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:43,108 INFO L273 TraceCheckUtils]: 11: Hoare triple {11901#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11902#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:43,108 INFO L273 TraceCheckUtils]: 12: Hoare triple {11902#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11902#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:43,109 INFO L273 TraceCheckUtils]: 13: Hoare triple {11902#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11903#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:43,110 INFO L273 TraceCheckUtils]: 14: Hoare triple {11903#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11903#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:43,110 INFO L273 TraceCheckUtils]: 15: Hoare triple {11903#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11904#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:43,111 INFO L273 TraceCheckUtils]: 16: Hoare triple {11904#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11904#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:43,112 INFO L273 TraceCheckUtils]: 17: Hoare triple {11904#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11905#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:43,112 INFO L273 TraceCheckUtils]: 18: Hoare triple {11905#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11905#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:43,113 INFO L273 TraceCheckUtils]: 19: Hoare triple {11905#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11906#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:43,113 INFO L273 TraceCheckUtils]: 20: Hoare triple {11906#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11906#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:43,114 INFO L273 TraceCheckUtils]: 21: Hoare triple {11906#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11907#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:43,115 INFO L273 TraceCheckUtils]: 22: Hoare triple {11907#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11907#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:43,115 INFO L273 TraceCheckUtils]: 23: Hoare triple {11907#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11908#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:43,116 INFO L273 TraceCheckUtils]: 24: Hoare triple {11908#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11908#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:43,116 INFO L273 TraceCheckUtils]: 25: Hoare triple {11908#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11909#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:43,117 INFO L273 TraceCheckUtils]: 26: Hoare triple {11909#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11909#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:43,118 INFO L273 TraceCheckUtils]: 27: Hoare triple {11909#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11910#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:43,118 INFO L273 TraceCheckUtils]: 28: Hoare triple {11910#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11910#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:43,119 INFO L273 TraceCheckUtils]: 29: Hoare triple {11910#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11911#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:43,119 INFO L273 TraceCheckUtils]: 30: Hoare triple {11911#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11911#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:43,120 INFO L273 TraceCheckUtils]: 31: Hoare triple {11911#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11912#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:43,120 INFO L273 TraceCheckUtils]: 32: Hoare triple {11912#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11912#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:43,121 INFO L273 TraceCheckUtils]: 33: Hoare triple {11912#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11913#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:43,122 INFO L273 TraceCheckUtils]: 34: Hoare triple {11913#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11913#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:43,122 INFO L273 TraceCheckUtils]: 35: Hoare triple {11913#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11914#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:43,123 INFO L273 TraceCheckUtils]: 36: Hoare triple {11914#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11914#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:43,123 INFO L273 TraceCheckUtils]: 37: Hoare triple {11914#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11915#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:43,124 INFO L273 TraceCheckUtils]: 38: Hoare triple {11915#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11915#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:43,125 INFO L273 TraceCheckUtils]: 39: Hoare triple {11915#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11916#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:43,125 INFO L273 TraceCheckUtils]: 40: Hoare triple {11916#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11916#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:43,126 INFO L273 TraceCheckUtils]: 41: Hoare triple {11916#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11917#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:43,143 INFO L273 TraceCheckUtils]: 42: Hoare triple {11917#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11917#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:43,152 INFO L273 TraceCheckUtils]: 43: Hoare triple {11917#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11918#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:43,157 INFO L273 TraceCheckUtils]: 44: Hoare triple {11918#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11918#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:43,158 INFO L273 TraceCheckUtils]: 45: Hoare triple {11918#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11919#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:43,158 INFO L273 TraceCheckUtils]: 46: Hoare triple {11919#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11919#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:43,158 INFO L273 TraceCheckUtils]: 47: Hoare triple {11919#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11920#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:43,159 INFO L273 TraceCheckUtils]: 48: Hoare triple {11920#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11920#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:43,159 INFO L273 TraceCheckUtils]: 49: Hoare triple {11920#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11921#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:43,159 INFO L273 TraceCheckUtils]: 50: Hoare triple {11921#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11921#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:43,160 INFO L273 TraceCheckUtils]: 51: Hoare triple {11921#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11922#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:43,160 INFO L273 TraceCheckUtils]: 52: Hoare triple {11922#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11922#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:43,161 INFO L273 TraceCheckUtils]: 53: Hoare triple {11922#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11923#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:43,161 INFO L273 TraceCheckUtils]: 54: Hoare triple {11923#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11923#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:43,161 INFO L273 TraceCheckUtils]: 55: Hoare triple {11923#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11924#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:43,162 INFO L273 TraceCheckUtils]: 56: Hoare triple {11924#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11924#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:43,162 INFO L273 TraceCheckUtils]: 57: Hoare triple {11924#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11925#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:43,163 INFO L273 TraceCheckUtils]: 58: Hoare triple {11925#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11925#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:43,164 INFO L273 TraceCheckUtils]: 59: Hoare triple {11925#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11926#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:43,164 INFO L273 TraceCheckUtils]: 60: Hoare triple {11926#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11926#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:43,165 INFO L273 TraceCheckUtils]: 61: Hoare triple {11926#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11927#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:43,165 INFO L273 TraceCheckUtils]: 62: Hoare triple {11927#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11927#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:43,166 INFO L273 TraceCheckUtils]: 63: Hoare triple {11927#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11928#(<= main_~i~0 29)} is VALID [2018-11-23 13:05:43,166 INFO L273 TraceCheckUtils]: 64: Hoare triple {11928#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11928#(<= main_~i~0 29)} is VALID [2018-11-23 13:05:43,167 INFO L273 TraceCheckUtils]: 65: Hoare triple {11928#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11929#(<= main_~i~0 30)} is VALID [2018-11-23 13:05:43,168 INFO L273 TraceCheckUtils]: 66: Hoare triple {11929#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11929#(<= main_~i~0 30)} is VALID [2018-11-23 13:05:43,168 INFO L273 TraceCheckUtils]: 67: Hoare triple {11929#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11930#(<= main_~i~0 31)} is VALID [2018-11-23 13:05:43,169 INFO L273 TraceCheckUtils]: 68: Hoare triple {11930#(<= main_~i~0 31)} assume !(~i~0 < 1024); {11898#false} is VALID [2018-11-23 13:05:43,169 INFO L273 TraceCheckUtils]: 69: Hoare triple {11898#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {11898#false} is VALID [2018-11-23 13:05:43,169 INFO L256 TraceCheckUtils]: 70: Hoare triple {11898#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {11898#false} is VALID [2018-11-23 13:05:43,169 INFO L273 TraceCheckUtils]: 71: Hoare triple {11898#false} ~cond := #in~cond; {11898#false} is VALID [2018-11-23 13:05:43,170 INFO L273 TraceCheckUtils]: 72: Hoare triple {11898#false} assume 0 == ~cond; {11898#false} is VALID [2018-11-23 13:05:43,170 INFO L273 TraceCheckUtils]: 73: Hoare triple {11898#false} assume !false; {11898#false} is VALID [2018-11-23 13:05:43,175 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:43,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:43,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-23 13:05:43,195 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 74 [2018-11-23 13:05:43,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:43,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 13:05:43,266 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:43,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 13:05:43,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 13:05:43,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 13:05:43,268 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 35 states. [2018-11-23 13:05:43,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:43,632 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-11-23 13:05:43,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 13:05:43,632 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 74 [2018-11-23 13:05:43,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:43,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:05:43,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 84 transitions. [2018-11-23 13:05:43,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:05:43,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 84 transitions. [2018-11-23 13:05:43,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 84 transitions. [2018-11-23 13:05:43,710 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 13:05:43,711 INFO L225 Difference]: With dead ends: 84 [2018-11-23 13:05:43,712 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 13:05:43,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 13:05:43,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 13:05:43,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-23 13:05:43,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:43,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 77 states. [2018-11-23 13:05:43,742 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 77 states. [2018-11-23 13:05:43,742 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 77 states. [2018-11-23 13:05:43,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:43,743 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-11-23 13:05:43,744 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-11-23 13:05:43,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:43,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:43,744 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 78 states. [2018-11-23 13:05:43,744 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 78 states. [2018-11-23 13:05:43,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:43,746 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-11-23 13:05:43,746 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-11-23 13:05:43,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:43,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:43,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:43,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:43,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 13:05:43,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-11-23 13:05:43,748 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-11-23 13:05:43,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:43,748 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-11-23 13:05:43,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 13:05:43,748 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-11-23 13:05:43,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 13:05:43,749 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:43,749 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:43,749 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:43,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:43,749 INFO L82 PathProgramCache]: Analyzing trace with hash 346930269, now seen corresponding path program 32 times [2018-11-23 13:05:43,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:43,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:43,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:43,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:43,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:44,374 INFO L256 TraceCheckUtils]: 0: Hoare triple {12550#true} call ULTIMATE.init(); {12550#true} is VALID [2018-11-23 13:05:44,374 INFO L273 TraceCheckUtils]: 1: Hoare triple {12550#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12550#true} is VALID [2018-11-23 13:05:44,375 INFO L273 TraceCheckUtils]: 2: Hoare triple {12550#true} assume true; {12550#true} is VALID [2018-11-23 13:05:44,375 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12550#true} {12550#true} #35#return; {12550#true} is VALID [2018-11-23 13:05:44,375 INFO L256 TraceCheckUtils]: 4: Hoare triple {12550#true} call #t~ret2 := main(); {12550#true} is VALID [2018-11-23 13:05:44,376 INFO L273 TraceCheckUtils]: 5: Hoare triple {12550#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {12552#(= main_~i~0 0)} is VALID [2018-11-23 13:05:44,376 INFO L273 TraceCheckUtils]: 6: Hoare triple {12552#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12552#(= main_~i~0 0)} is VALID [2018-11-23 13:05:44,377 INFO L273 TraceCheckUtils]: 7: Hoare triple {12552#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12553#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:44,377 INFO L273 TraceCheckUtils]: 8: Hoare triple {12553#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12553#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:44,378 INFO L273 TraceCheckUtils]: 9: Hoare triple {12553#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12554#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:44,378 INFO L273 TraceCheckUtils]: 10: Hoare triple {12554#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12554#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:44,378 INFO L273 TraceCheckUtils]: 11: Hoare triple {12554#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12555#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:44,379 INFO L273 TraceCheckUtils]: 12: Hoare triple {12555#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12555#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:44,379 INFO L273 TraceCheckUtils]: 13: Hoare triple {12555#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12556#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:44,380 INFO L273 TraceCheckUtils]: 14: Hoare triple {12556#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12556#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:44,380 INFO L273 TraceCheckUtils]: 15: Hoare triple {12556#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12557#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:44,381 INFO L273 TraceCheckUtils]: 16: Hoare triple {12557#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12557#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:44,381 INFO L273 TraceCheckUtils]: 17: Hoare triple {12557#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12558#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:44,382 INFO L273 TraceCheckUtils]: 18: Hoare triple {12558#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12558#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:44,383 INFO L273 TraceCheckUtils]: 19: Hoare triple {12558#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12559#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:44,383 INFO L273 TraceCheckUtils]: 20: Hoare triple {12559#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12559#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:44,384 INFO L273 TraceCheckUtils]: 21: Hoare triple {12559#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12560#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:44,384 INFO L273 TraceCheckUtils]: 22: Hoare triple {12560#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12560#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:44,385 INFO L273 TraceCheckUtils]: 23: Hoare triple {12560#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12561#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:44,385 INFO L273 TraceCheckUtils]: 24: Hoare triple {12561#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12561#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:44,386 INFO L273 TraceCheckUtils]: 25: Hoare triple {12561#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12562#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:44,387 INFO L273 TraceCheckUtils]: 26: Hoare triple {12562#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12562#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:44,387 INFO L273 TraceCheckUtils]: 27: Hoare triple {12562#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12563#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:44,388 INFO L273 TraceCheckUtils]: 28: Hoare triple {12563#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12563#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:44,389 INFO L273 TraceCheckUtils]: 29: Hoare triple {12563#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12564#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:44,389 INFO L273 TraceCheckUtils]: 30: Hoare triple {12564#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12564#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:44,390 INFO L273 TraceCheckUtils]: 31: Hoare triple {12564#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12565#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:44,390 INFO L273 TraceCheckUtils]: 32: Hoare triple {12565#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12565#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:44,391 INFO L273 TraceCheckUtils]: 33: Hoare triple {12565#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12566#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:44,391 INFO L273 TraceCheckUtils]: 34: Hoare triple {12566#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12566#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:44,392 INFO L273 TraceCheckUtils]: 35: Hoare triple {12566#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12567#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:44,393 INFO L273 TraceCheckUtils]: 36: Hoare triple {12567#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12567#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:44,393 INFO L273 TraceCheckUtils]: 37: Hoare triple {12567#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12568#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:44,394 INFO L273 TraceCheckUtils]: 38: Hoare triple {12568#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12568#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:44,395 INFO L273 TraceCheckUtils]: 39: Hoare triple {12568#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12569#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:44,395 INFO L273 TraceCheckUtils]: 40: Hoare triple {12569#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12569#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:44,396 INFO L273 TraceCheckUtils]: 41: Hoare triple {12569#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12570#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:44,396 INFO L273 TraceCheckUtils]: 42: Hoare triple {12570#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12570#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:44,414 INFO L273 TraceCheckUtils]: 43: Hoare triple {12570#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12571#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:44,422 INFO L273 TraceCheckUtils]: 44: Hoare triple {12571#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12571#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:44,437 INFO L273 TraceCheckUtils]: 45: Hoare triple {12571#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12572#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:44,445 INFO L273 TraceCheckUtils]: 46: Hoare triple {12572#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12572#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:44,447 INFO L273 TraceCheckUtils]: 47: Hoare triple {12572#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12573#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:44,447 INFO L273 TraceCheckUtils]: 48: Hoare triple {12573#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12573#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:44,448 INFO L273 TraceCheckUtils]: 49: Hoare triple {12573#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12574#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:44,448 INFO L273 TraceCheckUtils]: 50: Hoare triple {12574#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12574#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:44,448 INFO L273 TraceCheckUtils]: 51: Hoare triple {12574#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12575#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:44,449 INFO L273 TraceCheckUtils]: 52: Hoare triple {12575#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12575#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:44,449 INFO L273 TraceCheckUtils]: 53: Hoare triple {12575#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12576#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:44,449 INFO L273 TraceCheckUtils]: 54: Hoare triple {12576#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12576#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:44,450 INFO L273 TraceCheckUtils]: 55: Hoare triple {12576#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12577#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:44,450 INFO L273 TraceCheckUtils]: 56: Hoare triple {12577#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12577#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:44,451 INFO L273 TraceCheckUtils]: 57: Hoare triple {12577#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12578#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:44,451 INFO L273 TraceCheckUtils]: 58: Hoare triple {12578#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12578#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:44,452 INFO L273 TraceCheckUtils]: 59: Hoare triple {12578#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12579#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:44,453 INFO L273 TraceCheckUtils]: 60: Hoare triple {12579#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12579#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:44,453 INFO L273 TraceCheckUtils]: 61: Hoare triple {12579#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12580#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:44,454 INFO L273 TraceCheckUtils]: 62: Hoare triple {12580#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12580#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:44,455 INFO L273 TraceCheckUtils]: 63: Hoare triple {12580#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12581#(<= main_~i~0 29)} is VALID [2018-11-23 13:05:44,455 INFO L273 TraceCheckUtils]: 64: Hoare triple {12581#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12581#(<= main_~i~0 29)} is VALID [2018-11-23 13:05:44,456 INFO L273 TraceCheckUtils]: 65: Hoare triple {12581#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12582#(<= main_~i~0 30)} is VALID [2018-11-23 13:05:44,456 INFO L273 TraceCheckUtils]: 66: Hoare triple {12582#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12582#(<= main_~i~0 30)} is VALID [2018-11-23 13:05:44,457 INFO L273 TraceCheckUtils]: 67: Hoare triple {12582#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12583#(<= main_~i~0 31)} is VALID [2018-11-23 13:05:44,457 INFO L273 TraceCheckUtils]: 68: Hoare triple {12583#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12583#(<= main_~i~0 31)} is VALID [2018-11-23 13:05:44,458 INFO L273 TraceCheckUtils]: 69: Hoare triple {12583#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12584#(<= main_~i~0 32)} is VALID [2018-11-23 13:05:44,459 INFO L273 TraceCheckUtils]: 70: Hoare triple {12584#(<= main_~i~0 32)} assume !(~i~0 < 1024); {12551#false} is VALID [2018-11-23 13:05:44,459 INFO L273 TraceCheckUtils]: 71: Hoare triple {12551#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {12551#false} is VALID [2018-11-23 13:05:44,459 INFO L256 TraceCheckUtils]: 72: Hoare triple {12551#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {12551#false} is VALID [2018-11-23 13:05:44,459 INFO L273 TraceCheckUtils]: 73: Hoare triple {12551#false} ~cond := #in~cond; {12551#false} is VALID [2018-11-23 13:05:44,460 INFO L273 TraceCheckUtils]: 74: Hoare triple {12551#false} assume 0 == ~cond; {12551#false} is VALID [2018-11-23 13:05:44,460 INFO L273 TraceCheckUtils]: 75: Hoare triple {12551#false} assume !false; {12551#false} is VALID [2018-11-23 13:05:44,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:44,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:44,466 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:44,474 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:05:44,505 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:05:44,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:44,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:44,730 INFO L256 TraceCheckUtils]: 0: Hoare triple {12550#true} call ULTIMATE.init(); {12550#true} is VALID [2018-11-23 13:05:44,731 INFO L273 TraceCheckUtils]: 1: Hoare triple {12550#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12550#true} is VALID [2018-11-23 13:05:44,731 INFO L273 TraceCheckUtils]: 2: Hoare triple {12550#true} assume true; {12550#true} is VALID [2018-11-23 13:05:44,731 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12550#true} {12550#true} #35#return; {12550#true} is VALID [2018-11-23 13:05:44,731 INFO L256 TraceCheckUtils]: 4: Hoare triple {12550#true} call #t~ret2 := main(); {12550#true} is VALID [2018-11-23 13:05:44,732 INFO L273 TraceCheckUtils]: 5: Hoare triple {12550#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {12603#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:44,732 INFO L273 TraceCheckUtils]: 6: Hoare triple {12603#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12603#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:44,733 INFO L273 TraceCheckUtils]: 7: Hoare triple {12603#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12553#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:44,733 INFO L273 TraceCheckUtils]: 8: Hoare triple {12553#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12553#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:44,734 INFO L273 TraceCheckUtils]: 9: Hoare triple {12553#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12554#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:44,734 INFO L273 TraceCheckUtils]: 10: Hoare triple {12554#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12554#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:44,734 INFO L273 TraceCheckUtils]: 11: Hoare triple {12554#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12555#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:44,735 INFO L273 TraceCheckUtils]: 12: Hoare triple {12555#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12555#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:44,736 INFO L273 TraceCheckUtils]: 13: Hoare triple {12555#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12556#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:44,736 INFO L273 TraceCheckUtils]: 14: Hoare triple {12556#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12556#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:44,737 INFO L273 TraceCheckUtils]: 15: Hoare triple {12556#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12557#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:44,737 INFO L273 TraceCheckUtils]: 16: Hoare triple {12557#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12557#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:44,738 INFO L273 TraceCheckUtils]: 17: Hoare triple {12557#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12558#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:44,738 INFO L273 TraceCheckUtils]: 18: Hoare triple {12558#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12558#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:44,739 INFO L273 TraceCheckUtils]: 19: Hoare triple {12558#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12559#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:44,740 INFO L273 TraceCheckUtils]: 20: Hoare triple {12559#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12559#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:44,740 INFO L273 TraceCheckUtils]: 21: Hoare triple {12559#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12560#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:44,741 INFO L273 TraceCheckUtils]: 22: Hoare triple {12560#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12560#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:44,741 INFO L273 TraceCheckUtils]: 23: Hoare triple {12560#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12561#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:44,742 INFO L273 TraceCheckUtils]: 24: Hoare triple {12561#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12561#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:44,743 INFO L273 TraceCheckUtils]: 25: Hoare triple {12561#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12562#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:44,743 INFO L273 TraceCheckUtils]: 26: Hoare triple {12562#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12562#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:44,744 INFO L273 TraceCheckUtils]: 27: Hoare triple {12562#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12563#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:44,744 INFO L273 TraceCheckUtils]: 28: Hoare triple {12563#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12563#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:44,745 INFO L273 TraceCheckUtils]: 29: Hoare triple {12563#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12564#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:44,746 INFO L273 TraceCheckUtils]: 30: Hoare triple {12564#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12564#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:44,746 INFO L273 TraceCheckUtils]: 31: Hoare triple {12564#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12565#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:44,747 INFO L273 TraceCheckUtils]: 32: Hoare triple {12565#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12565#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:44,748 INFO L273 TraceCheckUtils]: 33: Hoare triple {12565#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12566#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:44,748 INFO L273 TraceCheckUtils]: 34: Hoare triple {12566#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12566#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:44,749 INFO L273 TraceCheckUtils]: 35: Hoare triple {12566#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12567#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:44,749 INFO L273 TraceCheckUtils]: 36: Hoare triple {12567#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12567#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:44,750 INFO L273 TraceCheckUtils]: 37: Hoare triple {12567#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12568#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:44,751 INFO L273 TraceCheckUtils]: 38: Hoare triple {12568#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12568#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:44,751 INFO L273 TraceCheckUtils]: 39: Hoare triple {12568#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12569#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:44,752 INFO L273 TraceCheckUtils]: 40: Hoare triple {12569#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12569#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:44,752 INFO L273 TraceCheckUtils]: 41: Hoare triple {12569#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12570#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:44,753 INFO L273 TraceCheckUtils]: 42: Hoare triple {12570#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12570#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:44,754 INFO L273 TraceCheckUtils]: 43: Hoare triple {12570#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12571#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:44,754 INFO L273 TraceCheckUtils]: 44: Hoare triple {12571#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12571#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:44,755 INFO L273 TraceCheckUtils]: 45: Hoare triple {12571#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12572#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:44,755 INFO L273 TraceCheckUtils]: 46: Hoare triple {12572#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12572#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:44,756 INFO L273 TraceCheckUtils]: 47: Hoare triple {12572#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12573#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:44,756 INFO L273 TraceCheckUtils]: 48: Hoare triple {12573#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12573#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:44,757 INFO L273 TraceCheckUtils]: 49: Hoare triple {12573#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12574#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:44,758 INFO L273 TraceCheckUtils]: 50: Hoare triple {12574#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12574#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:44,758 INFO L273 TraceCheckUtils]: 51: Hoare triple {12574#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12575#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:44,759 INFO L273 TraceCheckUtils]: 52: Hoare triple {12575#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12575#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:44,760 INFO L273 TraceCheckUtils]: 53: Hoare triple {12575#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12576#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:44,760 INFO L273 TraceCheckUtils]: 54: Hoare triple {12576#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12576#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:44,766 INFO L273 TraceCheckUtils]: 55: Hoare triple {12576#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12577#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:44,766 INFO L273 TraceCheckUtils]: 56: Hoare triple {12577#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12577#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:44,767 INFO L273 TraceCheckUtils]: 57: Hoare triple {12577#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12578#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:44,767 INFO L273 TraceCheckUtils]: 58: Hoare triple {12578#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12578#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:44,767 INFO L273 TraceCheckUtils]: 59: Hoare triple {12578#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12579#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:44,768 INFO L273 TraceCheckUtils]: 60: Hoare triple {12579#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12579#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:44,768 INFO L273 TraceCheckUtils]: 61: Hoare triple {12579#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12580#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:44,768 INFO L273 TraceCheckUtils]: 62: Hoare triple {12580#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12580#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:44,769 INFO L273 TraceCheckUtils]: 63: Hoare triple {12580#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12581#(<= main_~i~0 29)} is VALID [2018-11-23 13:05:44,769 INFO L273 TraceCheckUtils]: 64: Hoare triple {12581#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12581#(<= main_~i~0 29)} is VALID [2018-11-23 13:05:44,770 INFO L273 TraceCheckUtils]: 65: Hoare triple {12581#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12582#(<= main_~i~0 30)} is VALID [2018-11-23 13:05:44,770 INFO L273 TraceCheckUtils]: 66: Hoare triple {12582#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12582#(<= main_~i~0 30)} is VALID [2018-11-23 13:05:44,771 INFO L273 TraceCheckUtils]: 67: Hoare triple {12582#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12583#(<= main_~i~0 31)} is VALID [2018-11-23 13:05:44,771 INFO L273 TraceCheckUtils]: 68: Hoare triple {12583#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12583#(<= main_~i~0 31)} is VALID [2018-11-23 13:05:44,772 INFO L273 TraceCheckUtils]: 69: Hoare triple {12583#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12584#(<= main_~i~0 32)} is VALID [2018-11-23 13:05:44,772 INFO L273 TraceCheckUtils]: 70: Hoare triple {12584#(<= main_~i~0 32)} assume !(~i~0 < 1024); {12551#false} is VALID [2018-11-23 13:05:44,773 INFO L273 TraceCheckUtils]: 71: Hoare triple {12551#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {12551#false} is VALID [2018-11-23 13:05:44,773 INFO L256 TraceCheckUtils]: 72: Hoare triple {12551#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {12551#false} is VALID [2018-11-23 13:05:44,773 INFO L273 TraceCheckUtils]: 73: Hoare triple {12551#false} ~cond := #in~cond; {12551#false} is VALID [2018-11-23 13:05:44,773 INFO L273 TraceCheckUtils]: 74: Hoare triple {12551#false} assume 0 == ~cond; {12551#false} is VALID [2018-11-23 13:05:44,773 INFO L273 TraceCheckUtils]: 75: Hoare triple {12551#false} assume !false; {12551#false} is VALID [2018-11-23 13:05:44,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:44,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:44,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-23 13:05:44,798 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 76 [2018-11-23 13:05:44,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:44,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 13:05:44,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:44,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 13:05:44,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 13:05:44,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 13:05:44,872 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 36 states. [2018-11-23 13:05:45,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:45,278 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-11-23 13:05:45,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 13:05:45,279 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 76 [2018-11-23 13:05:45,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:45,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:05:45,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 86 transitions. [2018-11-23 13:05:45,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:05:45,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 86 transitions. [2018-11-23 13:05:45,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 86 transitions. [2018-11-23 13:05:45,360 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:45,361 INFO L225 Difference]: With dead ends: 86 [2018-11-23 13:05:45,361 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 13:05:45,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 13:05:45,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 13:05:45,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2018-11-23 13:05:45,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:45,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 79 states. [2018-11-23 13:05:45,387 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 79 states. [2018-11-23 13:05:45,387 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 79 states. [2018-11-23 13:05:45,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:45,388 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-11-23 13:05:45,388 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-11-23 13:05:45,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:45,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:45,388 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 80 states. [2018-11-23 13:05:45,388 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 80 states. [2018-11-23 13:05:45,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:45,390 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-11-23 13:05:45,390 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-11-23 13:05:45,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:45,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:45,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:45,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:45,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 13:05:45,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-11-23 13:05:45,392 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-11-23 13:05:45,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:45,392 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-11-23 13:05:45,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 13:05:45,392 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-11-23 13:05:45,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 13:05:45,393 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:45,393 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:45,393 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:45,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:45,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1846785023, now seen corresponding path program 33 times [2018-11-23 13:05:45,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:45,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:45,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:45,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:45,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:46,161 INFO L256 TraceCheckUtils]: 0: Hoare triple {13220#true} call ULTIMATE.init(); {13220#true} is VALID [2018-11-23 13:05:46,161 INFO L273 TraceCheckUtils]: 1: Hoare triple {13220#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13220#true} is VALID [2018-11-23 13:05:46,162 INFO L273 TraceCheckUtils]: 2: Hoare triple {13220#true} assume true; {13220#true} is VALID [2018-11-23 13:05:46,162 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13220#true} {13220#true} #35#return; {13220#true} is VALID [2018-11-23 13:05:46,162 INFO L256 TraceCheckUtils]: 4: Hoare triple {13220#true} call #t~ret2 := main(); {13220#true} is VALID [2018-11-23 13:05:46,162 INFO L273 TraceCheckUtils]: 5: Hoare triple {13220#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {13222#(= main_~i~0 0)} is VALID [2018-11-23 13:05:46,163 INFO L273 TraceCheckUtils]: 6: Hoare triple {13222#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13222#(= main_~i~0 0)} is VALID [2018-11-23 13:05:46,163 INFO L273 TraceCheckUtils]: 7: Hoare triple {13222#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13223#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:46,163 INFO L273 TraceCheckUtils]: 8: Hoare triple {13223#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13223#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:46,164 INFO L273 TraceCheckUtils]: 9: Hoare triple {13223#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13224#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:46,164 INFO L273 TraceCheckUtils]: 10: Hoare triple {13224#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13224#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:46,165 INFO L273 TraceCheckUtils]: 11: Hoare triple {13224#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13225#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:46,165 INFO L273 TraceCheckUtils]: 12: Hoare triple {13225#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13225#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:46,166 INFO L273 TraceCheckUtils]: 13: Hoare triple {13225#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13226#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:46,167 INFO L273 TraceCheckUtils]: 14: Hoare triple {13226#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13226#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:46,176 INFO L273 TraceCheckUtils]: 15: Hoare triple {13226#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13227#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:46,177 INFO L273 TraceCheckUtils]: 16: Hoare triple {13227#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13227#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:46,177 INFO L273 TraceCheckUtils]: 17: Hoare triple {13227#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13228#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:46,178 INFO L273 TraceCheckUtils]: 18: Hoare triple {13228#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13228#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:46,178 INFO L273 TraceCheckUtils]: 19: Hoare triple {13228#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13229#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:46,178 INFO L273 TraceCheckUtils]: 20: Hoare triple {13229#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13229#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:46,179 INFO L273 TraceCheckUtils]: 21: Hoare triple {13229#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13230#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:46,179 INFO L273 TraceCheckUtils]: 22: Hoare triple {13230#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13230#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:46,180 INFO L273 TraceCheckUtils]: 23: Hoare triple {13230#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13231#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:46,180 INFO L273 TraceCheckUtils]: 24: Hoare triple {13231#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13231#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:46,180 INFO L273 TraceCheckUtils]: 25: Hoare triple {13231#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13232#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:46,181 INFO L273 TraceCheckUtils]: 26: Hoare triple {13232#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13232#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:46,182 INFO L273 TraceCheckUtils]: 27: Hoare triple {13232#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13233#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:46,182 INFO L273 TraceCheckUtils]: 28: Hoare triple {13233#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13233#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:46,183 INFO L273 TraceCheckUtils]: 29: Hoare triple {13233#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13234#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:46,183 INFO L273 TraceCheckUtils]: 30: Hoare triple {13234#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13234#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:46,184 INFO L273 TraceCheckUtils]: 31: Hoare triple {13234#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13235#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:46,185 INFO L273 TraceCheckUtils]: 32: Hoare triple {13235#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13235#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:46,185 INFO L273 TraceCheckUtils]: 33: Hoare triple {13235#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13236#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:46,186 INFO L273 TraceCheckUtils]: 34: Hoare triple {13236#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13236#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:46,186 INFO L273 TraceCheckUtils]: 35: Hoare triple {13236#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13237#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:46,187 INFO L273 TraceCheckUtils]: 36: Hoare triple {13237#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13237#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:46,188 INFO L273 TraceCheckUtils]: 37: Hoare triple {13237#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13238#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:46,188 INFO L273 TraceCheckUtils]: 38: Hoare triple {13238#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13238#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:46,189 INFO L273 TraceCheckUtils]: 39: Hoare triple {13238#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13239#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:46,189 INFO L273 TraceCheckUtils]: 40: Hoare triple {13239#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13239#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:46,190 INFO L273 TraceCheckUtils]: 41: Hoare triple {13239#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13240#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:46,191 INFO L273 TraceCheckUtils]: 42: Hoare triple {13240#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13240#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:46,191 INFO L273 TraceCheckUtils]: 43: Hoare triple {13240#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13241#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:46,192 INFO L273 TraceCheckUtils]: 44: Hoare triple {13241#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13241#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:46,193 INFO L273 TraceCheckUtils]: 45: Hoare triple {13241#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13242#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:46,193 INFO L273 TraceCheckUtils]: 46: Hoare triple {13242#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13242#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:46,194 INFO L273 TraceCheckUtils]: 47: Hoare triple {13242#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13243#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:46,194 INFO L273 TraceCheckUtils]: 48: Hoare triple {13243#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13243#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:46,195 INFO L273 TraceCheckUtils]: 49: Hoare triple {13243#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13244#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:46,196 INFO L273 TraceCheckUtils]: 50: Hoare triple {13244#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13244#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:46,196 INFO L273 TraceCheckUtils]: 51: Hoare triple {13244#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13245#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:46,197 INFO L273 TraceCheckUtils]: 52: Hoare triple {13245#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13245#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:46,198 INFO L273 TraceCheckUtils]: 53: Hoare triple {13245#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13246#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:46,198 INFO L273 TraceCheckUtils]: 54: Hoare triple {13246#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13246#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:46,199 INFO L273 TraceCheckUtils]: 55: Hoare triple {13246#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13247#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:46,199 INFO L273 TraceCheckUtils]: 56: Hoare triple {13247#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13247#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:46,200 INFO L273 TraceCheckUtils]: 57: Hoare triple {13247#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13248#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:46,201 INFO L273 TraceCheckUtils]: 58: Hoare triple {13248#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13248#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:46,201 INFO L273 TraceCheckUtils]: 59: Hoare triple {13248#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13249#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:46,202 INFO L273 TraceCheckUtils]: 60: Hoare triple {13249#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13249#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:46,203 INFO L273 TraceCheckUtils]: 61: Hoare triple {13249#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13250#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:46,203 INFO L273 TraceCheckUtils]: 62: Hoare triple {13250#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13250#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:46,204 INFO L273 TraceCheckUtils]: 63: Hoare triple {13250#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13251#(<= main_~i~0 29)} is VALID [2018-11-23 13:05:46,204 INFO L273 TraceCheckUtils]: 64: Hoare triple {13251#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13251#(<= main_~i~0 29)} is VALID [2018-11-23 13:05:46,205 INFO L273 TraceCheckUtils]: 65: Hoare triple {13251#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13252#(<= main_~i~0 30)} is VALID [2018-11-23 13:05:46,206 INFO L273 TraceCheckUtils]: 66: Hoare triple {13252#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13252#(<= main_~i~0 30)} is VALID [2018-11-23 13:05:46,206 INFO L273 TraceCheckUtils]: 67: Hoare triple {13252#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13253#(<= main_~i~0 31)} is VALID [2018-11-23 13:05:46,207 INFO L273 TraceCheckUtils]: 68: Hoare triple {13253#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13253#(<= main_~i~0 31)} is VALID [2018-11-23 13:05:46,208 INFO L273 TraceCheckUtils]: 69: Hoare triple {13253#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13254#(<= main_~i~0 32)} is VALID [2018-11-23 13:05:46,208 INFO L273 TraceCheckUtils]: 70: Hoare triple {13254#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13254#(<= main_~i~0 32)} is VALID [2018-11-23 13:05:46,209 INFO L273 TraceCheckUtils]: 71: Hoare triple {13254#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13255#(<= main_~i~0 33)} is VALID [2018-11-23 13:05:46,209 INFO L273 TraceCheckUtils]: 72: Hoare triple {13255#(<= main_~i~0 33)} assume !(~i~0 < 1024); {13221#false} is VALID [2018-11-23 13:05:46,210 INFO L273 TraceCheckUtils]: 73: Hoare triple {13221#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {13221#false} is VALID [2018-11-23 13:05:46,210 INFO L256 TraceCheckUtils]: 74: Hoare triple {13221#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {13221#false} is VALID [2018-11-23 13:05:46,210 INFO L273 TraceCheckUtils]: 75: Hoare triple {13221#false} ~cond := #in~cond; {13221#false} is VALID [2018-11-23 13:05:46,210 INFO L273 TraceCheckUtils]: 76: Hoare triple {13221#false} assume 0 == ~cond; {13221#false} is VALID [2018-11-23 13:05:46,210 INFO L273 TraceCheckUtils]: 77: Hoare triple {13221#false} assume !false; {13221#false} is VALID [2018-11-23 13:05:46,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:46,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:46,216 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:46,224 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:05:53,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-11-23 13:05:53,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:53,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:53,636 INFO L256 TraceCheckUtils]: 0: Hoare triple {13220#true} call ULTIMATE.init(); {13220#true} is VALID [2018-11-23 13:05:53,636 INFO L273 TraceCheckUtils]: 1: Hoare triple {13220#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13220#true} is VALID [2018-11-23 13:05:53,637 INFO L273 TraceCheckUtils]: 2: Hoare triple {13220#true} assume true; {13220#true} is VALID [2018-11-23 13:05:53,637 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13220#true} {13220#true} #35#return; {13220#true} is VALID [2018-11-23 13:05:53,637 INFO L256 TraceCheckUtils]: 4: Hoare triple {13220#true} call #t~ret2 := main(); {13220#true} is VALID [2018-11-23 13:05:53,638 INFO L273 TraceCheckUtils]: 5: Hoare triple {13220#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {13274#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:53,638 INFO L273 TraceCheckUtils]: 6: Hoare triple {13274#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13274#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:53,639 INFO L273 TraceCheckUtils]: 7: Hoare triple {13274#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13223#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:53,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {13223#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13223#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:53,640 INFO L273 TraceCheckUtils]: 9: Hoare triple {13223#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13224#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:53,640 INFO L273 TraceCheckUtils]: 10: Hoare triple {13224#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13224#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:53,640 INFO L273 TraceCheckUtils]: 11: Hoare triple {13224#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13225#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:53,641 INFO L273 TraceCheckUtils]: 12: Hoare triple {13225#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13225#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:53,641 INFO L273 TraceCheckUtils]: 13: Hoare triple {13225#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13226#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:53,642 INFO L273 TraceCheckUtils]: 14: Hoare triple {13226#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13226#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:53,643 INFO L273 TraceCheckUtils]: 15: Hoare triple {13226#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13227#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:53,643 INFO L273 TraceCheckUtils]: 16: Hoare triple {13227#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13227#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:53,644 INFO L273 TraceCheckUtils]: 17: Hoare triple {13227#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13228#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:53,644 INFO L273 TraceCheckUtils]: 18: Hoare triple {13228#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13228#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:53,645 INFO L273 TraceCheckUtils]: 19: Hoare triple {13228#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13229#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:53,646 INFO L273 TraceCheckUtils]: 20: Hoare triple {13229#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13229#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:53,646 INFO L273 TraceCheckUtils]: 21: Hoare triple {13229#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13230#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:53,647 INFO L273 TraceCheckUtils]: 22: Hoare triple {13230#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13230#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:53,648 INFO L273 TraceCheckUtils]: 23: Hoare triple {13230#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13231#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:53,648 INFO L273 TraceCheckUtils]: 24: Hoare triple {13231#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13231#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:53,649 INFO L273 TraceCheckUtils]: 25: Hoare triple {13231#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13232#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:53,649 INFO L273 TraceCheckUtils]: 26: Hoare triple {13232#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13232#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:53,650 INFO L273 TraceCheckUtils]: 27: Hoare triple {13232#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13233#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:53,651 INFO L273 TraceCheckUtils]: 28: Hoare triple {13233#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13233#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:53,651 INFO L273 TraceCheckUtils]: 29: Hoare triple {13233#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13234#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:53,652 INFO L273 TraceCheckUtils]: 30: Hoare triple {13234#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13234#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:53,653 INFO L273 TraceCheckUtils]: 31: Hoare triple {13234#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13235#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:53,653 INFO L273 TraceCheckUtils]: 32: Hoare triple {13235#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13235#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:53,654 INFO L273 TraceCheckUtils]: 33: Hoare triple {13235#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13236#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:53,654 INFO L273 TraceCheckUtils]: 34: Hoare triple {13236#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13236#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:53,655 INFO L273 TraceCheckUtils]: 35: Hoare triple {13236#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13237#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:53,656 INFO L273 TraceCheckUtils]: 36: Hoare triple {13237#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13237#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:53,656 INFO L273 TraceCheckUtils]: 37: Hoare triple {13237#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13238#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:53,657 INFO L273 TraceCheckUtils]: 38: Hoare triple {13238#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13238#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:53,658 INFO L273 TraceCheckUtils]: 39: Hoare triple {13238#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13239#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:53,658 INFO L273 TraceCheckUtils]: 40: Hoare triple {13239#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13239#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:53,659 INFO L273 TraceCheckUtils]: 41: Hoare triple {13239#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13240#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:53,659 INFO L273 TraceCheckUtils]: 42: Hoare triple {13240#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13240#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:53,660 INFO L273 TraceCheckUtils]: 43: Hoare triple {13240#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13241#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:53,661 INFO L273 TraceCheckUtils]: 44: Hoare triple {13241#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13241#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:53,661 INFO L273 TraceCheckUtils]: 45: Hoare triple {13241#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13242#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:53,662 INFO L273 TraceCheckUtils]: 46: Hoare triple {13242#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13242#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:53,663 INFO L273 TraceCheckUtils]: 47: Hoare triple {13242#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13243#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:53,663 INFO L273 TraceCheckUtils]: 48: Hoare triple {13243#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13243#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:53,664 INFO L273 TraceCheckUtils]: 49: Hoare triple {13243#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13244#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:53,664 INFO L273 TraceCheckUtils]: 50: Hoare triple {13244#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13244#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:53,684 INFO L273 TraceCheckUtils]: 51: Hoare triple {13244#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13245#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:53,698 INFO L273 TraceCheckUtils]: 52: Hoare triple {13245#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13245#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:53,698 INFO L273 TraceCheckUtils]: 53: Hoare triple {13245#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13246#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:53,699 INFO L273 TraceCheckUtils]: 54: Hoare triple {13246#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13246#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:53,699 INFO L273 TraceCheckUtils]: 55: Hoare triple {13246#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13247#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:53,700 INFO L273 TraceCheckUtils]: 56: Hoare triple {13247#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13247#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:53,700 INFO L273 TraceCheckUtils]: 57: Hoare triple {13247#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13248#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:53,700 INFO L273 TraceCheckUtils]: 58: Hoare triple {13248#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13248#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:53,701 INFO L273 TraceCheckUtils]: 59: Hoare triple {13248#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13249#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:53,701 INFO L273 TraceCheckUtils]: 60: Hoare triple {13249#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13249#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:53,702 INFO L273 TraceCheckUtils]: 61: Hoare triple {13249#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13250#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:53,702 INFO L273 TraceCheckUtils]: 62: Hoare triple {13250#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13250#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:53,703 INFO L273 TraceCheckUtils]: 63: Hoare triple {13250#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13251#(<= main_~i~0 29)} is VALID [2018-11-23 13:05:53,703 INFO L273 TraceCheckUtils]: 64: Hoare triple {13251#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13251#(<= main_~i~0 29)} is VALID [2018-11-23 13:05:53,704 INFO L273 TraceCheckUtils]: 65: Hoare triple {13251#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13252#(<= main_~i~0 30)} is VALID [2018-11-23 13:05:53,705 INFO L273 TraceCheckUtils]: 66: Hoare triple {13252#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13252#(<= main_~i~0 30)} is VALID [2018-11-23 13:05:53,705 INFO L273 TraceCheckUtils]: 67: Hoare triple {13252#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13253#(<= main_~i~0 31)} is VALID [2018-11-23 13:05:53,706 INFO L273 TraceCheckUtils]: 68: Hoare triple {13253#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13253#(<= main_~i~0 31)} is VALID [2018-11-23 13:05:53,706 INFO L273 TraceCheckUtils]: 69: Hoare triple {13253#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13254#(<= main_~i~0 32)} is VALID [2018-11-23 13:05:53,707 INFO L273 TraceCheckUtils]: 70: Hoare triple {13254#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13254#(<= main_~i~0 32)} is VALID [2018-11-23 13:05:53,708 INFO L273 TraceCheckUtils]: 71: Hoare triple {13254#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13255#(<= main_~i~0 33)} is VALID [2018-11-23 13:05:53,708 INFO L273 TraceCheckUtils]: 72: Hoare triple {13255#(<= main_~i~0 33)} assume !(~i~0 < 1024); {13221#false} is VALID [2018-11-23 13:05:53,709 INFO L273 TraceCheckUtils]: 73: Hoare triple {13221#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {13221#false} is VALID [2018-11-23 13:05:53,709 INFO L256 TraceCheckUtils]: 74: Hoare triple {13221#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {13221#false} is VALID [2018-11-23 13:05:53,709 INFO L273 TraceCheckUtils]: 75: Hoare triple {13221#false} ~cond := #in~cond; {13221#false} is VALID [2018-11-23 13:05:53,709 INFO L273 TraceCheckUtils]: 76: Hoare triple {13221#false} assume 0 == ~cond; {13221#false} is VALID [2018-11-23 13:05:53,709 INFO L273 TraceCheckUtils]: 77: Hoare triple {13221#false} assume !false; {13221#false} is VALID [2018-11-23 13:05:53,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:53,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:53,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-11-23 13:05:53,735 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 78 [2018-11-23 13:05:53,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:53,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-23 13:05:53,834 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 13:05:53,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 13:05:53,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 13:05:53,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 13:05:53,836 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 37 states. [2018-11-23 13:05:54,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:54,225 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-11-23 13:05:54,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 13:05:54,225 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 78 [2018-11-23 13:05:54,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:54,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 13:05:54,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 88 transitions. [2018-11-23 13:05:54,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 13:05:54,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 88 transitions. [2018-11-23 13:05:54,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 88 transitions. [2018-11-23 13:05:54,322 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:54,323 INFO L225 Difference]: With dead ends: 88 [2018-11-23 13:05:54,324 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 13:05:54,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 13:05:54,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 13:05:54,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-11-23 13:05:54,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:54,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 81 states. [2018-11-23 13:05:54,376 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 81 states. [2018-11-23 13:05:54,376 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 81 states. [2018-11-23 13:05:54,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:54,377 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-11-23 13:05:54,377 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-11-23 13:05:54,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:54,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:54,378 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 82 states. [2018-11-23 13:05:54,378 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 82 states. [2018-11-23 13:05:54,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:54,379 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-11-23 13:05:54,379 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-11-23 13:05:54,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:54,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:54,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:54,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:54,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 13:05:54,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-11-23 13:05:54,380 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-11-23 13:05:54,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:54,381 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-11-23 13:05:54,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 13:05:54,381 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-11-23 13:05:54,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 13:05:54,381 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:54,382 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:54,382 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:54,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:54,382 INFO L82 PathProgramCache]: Analyzing trace with hash 98192161, now seen corresponding path program 34 times [2018-11-23 13:05:54,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:54,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:54,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:54,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:54,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:55,147 INFO L256 TraceCheckUtils]: 0: Hoare triple {13907#true} call ULTIMATE.init(); {13907#true} is VALID [2018-11-23 13:05:55,148 INFO L273 TraceCheckUtils]: 1: Hoare triple {13907#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13907#true} is VALID [2018-11-23 13:05:55,148 INFO L273 TraceCheckUtils]: 2: Hoare triple {13907#true} assume true; {13907#true} is VALID [2018-11-23 13:05:55,148 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13907#true} {13907#true} #35#return; {13907#true} is VALID [2018-11-23 13:05:55,148 INFO L256 TraceCheckUtils]: 4: Hoare triple {13907#true} call #t~ret2 := main(); {13907#true} is VALID [2018-11-23 13:05:55,149 INFO L273 TraceCheckUtils]: 5: Hoare triple {13907#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {13909#(= main_~i~0 0)} is VALID [2018-11-23 13:05:55,149 INFO L273 TraceCheckUtils]: 6: Hoare triple {13909#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13909#(= main_~i~0 0)} is VALID [2018-11-23 13:05:55,150 INFO L273 TraceCheckUtils]: 7: Hoare triple {13909#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13910#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:55,150 INFO L273 TraceCheckUtils]: 8: Hoare triple {13910#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13910#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:55,150 INFO L273 TraceCheckUtils]: 9: Hoare triple {13910#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13911#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:55,151 INFO L273 TraceCheckUtils]: 10: Hoare triple {13911#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13911#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:55,151 INFO L273 TraceCheckUtils]: 11: Hoare triple {13911#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13912#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:55,152 INFO L273 TraceCheckUtils]: 12: Hoare triple {13912#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13912#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:55,152 INFO L273 TraceCheckUtils]: 13: Hoare triple {13912#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13913#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:55,152 INFO L273 TraceCheckUtils]: 14: Hoare triple {13913#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13913#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:55,153 INFO L273 TraceCheckUtils]: 15: Hoare triple {13913#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13914#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:55,153 INFO L273 TraceCheckUtils]: 16: Hoare triple {13914#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13914#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:55,154 INFO L273 TraceCheckUtils]: 17: Hoare triple {13914#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13915#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:55,155 INFO L273 TraceCheckUtils]: 18: Hoare triple {13915#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13915#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:55,155 INFO L273 TraceCheckUtils]: 19: Hoare triple {13915#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13916#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:55,156 INFO L273 TraceCheckUtils]: 20: Hoare triple {13916#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13916#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:55,157 INFO L273 TraceCheckUtils]: 21: Hoare triple {13916#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13917#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:55,157 INFO L273 TraceCheckUtils]: 22: Hoare triple {13917#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13917#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:55,158 INFO L273 TraceCheckUtils]: 23: Hoare triple {13917#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13918#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:55,158 INFO L273 TraceCheckUtils]: 24: Hoare triple {13918#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13918#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:55,159 INFO L273 TraceCheckUtils]: 25: Hoare triple {13918#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:55,160 INFO L273 TraceCheckUtils]: 26: Hoare triple {13919#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13919#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:55,160 INFO L273 TraceCheckUtils]: 27: Hoare triple {13919#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:55,161 INFO L273 TraceCheckUtils]: 28: Hoare triple {13920#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13920#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:55,162 INFO L273 TraceCheckUtils]: 29: Hoare triple {13920#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13921#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:55,162 INFO L273 TraceCheckUtils]: 30: Hoare triple {13921#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13921#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:55,163 INFO L273 TraceCheckUtils]: 31: Hoare triple {13921#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13922#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:55,163 INFO L273 TraceCheckUtils]: 32: Hoare triple {13922#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13922#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:55,164 INFO L273 TraceCheckUtils]: 33: Hoare triple {13922#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13923#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:55,165 INFO L273 TraceCheckUtils]: 34: Hoare triple {13923#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13923#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:55,165 INFO L273 TraceCheckUtils]: 35: Hoare triple {13923#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13924#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:55,166 INFO L273 TraceCheckUtils]: 36: Hoare triple {13924#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13924#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:55,167 INFO L273 TraceCheckUtils]: 37: Hoare triple {13924#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13925#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:55,167 INFO L273 TraceCheckUtils]: 38: Hoare triple {13925#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13925#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:55,168 INFO L273 TraceCheckUtils]: 39: Hoare triple {13925#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13926#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:55,168 INFO L273 TraceCheckUtils]: 40: Hoare triple {13926#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13926#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:55,169 INFO L273 TraceCheckUtils]: 41: Hoare triple {13926#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13927#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:55,170 INFO L273 TraceCheckUtils]: 42: Hoare triple {13927#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13927#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:55,170 INFO L273 TraceCheckUtils]: 43: Hoare triple {13927#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13928#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:55,171 INFO L273 TraceCheckUtils]: 44: Hoare triple {13928#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13928#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:55,172 INFO L273 TraceCheckUtils]: 45: Hoare triple {13928#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13929#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:55,172 INFO L273 TraceCheckUtils]: 46: Hoare triple {13929#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13929#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:55,173 INFO L273 TraceCheckUtils]: 47: Hoare triple {13929#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13930#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:55,173 INFO L273 TraceCheckUtils]: 48: Hoare triple {13930#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13930#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:55,174 INFO L273 TraceCheckUtils]: 49: Hoare triple {13930#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13931#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:55,175 INFO L273 TraceCheckUtils]: 50: Hoare triple {13931#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13931#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:55,175 INFO L273 TraceCheckUtils]: 51: Hoare triple {13931#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13932#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:55,176 INFO L273 TraceCheckUtils]: 52: Hoare triple {13932#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13932#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:55,177 INFO L273 TraceCheckUtils]: 53: Hoare triple {13932#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13933#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:55,177 INFO L273 TraceCheckUtils]: 54: Hoare triple {13933#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13933#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:55,178 INFO L273 TraceCheckUtils]: 55: Hoare triple {13933#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13934#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:55,178 INFO L273 TraceCheckUtils]: 56: Hoare triple {13934#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13934#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:55,179 INFO L273 TraceCheckUtils]: 57: Hoare triple {13934#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13935#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:55,180 INFO L273 TraceCheckUtils]: 58: Hoare triple {13935#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13935#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:55,180 INFO L273 TraceCheckUtils]: 59: Hoare triple {13935#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13936#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:55,181 INFO L273 TraceCheckUtils]: 60: Hoare triple {13936#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13936#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:55,181 INFO L273 TraceCheckUtils]: 61: Hoare triple {13936#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13937#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:55,182 INFO L273 TraceCheckUtils]: 62: Hoare triple {13937#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13937#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:55,183 INFO L273 TraceCheckUtils]: 63: Hoare triple {13937#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13938#(<= main_~i~0 29)} is VALID [2018-11-23 13:05:55,183 INFO L273 TraceCheckUtils]: 64: Hoare triple {13938#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13938#(<= main_~i~0 29)} is VALID [2018-11-23 13:05:55,184 INFO L273 TraceCheckUtils]: 65: Hoare triple {13938#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13939#(<= main_~i~0 30)} is VALID [2018-11-23 13:05:55,184 INFO L273 TraceCheckUtils]: 66: Hoare triple {13939#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13939#(<= main_~i~0 30)} is VALID [2018-11-23 13:05:55,185 INFO L273 TraceCheckUtils]: 67: Hoare triple {13939#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13940#(<= main_~i~0 31)} is VALID [2018-11-23 13:05:55,186 INFO L273 TraceCheckUtils]: 68: Hoare triple {13940#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13940#(<= main_~i~0 31)} is VALID [2018-11-23 13:05:55,186 INFO L273 TraceCheckUtils]: 69: Hoare triple {13940#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13941#(<= main_~i~0 32)} is VALID [2018-11-23 13:05:55,187 INFO L273 TraceCheckUtils]: 70: Hoare triple {13941#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13941#(<= main_~i~0 32)} is VALID [2018-11-23 13:05:55,188 INFO L273 TraceCheckUtils]: 71: Hoare triple {13941#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13942#(<= main_~i~0 33)} is VALID [2018-11-23 13:05:55,188 INFO L273 TraceCheckUtils]: 72: Hoare triple {13942#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13942#(<= main_~i~0 33)} is VALID [2018-11-23 13:05:55,189 INFO L273 TraceCheckUtils]: 73: Hoare triple {13942#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13943#(<= main_~i~0 34)} is VALID [2018-11-23 13:05:55,190 INFO L273 TraceCheckUtils]: 74: Hoare triple {13943#(<= main_~i~0 34)} assume !(~i~0 < 1024); {13908#false} is VALID [2018-11-23 13:05:55,190 INFO L273 TraceCheckUtils]: 75: Hoare triple {13908#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {13908#false} is VALID [2018-11-23 13:05:55,190 INFO L256 TraceCheckUtils]: 76: Hoare triple {13908#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {13908#false} is VALID [2018-11-23 13:05:55,190 INFO L273 TraceCheckUtils]: 77: Hoare triple {13908#false} ~cond := #in~cond; {13908#false} is VALID [2018-11-23 13:05:55,190 INFO L273 TraceCheckUtils]: 78: Hoare triple {13908#false} assume 0 == ~cond; {13908#false} is VALID [2018-11-23 13:05:55,191 INFO L273 TraceCheckUtils]: 79: Hoare triple {13908#false} assume !false; {13908#false} is VALID [2018-11-23 13:05:55,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:55,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:55,197 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:55,206 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:05:55,236 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:05:55,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:55,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:55,471 INFO L256 TraceCheckUtils]: 0: Hoare triple {13907#true} call ULTIMATE.init(); {13907#true} is VALID [2018-11-23 13:05:55,471 INFO L273 TraceCheckUtils]: 1: Hoare triple {13907#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13907#true} is VALID [2018-11-23 13:05:55,471 INFO L273 TraceCheckUtils]: 2: Hoare triple {13907#true} assume true; {13907#true} is VALID [2018-11-23 13:05:55,471 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13907#true} {13907#true} #35#return; {13907#true} is VALID [2018-11-23 13:05:55,471 INFO L256 TraceCheckUtils]: 4: Hoare triple {13907#true} call #t~ret2 := main(); {13907#true} is VALID [2018-11-23 13:05:55,472 INFO L273 TraceCheckUtils]: 5: Hoare triple {13907#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {13962#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:55,472 INFO L273 TraceCheckUtils]: 6: Hoare triple {13962#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13962#(<= main_~i~0 0)} is VALID [2018-11-23 13:05:55,473 INFO L273 TraceCheckUtils]: 7: Hoare triple {13962#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13910#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:55,473 INFO L273 TraceCheckUtils]: 8: Hoare triple {13910#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13910#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:55,474 INFO L273 TraceCheckUtils]: 9: Hoare triple {13910#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13911#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:55,474 INFO L273 TraceCheckUtils]: 10: Hoare triple {13911#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13911#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:55,475 INFO L273 TraceCheckUtils]: 11: Hoare triple {13911#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13912#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:55,475 INFO L273 TraceCheckUtils]: 12: Hoare triple {13912#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13912#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:55,476 INFO L273 TraceCheckUtils]: 13: Hoare triple {13912#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13913#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:55,477 INFO L273 TraceCheckUtils]: 14: Hoare triple {13913#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13913#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:55,477 INFO L273 TraceCheckUtils]: 15: Hoare triple {13913#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13914#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:55,478 INFO L273 TraceCheckUtils]: 16: Hoare triple {13914#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13914#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:55,479 INFO L273 TraceCheckUtils]: 17: Hoare triple {13914#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13915#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:55,479 INFO L273 TraceCheckUtils]: 18: Hoare triple {13915#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13915#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:55,480 INFO L273 TraceCheckUtils]: 19: Hoare triple {13915#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13916#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:55,480 INFO L273 TraceCheckUtils]: 20: Hoare triple {13916#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13916#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:55,481 INFO L273 TraceCheckUtils]: 21: Hoare triple {13916#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13917#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:55,482 INFO L273 TraceCheckUtils]: 22: Hoare triple {13917#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13917#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:55,482 INFO L273 TraceCheckUtils]: 23: Hoare triple {13917#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13918#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:55,483 INFO L273 TraceCheckUtils]: 24: Hoare triple {13918#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13918#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:55,484 INFO L273 TraceCheckUtils]: 25: Hoare triple {13918#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:55,484 INFO L273 TraceCheckUtils]: 26: Hoare triple {13919#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13919#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:55,485 INFO L273 TraceCheckUtils]: 27: Hoare triple {13919#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:55,485 INFO L273 TraceCheckUtils]: 28: Hoare triple {13920#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13920#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:55,486 INFO L273 TraceCheckUtils]: 29: Hoare triple {13920#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13921#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:55,487 INFO L273 TraceCheckUtils]: 30: Hoare triple {13921#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13921#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:55,487 INFO L273 TraceCheckUtils]: 31: Hoare triple {13921#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13922#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:55,488 INFO L273 TraceCheckUtils]: 32: Hoare triple {13922#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13922#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:55,489 INFO L273 TraceCheckUtils]: 33: Hoare triple {13922#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13923#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:55,489 INFO L273 TraceCheckUtils]: 34: Hoare triple {13923#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13923#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:55,490 INFO L273 TraceCheckUtils]: 35: Hoare triple {13923#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13924#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:55,490 INFO L273 TraceCheckUtils]: 36: Hoare triple {13924#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13924#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:55,491 INFO L273 TraceCheckUtils]: 37: Hoare triple {13924#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13925#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:55,492 INFO L273 TraceCheckUtils]: 38: Hoare triple {13925#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13925#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:55,492 INFO L273 TraceCheckUtils]: 39: Hoare triple {13925#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13926#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:55,493 INFO L273 TraceCheckUtils]: 40: Hoare triple {13926#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13926#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:55,494 INFO L273 TraceCheckUtils]: 41: Hoare triple {13926#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13927#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:55,494 INFO L273 TraceCheckUtils]: 42: Hoare triple {13927#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13927#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:55,495 INFO L273 TraceCheckUtils]: 43: Hoare triple {13927#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13928#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:55,495 INFO L273 TraceCheckUtils]: 44: Hoare triple {13928#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13928#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:55,496 INFO L273 TraceCheckUtils]: 45: Hoare triple {13928#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13929#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:55,497 INFO L273 TraceCheckUtils]: 46: Hoare triple {13929#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13929#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:55,497 INFO L273 TraceCheckUtils]: 47: Hoare triple {13929#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13930#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:55,498 INFO L273 TraceCheckUtils]: 48: Hoare triple {13930#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13930#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:55,499 INFO L273 TraceCheckUtils]: 49: Hoare triple {13930#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13931#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:55,499 INFO L273 TraceCheckUtils]: 50: Hoare triple {13931#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13931#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:55,500 INFO L273 TraceCheckUtils]: 51: Hoare triple {13931#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13932#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:55,500 INFO L273 TraceCheckUtils]: 52: Hoare triple {13932#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13932#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:55,501 INFO L273 TraceCheckUtils]: 53: Hoare triple {13932#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13933#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:55,501 INFO L273 TraceCheckUtils]: 54: Hoare triple {13933#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13933#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:55,502 INFO L273 TraceCheckUtils]: 55: Hoare triple {13933#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13934#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:55,503 INFO L273 TraceCheckUtils]: 56: Hoare triple {13934#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13934#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:55,503 INFO L273 TraceCheckUtils]: 57: Hoare triple {13934#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13935#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:55,504 INFO L273 TraceCheckUtils]: 58: Hoare triple {13935#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13935#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:55,505 INFO L273 TraceCheckUtils]: 59: Hoare triple {13935#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13936#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:55,507 INFO L273 TraceCheckUtils]: 60: Hoare triple {13936#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13936#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:55,508 INFO L273 TraceCheckUtils]: 61: Hoare triple {13936#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13937#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:55,508 INFO L273 TraceCheckUtils]: 62: Hoare triple {13937#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13937#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:55,509 INFO L273 TraceCheckUtils]: 63: Hoare triple {13937#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13938#(<= main_~i~0 29)} is VALID [2018-11-23 13:05:55,509 INFO L273 TraceCheckUtils]: 64: Hoare triple {13938#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13938#(<= main_~i~0 29)} is VALID [2018-11-23 13:05:55,509 INFO L273 TraceCheckUtils]: 65: Hoare triple {13938#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13939#(<= main_~i~0 30)} is VALID [2018-11-23 13:05:55,510 INFO L273 TraceCheckUtils]: 66: Hoare triple {13939#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13939#(<= main_~i~0 30)} is VALID [2018-11-23 13:05:55,510 INFO L273 TraceCheckUtils]: 67: Hoare triple {13939#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13940#(<= main_~i~0 31)} is VALID [2018-11-23 13:05:55,511 INFO L273 TraceCheckUtils]: 68: Hoare triple {13940#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13940#(<= main_~i~0 31)} is VALID [2018-11-23 13:05:55,511 INFO L273 TraceCheckUtils]: 69: Hoare triple {13940#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13941#(<= main_~i~0 32)} is VALID [2018-11-23 13:05:55,512 INFO L273 TraceCheckUtils]: 70: Hoare triple {13941#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13941#(<= main_~i~0 32)} is VALID [2018-11-23 13:05:55,513 INFO L273 TraceCheckUtils]: 71: Hoare triple {13941#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13942#(<= main_~i~0 33)} is VALID [2018-11-23 13:05:55,513 INFO L273 TraceCheckUtils]: 72: Hoare triple {13942#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13942#(<= main_~i~0 33)} is VALID [2018-11-23 13:05:55,514 INFO L273 TraceCheckUtils]: 73: Hoare triple {13942#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13943#(<= main_~i~0 34)} is VALID [2018-11-23 13:05:55,514 INFO L273 TraceCheckUtils]: 74: Hoare triple {13943#(<= main_~i~0 34)} assume !(~i~0 < 1024); {13908#false} is VALID [2018-11-23 13:05:55,515 INFO L273 TraceCheckUtils]: 75: Hoare triple {13908#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {13908#false} is VALID [2018-11-23 13:05:55,515 INFO L256 TraceCheckUtils]: 76: Hoare triple {13908#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {13908#false} is VALID [2018-11-23 13:05:55,515 INFO L273 TraceCheckUtils]: 77: Hoare triple {13908#false} ~cond := #in~cond; {13908#false} is VALID [2018-11-23 13:05:55,515 INFO L273 TraceCheckUtils]: 78: Hoare triple {13908#false} assume 0 == ~cond; {13908#false} is VALID [2018-11-23 13:05:55,515 INFO L273 TraceCheckUtils]: 79: Hoare triple {13908#false} assume !false; {13908#false} is VALID [2018-11-23 13:05:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:55,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:55,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-11-23 13:05:55,540 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 80 [2018-11-23 13:05:55,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:55,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 13:05:56,061 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:56,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 13:05:56,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 13:05:56,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 13:05:56,063 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 38 states. [2018-11-23 13:05:58,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:58,104 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-11-23 13:05:58,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 13:05:58,104 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 80 [2018-11-23 13:05:58,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:58,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 13:05:58,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 90 transitions. [2018-11-23 13:05:58,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 13:05:58,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 90 transitions. [2018-11-23 13:05:58,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 90 transitions. [2018-11-23 13:05:58,195 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 13:05:58,197 INFO L225 Difference]: With dead ends: 90 [2018-11-23 13:05:58,197 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 13:05:58,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 13:05:58,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 13:05:58,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-11-23 13:05:58,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:58,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 83 states. [2018-11-23 13:05:58,230 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 83 states. [2018-11-23 13:05:58,231 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 83 states. [2018-11-23 13:05:58,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:58,232 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-11-23 13:05:58,232 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-11-23 13:05:58,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:58,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:58,233 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 84 states. [2018-11-23 13:05:58,233 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 84 states. [2018-11-23 13:05:58,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:58,234 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-11-23 13:05:58,234 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-11-23 13:05:58,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:58,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:58,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:58,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:58,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 13:05:58,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-11-23 13:05:58,236 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-11-23 13:05:58,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:58,236 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-11-23 13:05:58,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 13:05:58,237 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-11-23 13:05:58,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-23 13:05:58,237 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:58,237 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:58,238 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:58,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:58,238 INFO L82 PathProgramCache]: Analyzing trace with hash -967335485, now seen corresponding path program 35 times [2018-11-23 13:05:58,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:58,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:58,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:58,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:58,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:58,922 INFO L256 TraceCheckUtils]: 0: Hoare triple {14611#true} call ULTIMATE.init(); {14611#true} is VALID [2018-11-23 13:05:58,922 INFO L273 TraceCheckUtils]: 1: Hoare triple {14611#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14611#true} is VALID [2018-11-23 13:05:58,922 INFO L273 TraceCheckUtils]: 2: Hoare triple {14611#true} assume true; {14611#true} is VALID [2018-11-23 13:05:58,922 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14611#true} {14611#true} #35#return; {14611#true} is VALID [2018-11-23 13:05:58,922 INFO L256 TraceCheckUtils]: 4: Hoare triple {14611#true} call #t~ret2 := main(); {14611#true} is VALID [2018-11-23 13:05:58,923 INFO L273 TraceCheckUtils]: 5: Hoare triple {14611#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {14613#(= main_~i~0 0)} is VALID [2018-11-23 13:05:58,923 INFO L273 TraceCheckUtils]: 6: Hoare triple {14613#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14613#(= main_~i~0 0)} is VALID [2018-11-23 13:05:58,924 INFO L273 TraceCheckUtils]: 7: Hoare triple {14613#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14614#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:58,924 INFO L273 TraceCheckUtils]: 8: Hoare triple {14614#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14614#(<= main_~i~0 1)} is VALID [2018-11-23 13:05:58,925 INFO L273 TraceCheckUtils]: 9: Hoare triple {14614#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14615#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:58,926 INFO L273 TraceCheckUtils]: 10: Hoare triple {14615#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14615#(<= main_~i~0 2)} is VALID [2018-11-23 13:05:58,926 INFO L273 TraceCheckUtils]: 11: Hoare triple {14615#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14616#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:58,927 INFO L273 TraceCheckUtils]: 12: Hoare triple {14616#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14616#(<= main_~i~0 3)} is VALID [2018-11-23 13:05:58,928 INFO L273 TraceCheckUtils]: 13: Hoare triple {14616#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14617#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:58,928 INFO L273 TraceCheckUtils]: 14: Hoare triple {14617#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14617#(<= main_~i~0 4)} is VALID [2018-11-23 13:05:58,929 INFO L273 TraceCheckUtils]: 15: Hoare triple {14617#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14618#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:58,929 INFO L273 TraceCheckUtils]: 16: Hoare triple {14618#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14618#(<= main_~i~0 5)} is VALID [2018-11-23 13:05:58,930 INFO L273 TraceCheckUtils]: 17: Hoare triple {14618#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14619#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:58,931 INFO L273 TraceCheckUtils]: 18: Hoare triple {14619#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14619#(<= main_~i~0 6)} is VALID [2018-11-23 13:05:58,931 INFO L273 TraceCheckUtils]: 19: Hoare triple {14619#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14620#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:58,932 INFO L273 TraceCheckUtils]: 20: Hoare triple {14620#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14620#(<= main_~i~0 7)} is VALID [2018-11-23 13:05:58,933 INFO L273 TraceCheckUtils]: 21: Hoare triple {14620#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14621#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:58,933 INFO L273 TraceCheckUtils]: 22: Hoare triple {14621#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14621#(<= main_~i~0 8)} is VALID [2018-11-23 13:05:58,934 INFO L273 TraceCheckUtils]: 23: Hoare triple {14621#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14622#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:58,934 INFO L273 TraceCheckUtils]: 24: Hoare triple {14622#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14622#(<= main_~i~0 9)} is VALID [2018-11-23 13:05:58,935 INFO L273 TraceCheckUtils]: 25: Hoare triple {14622#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14623#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:58,936 INFO L273 TraceCheckUtils]: 26: Hoare triple {14623#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14623#(<= main_~i~0 10)} is VALID [2018-11-23 13:05:58,936 INFO L273 TraceCheckUtils]: 27: Hoare triple {14623#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14624#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:58,937 INFO L273 TraceCheckUtils]: 28: Hoare triple {14624#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14624#(<= main_~i~0 11)} is VALID [2018-11-23 13:05:58,938 INFO L273 TraceCheckUtils]: 29: Hoare triple {14624#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14625#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:58,938 INFO L273 TraceCheckUtils]: 30: Hoare triple {14625#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14625#(<= main_~i~0 12)} is VALID [2018-11-23 13:05:58,939 INFO L273 TraceCheckUtils]: 31: Hoare triple {14625#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14626#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:58,939 INFO L273 TraceCheckUtils]: 32: Hoare triple {14626#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14626#(<= main_~i~0 13)} is VALID [2018-11-23 13:05:58,940 INFO L273 TraceCheckUtils]: 33: Hoare triple {14626#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14627#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:58,940 INFO L273 TraceCheckUtils]: 34: Hoare triple {14627#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14627#(<= main_~i~0 14)} is VALID [2018-11-23 13:05:58,941 INFO L273 TraceCheckUtils]: 35: Hoare triple {14627#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14628#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:58,942 INFO L273 TraceCheckUtils]: 36: Hoare triple {14628#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14628#(<= main_~i~0 15)} is VALID [2018-11-23 13:05:58,942 INFO L273 TraceCheckUtils]: 37: Hoare triple {14628#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14629#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:58,943 INFO L273 TraceCheckUtils]: 38: Hoare triple {14629#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14629#(<= main_~i~0 16)} is VALID [2018-11-23 13:05:58,944 INFO L273 TraceCheckUtils]: 39: Hoare triple {14629#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14630#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:58,944 INFO L273 TraceCheckUtils]: 40: Hoare triple {14630#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14630#(<= main_~i~0 17)} is VALID [2018-11-23 13:05:58,945 INFO L273 TraceCheckUtils]: 41: Hoare triple {14630#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14631#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:58,945 INFO L273 TraceCheckUtils]: 42: Hoare triple {14631#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14631#(<= main_~i~0 18)} is VALID [2018-11-23 13:05:58,946 INFO L273 TraceCheckUtils]: 43: Hoare triple {14631#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14632#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:58,947 INFO L273 TraceCheckUtils]: 44: Hoare triple {14632#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14632#(<= main_~i~0 19)} is VALID [2018-11-23 13:05:58,947 INFO L273 TraceCheckUtils]: 45: Hoare triple {14632#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14633#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:58,948 INFO L273 TraceCheckUtils]: 46: Hoare triple {14633#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14633#(<= main_~i~0 20)} is VALID [2018-11-23 13:05:58,949 INFO L273 TraceCheckUtils]: 47: Hoare triple {14633#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14634#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:58,949 INFO L273 TraceCheckUtils]: 48: Hoare triple {14634#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14634#(<= main_~i~0 21)} is VALID [2018-11-23 13:05:58,950 INFO L273 TraceCheckUtils]: 49: Hoare triple {14634#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14635#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:58,950 INFO L273 TraceCheckUtils]: 50: Hoare triple {14635#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14635#(<= main_~i~0 22)} is VALID [2018-11-23 13:05:58,951 INFO L273 TraceCheckUtils]: 51: Hoare triple {14635#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14636#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:58,952 INFO L273 TraceCheckUtils]: 52: Hoare triple {14636#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14636#(<= main_~i~0 23)} is VALID [2018-11-23 13:05:58,952 INFO L273 TraceCheckUtils]: 53: Hoare triple {14636#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14637#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:58,953 INFO L273 TraceCheckUtils]: 54: Hoare triple {14637#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14637#(<= main_~i~0 24)} is VALID [2018-11-23 13:05:58,954 INFO L273 TraceCheckUtils]: 55: Hoare triple {14637#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14638#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:58,974 INFO L273 TraceCheckUtils]: 56: Hoare triple {14638#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14638#(<= main_~i~0 25)} is VALID [2018-11-23 13:05:58,987 INFO L273 TraceCheckUtils]: 57: Hoare triple {14638#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14639#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:58,996 INFO L273 TraceCheckUtils]: 58: Hoare triple {14639#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14639#(<= main_~i~0 26)} is VALID [2018-11-23 13:05:59,009 INFO L273 TraceCheckUtils]: 59: Hoare triple {14639#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14640#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:59,017 INFO L273 TraceCheckUtils]: 60: Hoare triple {14640#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14640#(<= main_~i~0 27)} is VALID [2018-11-23 13:05:59,032 INFO L273 TraceCheckUtils]: 61: Hoare triple {14640#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14641#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:59,040 INFO L273 TraceCheckUtils]: 62: Hoare triple {14641#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14641#(<= main_~i~0 28)} is VALID [2018-11-23 13:05:59,054 INFO L273 TraceCheckUtils]: 63: Hoare triple {14641#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14642#(<= main_~i~0 29)} is VALID [2018-11-23 13:05:59,063 INFO L273 TraceCheckUtils]: 64: Hoare triple {14642#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14642#(<= main_~i~0 29)} is VALID [2018-11-23 13:05:59,075 INFO L273 TraceCheckUtils]: 65: Hoare triple {14642#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14643#(<= main_~i~0 30)} is VALID [2018-11-23 13:05:59,093 INFO L273 TraceCheckUtils]: 66: Hoare triple {14643#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14643#(<= main_~i~0 30)} is VALID [2018-11-23 13:05:59,102 INFO L273 TraceCheckUtils]: 67: Hoare triple {14643#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14644#(<= main_~i~0 31)} is VALID [2018-11-23 13:05:59,114 INFO L273 TraceCheckUtils]: 68: Hoare triple {14644#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14644#(<= main_~i~0 31)} is VALID [2018-11-23 13:05:59,127 INFO L273 TraceCheckUtils]: 69: Hoare triple {14644#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14645#(<= main_~i~0 32)} is VALID [2018-11-23 13:05:59,139 INFO L273 TraceCheckUtils]: 70: Hoare triple {14645#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14645#(<= main_~i~0 32)} is VALID [2018-11-23 13:05:59,154 INFO L273 TraceCheckUtils]: 71: Hoare triple {14645#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14646#(<= main_~i~0 33)} is VALID [2018-11-23 13:05:59,163 INFO L273 TraceCheckUtils]: 72: Hoare triple {14646#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14646#(<= main_~i~0 33)} is VALID [2018-11-23 13:05:59,175 INFO L273 TraceCheckUtils]: 73: Hoare triple {14646#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14647#(<= main_~i~0 34)} is VALID [2018-11-23 13:05:59,183 INFO L273 TraceCheckUtils]: 74: Hoare triple {14647#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14647#(<= main_~i~0 34)} is VALID [2018-11-23 13:05:59,184 INFO L273 TraceCheckUtils]: 75: Hoare triple {14647#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14648#(<= main_~i~0 35)} is VALID [2018-11-23 13:05:59,185 INFO L273 TraceCheckUtils]: 76: Hoare triple {14648#(<= main_~i~0 35)} assume !(~i~0 < 1024); {14612#false} is VALID [2018-11-23 13:05:59,185 INFO L273 TraceCheckUtils]: 77: Hoare triple {14612#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {14612#false} is VALID [2018-11-23 13:05:59,185 INFO L256 TraceCheckUtils]: 78: Hoare triple {14612#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {14612#false} is VALID [2018-11-23 13:05:59,185 INFO L273 TraceCheckUtils]: 79: Hoare triple {14612#false} ~cond := #in~cond; {14612#false} is VALID [2018-11-23 13:05:59,185 INFO L273 TraceCheckUtils]: 80: Hoare triple {14612#false} assume 0 == ~cond; {14612#false} is VALID [2018-11-23 13:05:59,185 INFO L273 TraceCheckUtils]: 81: Hoare triple {14612#false} assume !false; {14612#false} is VALID [2018-11-23 13:05:59,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:59,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:59,190 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:59,198 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:06:00,495 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-11-23 13:06:00,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:00,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:01,019 INFO L256 TraceCheckUtils]: 0: Hoare triple {14611#true} call ULTIMATE.init(); {14611#true} is VALID [2018-11-23 13:06:01,020 INFO L273 TraceCheckUtils]: 1: Hoare triple {14611#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14611#true} is VALID [2018-11-23 13:06:01,020 INFO L273 TraceCheckUtils]: 2: Hoare triple {14611#true} assume true; {14611#true} is VALID [2018-11-23 13:06:01,020 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14611#true} {14611#true} #35#return; {14611#true} is VALID [2018-11-23 13:06:01,020 INFO L256 TraceCheckUtils]: 4: Hoare triple {14611#true} call #t~ret2 := main(); {14611#true} is VALID [2018-11-23 13:06:01,020 INFO L273 TraceCheckUtils]: 5: Hoare triple {14611#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {14667#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:01,021 INFO L273 TraceCheckUtils]: 6: Hoare triple {14667#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14667#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:01,021 INFO L273 TraceCheckUtils]: 7: Hoare triple {14667#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14614#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:01,021 INFO L273 TraceCheckUtils]: 8: Hoare triple {14614#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14614#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:01,022 INFO L273 TraceCheckUtils]: 9: Hoare triple {14614#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14615#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:01,022 INFO L273 TraceCheckUtils]: 10: Hoare triple {14615#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14615#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:01,023 INFO L273 TraceCheckUtils]: 11: Hoare triple {14615#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14616#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:01,023 INFO L273 TraceCheckUtils]: 12: Hoare triple {14616#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14616#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:01,023 INFO L273 TraceCheckUtils]: 13: Hoare triple {14616#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14617#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:01,024 INFO L273 TraceCheckUtils]: 14: Hoare triple {14617#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14617#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:01,025 INFO L273 TraceCheckUtils]: 15: Hoare triple {14617#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14618#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:01,025 INFO L273 TraceCheckUtils]: 16: Hoare triple {14618#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14618#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:01,026 INFO L273 TraceCheckUtils]: 17: Hoare triple {14618#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14619#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:01,026 INFO L273 TraceCheckUtils]: 18: Hoare triple {14619#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14619#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:01,027 INFO L273 TraceCheckUtils]: 19: Hoare triple {14619#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14620#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:01,028 INFO L273 TraceCheckUtils]: 20: Hoare triple {14620#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14620#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:01,028 INFO L273 TraceCheckUtils]: 21: Hoare triple {14620#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14621#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:01,029 INFO L273 TraceCheckUtils]: 22: Hoare triple {14621#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14621#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:01,029 INFO L273 TraceCheckUtils]: 23: Hoare triple {14621#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14622#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:01,030 INFO L273 TraceCheckUtils]: 24: Hoare triple {14622#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14622#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:01,031 INFO L273 TraceCheckUtils]: 25: Hoare triple {14622#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14623#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:01,031 INFO L273 TraceCheckUtils]: 26: Hoare triple {14623#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14623#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:01,032 INFO L273 TraceCheckUtils]: 27: Hoare triple {14623#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14624#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:01,032 INFO L273 TraceCheckUtils]: 28: Hoare triple {14624#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14624#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:01,033 INFO L273 TraceCheckUtils]: 29: Hoare triple {14624#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14625#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:01,034 INFO L273 TraceCheckUtils]: 30: Hoare triple {14625#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14625#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:01,034 INFO L273 TraceCheckUtils]: 31: Hoare triple {14625#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14626#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:01,035 INFO L273 TraceCheckUtils]: 32: Hoare triple {14626#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14626#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:01,036 INFO L273 TraceCheckUtils]: 33: Hoare triple {14626#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14627#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:01,036 INFO L273 TraceCheckUtils]: 34: Hoare triple {14627#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14627#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:01,037 INFO L273 TraceCheckUtils]: 35: Hoare triple {14627#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14628#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:01,037 INFO L273 TraceCheckUtils]: 36: Hoare triple {14628#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14628#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:01,038 INFO L273 TraceCheckUtils]: 37: Hoare triple {14628#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14629#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:01,039 INFO L273 TraceCheckUtils]: 38: Hoare triple {14629#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14629#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:01,039 INFO L273 TraceCheckUtils]: 39: Hoare triple {14629#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14630#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:01,040 INFO L273 TraceCheckUtils]: 40: Hoare triple {14630#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14630#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:01,040 INFO L273 TraceCheckUtils]: 41: Hoare triple {14630#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14631#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:01,041 INFO L273 TraceCheckUtils]: 42: Hoare triple {14631#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14631#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:01,042 INFO L273 TraceCheckUtils]: 43: Hoare triple {14631#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14632#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:01,042 INFO L273 TraceCheckUtils]: 44: Hoare triple {14632#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14632#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:01,043 INFO L273 TraceCheckUtils]: 45: Hoare triple {14632#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14633#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:01,043 INFO L273 TraceCheckUtils]: 46: Hoare triple {14633#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14633#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:01,045 INFO L273 TraceCheckUtils]: 47: Hoare triple {14633#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14634#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:01,046 INFO L273 TraceCheckUtils]: 48: Hoare triple {14634#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14634#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:01,046 INFO L273 TraceCheckUtils]: 49: Hoare triple {14634#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14635#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:01,047 INFO L273 TraceCheckUtils]: 50: Hoare triple {14635#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14635#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:01,047 INFO L273 TraceCheckUtils]: 51: Hoare triple {14635#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14636#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:01,048 INFO L273 TraceCheckUtils]: 52: Hoare triple {14636#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14636#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:01,048 INFO L273 TraceCheckUtils]: 53: Hoare triple {14636#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14637#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:01,048 INFO L273 TraceCheckUtils]: 54: Hoare triple {14637#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14637#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:01,049 INFO L273 TraceCheckUtils]: 55: Hoare triple {14637#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14638#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:01,049 INFO L273 TraceCheckUtils]: 56: Hoare triple {14638#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14638#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:01,050 INFO L273 TraceCheckUtils]: 57: Hoare triple {14638#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14639#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:01,050 INFO L273 TraceCheckUtils]: 58: Hoare triple {14639#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14639#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:01,051 INFO L273 TraceCheckUtils]: 59: Hoare triple {14639#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14640#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:01,052 INFO L273 TraceCheckUtils]: 60: Hoare triple {14640#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14640#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:01,052 INFO L273 TraceCheckUtils]: 61: Hoare triple {14640#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14641#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:01,053 INFO L273 TraceCheckUtils]: 62: Hoare triple {14641#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14641#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:01,054 INFO L273 TraceCheckUtils]: 63: Hoare triple {14641#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14642#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:01,054 INFO L273 TraceCheckUtils]: 64: Hoare triple {14642#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14642#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:01,055 INFO L273 TraceCheckUtils]: 65: Hoare triple {14642#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14643#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:01,055 INFO L273 TraceCheckUtils]: 66: Hoare triple {14643#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14643#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:01,056 INFO L273 TraceCheckUtils]: 67: Hoare triple {14643#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14644#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:01,057 INFO L273 TraceCheckUtils]: 68: Hoare triple {14644#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14644#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:01,057 INFO L273 TraceCheckUtils]: 69: Hoare triple {14644#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14645#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:01,058 INFO L273 TraceCheckUtils]: 70: Hoare triple {14645#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14645#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:01,059 INFO L273 TraceCheckUtils]: 71: Hoare triple {14645#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14646#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:01,059 INFO L273 TraceCheckUtils]: 72: Hoare triple {14646#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14646#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:01,060 INFO L273 TraceCheckUtils]: 73: Hoare triple {14646#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14647#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:01,060 INFO L273 TraceCheckUtils]: 74: Hoare triple {14647#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14647#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:01,061 INFO L273 TraceCheckUtils]: 75: Hoare triple {14647#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14648#(<= main_~i~0 35)} is VALID [2018-11-23 13:06:01,062 INFO L273 TraceCheckUtils]: 76: Hoare triple {14648#(<= main_~i~0 35)} assume !(~i~0 < 1024); {14612#false} is VALID [2018-11-23 13:06:01,062 INFO L273 TraceCheckUtils]: 77: Hoare triple {14612#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {14612#false} is VALID [2018-11-23 13:06:01,062 INFO L256 TraceCheckUtils]: 78: Hoare triple {14612#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {14612#false} is VALID [2018-11-23 13:06:01,062 INFO L273 TraceCheckUtils]: 79: Hoare triple {14612#false} ~cond := #in~cond; {14612#false} is VALID [2018-11-23 13:06:01,063 INFO L273 TraceCheckUtils]: 80: Hoare triple {14612#false} assume 0 == ~cond; {14612#false} is VALID [2018-11-23 13:06:01,063 INFO L273 TraceCheckUtils]: 81: Hoare triple {14612#false} assume !false; {14612#false} is VALID [2018-11-23 13:06:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:01,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:01,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-11-23 13:06:01,088 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 82 [2018-11-23 13:06:01,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:01,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-23 13:06:01,169 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:01,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-23 13:06:01,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 13:06:01,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 13:06:01,171 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 39 states. [2018-11-23 13:06:01,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:01,701 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-11-23 13:06:01,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 13:06:01,701 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 82 [2018-11-23 13:06:01,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:01,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:06:01,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 92 transitions. [2018-11-23 13:06:01,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:06:01,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 92 transitions. [2018-11-23 13:06:01,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 92 transitions. [2018-11-23 13:06:01,802 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:01,804 INFO L225 Difference]: With dead ends: 92 [2018-11-23 13:06:01,805 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 13:06:01,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 13:06:01,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 13:06:01,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-11-23 13:06:01,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:01,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 85 states. [2018-11-23 13:06:01,863 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 85 states. [2018-11-23 13:06:01,863 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 85 states. [2018-11-23 13:06:01,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:01,864 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-11-23 13:06:01,865 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-11-23 13:06:01,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:01,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:01,865 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 86 states. [2018-11-23 13:06:01,865 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 86 states. [2018-11-23 13:06:01,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:01,866 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-11-23 13:06:01,866 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-11-23 13:06:01,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:01,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:01,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:01,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:01,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 13:06:01,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-11-23 13:06:01,869 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-11-23 13:06:01,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:01,869 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-11-23 13:06:01,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-23 13:06:01,869 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-11-23 13:06:01,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-23 13:06:01,869 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:01,870 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:01,870 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:01,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:01,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1557780453, now seen corresponding path program 36 times [2018-11-23 13:06:01,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:01,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:01,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:01,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:01,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:03,351 INFO L256 TraceCheckUtils]: 0: Hoare triple {15332#true} call ULTIMATE.init(); {15332#true} is VALID [2018-11-23 13:06:03,351 INFO L273 TraceCheckUtils]: 1: Hoare triple {15332#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15332#true} is VALID [2018-11-23 13:06:03,351 INFO L273 TraceCheckUtils]: 2: Hoare triple {15332#true} assume true; {15332#true} is VALID [2018-11-23 13:06:03,351 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15332#true} {15332#true} #35#return; {15332#true} is VALID [2018-11-23 13:06:03,351 INFO L256 TraceCheckUtils]: 4: Hoare triple {15332#true} call #t~ret2 := main(); {15332#true} is VALID [2018-11-23 13:06:03,352 INFO L273 TraceCheckUtils]: 5: Hoare triple {15332#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {15334#(= main_~i~0 0)} is VALID [2018-11-23 13:06:03,352 INFO L273 TraceCheckUtils]: 6: Hoare triple {15334#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15334#(= main_~i~0 0)} is VALID [2018-11-23 13:06:03,353 INFO L273 TraceCheckUtils]: 7: Hoare triple {15334#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15335#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:03,353 INFO L273 TraceCheckUtils]: 8: Hoare triple {15335#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15335#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:03,354 INFO L273 TraceCheckUtils]: 9: Hoare triple {15335#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15336#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:03,355 INFO L273 TraceCheckUtils]: 10: Hoare triple {15336#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15336#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:03,355 INFO L273 TraceCheckUtils]: 11: Hoare triple {15336#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15337#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:03,356 INFO L273 TraceCheckUtils]: 12: Hoare triple {15337#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15337#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:03,357 INFO L273 TraceCheckUtils]: 13: Hoare triple {15337#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15338#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:03,357 INFO L273 TraceCheckUtils]: 14: Hoare triple {15338#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15338#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:03,358 INFO L273 TraceCheckUtils]: 15: Hoare triple {15338#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15339#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:03,358 INFO L273 TraceCheckUtils]: 16: Hoare triple {15339#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15339#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:03,359 INFO L273 TraceCheckUtils]: 17: Hoare triple {15339#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15340#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:03,360 INFO L273 TraceCheckUtils]: 18: Hoare triple {15340#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15340#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:03,360 INFO L273 TraceCheckUtils]: 19: Hoare triple {15340#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15341#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:03,361 INFO L273 TraceCheckUtils]: 20: Hoare triple {15341#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15341#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:03,362 INFO L273 TraceCheckUtils]: 21: Hoare triple {15341#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15342#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:03,362 INFO L273 TraceCheckUtils]: 22: Hoare triple {15342#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15342#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:03,363 INFO L273 TraceCheckUtils]: 23: Hoare triple {15342#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15343#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:03,363 INFO L273 TraceCheckUtils]: 24: Hoare triple {15343#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15343#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:03,364 INFO L273 TraceCheckUtils]: 25: Hoare triple {15343#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15344#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:03,365 INFO L273 TraceCheckUtils]: 26: Hoare triple {15344#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15344#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:03,365 INFO L273 TraceCheckUtils]: 27: Hoare triple {15344#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15345#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:03,366 INFO L273 TraceCheckUtils]: 28: Hoare triple {15345#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15345#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:03,367 INFO L273 TraceCheckUtils]: 29: Hoare triple {15345#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15346#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:03,367 INFO L273 TraceCheckUtils]: 30: Hoare triple {15346#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15346#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:03,368 INFO L273 TraceCheckUtils]: 31: Hoare triple {15346#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15347#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:03,368 INFO L273 TraceCheckUtils]: 32: Hoare triple {15347#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15347#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:03,369 INFO L273 TraceCheckUtils]: 33: Hoare triple {15347#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15348#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:03,369 INFO L273 TraceCheckUtils]: 34: Hoare triple {15348#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15348#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:03,370 INFO L273 TraceCheckUtils]: 35: Hoare triple {15348#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15349#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:03,371 INFO L273 TraceCheckUtils]: 36: Hoare triple {15349#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15349#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:03,371 INFO L273 TraceCheckUtils]: 37: Hoare triple {15349#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15350#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:03,372 INFO L273 TraceCheckUtils]: 38: Hoare triple {15350#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15350#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:03,373 INFO L273 TraceCheckUtils]: 39: Hoare triple {15350#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15351#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:03,373 INFO L273 TraceCheckUtils]: 40: Hoare triple {15351#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15351#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:03,374 INFO L273 TraceCheckUtils]: 41: Hoare triple {15351#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15352#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:03,374 INFO L273 TraceCheckUtils]: 42: Hoare triple {15352#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15352#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:03,375 INFO L273 TraceCheckUtils]: 43: Hoare triple {15352#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15353#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:03,376 INFO L273 TraceCheckUtils]: 44: Hoare triple {15353#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15353#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:03,376 INFO L273 TraceCheckUtils]: 45: Hoare triple {15353#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15354#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:03,377 INFO L273 TraceCheckUtils]: 46: Hoare triple {15354#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15354#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:03,378 INFO L273 TraceCheckUtils]: 47: Hoare triple {15354#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15355#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:03,378 INFO L273 TraceCheckUtils]: 48: Hoare triple {15355#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15355#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:03,379 INFO L273 TraceCheckUtils]: 49: Hoare triple {15355#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15356#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:03,379 INFO L273 TraceCheckUtils]: 50: Hoare triple {15356#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15356#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:03,380 INFO L273 TraceCheckUtils]: 51: Hoare triple {15356#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15357#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:03,381 INFO L273 TraceCheckUtils]: 52: Hoare triple {15357#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15357#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:03,381 INFO L273 TraceCheckUtils]: 53: Hoare triple {15357#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15358#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:03,382 INFO L273 TraceCheckUtils]: 54: Hoare triple {15358#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15358#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:03,382 INFO L273 TraceCheckUtils]: 55: Hoare triple {15358#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15359#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:03,383 INFO L273 TraceCheckUtils]: 56: Hoare triple {15359#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15359#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:03,384 INFO L273 TraceCheckUtils]: 57: Hoare triple {15359#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15360#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:03,384 INFO L273 TraceCheckUtils]: 58: Hoare triple {15360#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15360#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:03,385 INFO L273 TraceCheckUtils]: 59: Hoare triple {15360#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15361#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:03,385 INFO L273 TraceCheckUtils]: 60: Hoare triple {15361#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15361#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:03,386 INFO L273 TraceCheckUtils]: 61: Hoare triple {15361#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15362#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:03,387 INFO L273 TraceCheckUtils]: 62: Hoare triple {15362#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15362#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:03,387 INFO L273 TraceCheckUtils]: 63: Hoare triple {15362#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15363#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:03,388 INFO L273 TraceCheckUtils]: 64: Hoare triple {15363#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15363#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:03,389 INFO L273 TraceCheckUtils]: 65: Hoare triple {15363#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15364#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:03,389 INFO L273 TraceCheckUtils]: 66: Hoare triple {15364#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15364#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:03,390 INFO L273 TraceCheckUtils]: 67: Hoare triple {15364#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15365#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:03,390 INFO L273 TraceCheckUtils]: 68: Hoare triple {15365#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15365#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:03,391 INFO L273 TraceCheckUtils]: 69: Hoare triple {15365#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15366#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:03,392 INFO L273 TraceCheckUtils]: 70: Hoare triple {15366#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15366#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:03,392 INFO L273 TraceCheckUtils]: 71: Hoare triple {15366#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15367#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:03,393 INFO L273 TraceCheckUtils]: 72: Hoare triple {15367#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15367#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:03,394 INFO L273 TraceCheckUtils]: 73: Hoare triple {15367#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15368#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:03,394 INFO L273 TraceCheckUtils]: 74: Hoare triple {15368#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15368#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:03,395 INFO L273 TraceCheckUtils]: 75: Hoare triple {15368#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15369#(<= main_~i~0 35)} is VALID [2018-11-23 13:06:03,395 INFO L273 TraceCheckUtils]: 76: Hoare triple {15369#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15369#(<= main_~i~0 35)} is VALID [2018-11-23 13:06:03,396 INFO L273 TraceCheckUtils]: 77: Hoare triple {15369#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15370#(<= main_~i~0 36)} is VALID [2018-11-23 13:06:03,397 INFO L273 TraceCheckUtils]: 78: Hoare triple {15370#(<= main_~i~0 36)} assume !(~i~0 < 1024); {15333#false} is VALID [2018-11-23 13:06:03,397 INFO L273 TraceCheckUtils]: 79: Hoare triple {15333#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {15333#false} is VALID [2018-11-23 13:06:03,397 INFO L256 TraceCheckUtils]: 80: Hoare triple {15333#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {15333#false} is VALID [2018-11-23 13:06:03,397 INFO L273 TraceCheckUtils]: 81: Hoare triple {15333#false} ~cond := #in~cond; {15333#false} is VALID [2018-11-23 13:06:03,397 INFO L273 TraceCheckUtils]: 82: Hoare triple {15333#false} assume 0 == ~cond; {15333#false} is VALID [2018-11-23 13:06:03,398 INFO L273 TraceCheckUtils]: 83: Hoare triple {15333#false} assume !false; {15333#false} is VALID [2018-11-23 13:06:03,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:03,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:03,405 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:03,415 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:06:20,993 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-11-23 13:06:20,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:21,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:22,296 INFO L256 TraceCheckUtils]: 0: Hoare triple {15332#true} call ULTIMATE.init(); {15332#true} is VALID [2018-11-23 13:06:22,296 INFO L273 TraceCheckUtils]: 1: Hoare triple {15332#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15332#true} is VALID [2018-11-23 13:06:22,296 INFO L273 TraceCheckUtils]: 2: Hoare triple {15332#true} assume true; {15332#true} is VALID [2018-11-23 13:06:22,297 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15332#true} {15332#true} #35#return; {15332#true} is VALID [2018-11-23 13:06:22,297 INFO L256 TraceCheckUtils]: 4: Hoare triple {15332#true} call #t~ret2 := main(); {15332#true} is VALID [2018-11-23 13:06:22,298 INFO L273 TraceCheckUtils]: 5: Hoare triple {15332#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {15389#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:22,298 INFO L273 TraceCheckUtils]: 6: Hoare triple {15389#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15389#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:22,299 INFO L273 TraceCheckUtils]: 7: Hoare triple {15389#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15335#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:22,299 INFO L273 TraceCheckUtils]: 8: Hoare triple {15335#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15335#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:22,300 INFO L273 TraceCheckUtils]: 9: Hoare triple {15335#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15336#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:22,300 INFO L273 TraceCheckUtils]: 10: Hoare triple {15336#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15336#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:22,322 INFO L273 TraceCheckUtils]: 11: Hoare triple {15336#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15337#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:22,323 INFO L273 TraceCheckUtils]: 12: Hoare triple {15337#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15337#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:22,323 INFO L273 TraceCheckUtils]: 13: Hoare triple {15337#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15338#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:22,323 INFO L273 TraceCheckUtils]: 14: Hoare triple {15338#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15338#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:22,324 INFO L273 TraceCheckUtils]: 15: Hoare triple {15338#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15339#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:22,324 INFO L273 TraceCheckUtils]: 16: Hoare triple {15339#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15339#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:22,324 INFO L273 TraceCheckUtils]: 17: Hoare triple {15339#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15340#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:22,325 INFO L273 TraceCheckUtils]: 18: Hoare triple {15340#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15340#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:22,325 INFO L273 TraceCheckUtils]: 19: Hoare triple {15340#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15341#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:22,325 INFO L273 TraceCheckUtils]: 20: Hoare triple {15341#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15341#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:22,326 INFO L273 TraceCheckUtils]: 21: Hoare triple {15341#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15342#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:22,326 INFO L273 TraceCheckUtils]: 22: Hoare triple {15342#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15342#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:22,327 INFO L273 TraceCheckUtils]: 23: Hoare triple {15342#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15343#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:22,327 INFO L273 TraceCheckUtils]: 24: Hoare triple {15343#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15343#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:22,328 INFO L273 TraceCheckUtils]: 25: Hoare triple {15343#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15344#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:22,328 INFO L273 TraceCheckUtils]: 26: Hoare triple {15344#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15344#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:22,329 INFO L273 TraceCheckUtils]: 27: Hoare triple {15344#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15345#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:22,329 INFO L273 TraceCheckUtils]: 28: Hoare triple {15345#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15345#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:22,330 INFO L273 TraceCheckUtils]: 29: Hoare triple {15345#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15346#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:22,331 INFO L273 TraceCheckUtils]: 30: Hoare triple {15346#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15346#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:22,331 INFO L273 TraceCheckUtils]: 31: Hoare triple {15346#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15347#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:22,332 INFO L273 TraceCheckUtils]: 32: Hoare triple {15347#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15347#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:22,333 INFO L273 TraceCheckUtils]: 33: Hoare triple {15347#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15348#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:22,333 INFO L273 TraceCheckUtils]: 34: Hoare triple {15348#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15348#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:22,334 INFO L273 TraceCheckUtils]: 35: Hoare triple {15348#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15349#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:22,334 INFO L273 TraceCheckUtils]: 36: Hoare triple {15349#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15349#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:22,335 INFO L273 TraceCheckUtils]: 37: Hoare triple {15349#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15350#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:22,336 INFO L273 TraceCheckUtils]: 38: Hoare triple {15350#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15350#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:22,336 INFO L273 TraceCheckUtils]: 39: Hoare triple {15350#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15351#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:22,337 INFO L273 TraceCheckUtils]: 40: Hoare triple {15351#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15351#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:22,337 INFO L273 TraceCheckUtils]: 41: Hoare triple {15351#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15352#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:22,338 INFO L273 TraceCheckUtils]: 42: Hoare triple {15352#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15352#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:22,339 INFO L273 TraceCheckUtils]: 43: Hoare triple {15352#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15353#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:22,339 INFO L273 TraceCheckUtils]: 44: Hoare triple {15353#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15353#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:22,340 INFO L273 TraceCheckUtils]: 45: Hoare triple {15353#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15354#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:22,340 INFO L273 TraceCheckUtils]: 46: Hoare triple {15354#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15354#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:22,341 INFO L273 TraceCheckUtils]: 47: Hoare triple {15354#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15355#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:22,342 INFO L273 TraceCheckUtils]: 48: Hoare triple {15355#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15355#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:22,342 INFO L273 TraceCheckUtils]: 49: Hoare triple {15355#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15356#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:22,343 INFO L273 TraceCheckUtils]: 50: Hoare triple {15356#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15356#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:22,344 INFO L273 TraceCheckUtils]: 51: Hoare triple {15356#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15357#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:22,344 INFO L273 TraceCheckUtils]: 52: Hoare triple {15357#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15357#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:22,345 INFO L273 TraceCheckUtils]: 53: Hoare triple {15357#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15358#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:22,345 INFO L273 TraceCheckUtils]: 54: Hoare triple {15358#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15358#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:22,346 INFO L273 TraceCheckUtils]: 55: Hoare triple {15358#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15359#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:22,347 INFO L273 TraceCheckUtils]: 56: Hoare triple {15359#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15359#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:22,347 INFO L273 TraceCheckUtils]: 57: Hoare triple {15359#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15360#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:22,348 INFO L273 TraceCheckUtils]: 58: Hoare triple {15360#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15360#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:22,348 INFO L273 TraceCheckUtils]: 59: Hoare triple {15360#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15361#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:22,349 INFO L273 TraceCheckUtils]: 60: Hoare triple {15361#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15361#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:22,350 INFO L273 TraceCheckUtils]: 61: Hoare triple {15361#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15362#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:22,350 INFO L273 TraceCheckUtils]: 62: Hoare triple {15362#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15362#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:22,351 INFO L273 TraceCheckUtils]: 63: Hoare triple {15362#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15363#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:22,351 INFO L273 TraceCheckUtils]: 64: Hoare triple {15363#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15363#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:22,352 INFO L273 TraceCheckUtils]: 65: Hoare triple {15363#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15364#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:22,353 INFO L273 TraceCheckUtils]: 66: Hoare triple {15364#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15364#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:22,353 INFO L273 TraceCheckUtils]: 67: Hoare triple {15364#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15365#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:22,354 INFO L273 TraceCheckUtils]: 68: Hoare triple {15365#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15365#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:22,355 INFO L273 TraceCheckUtils]: 69: Hoare triple {15365#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15366#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:22,355 INFO L273 TraceCheckUtils]: 70: Hoare triple {15366#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15366#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:22,356 INFO L273 TraceCheckUtils]: 71: Hoare triple {15366#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15367#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:22,356 INFO L273 TraceCheckUtils]: 72: Hoare triple {15367#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15367#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:22,357 INFO L273 TraceCheckUtils]: 73: Hoare triple {15367#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15368#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:22,358 INFO L273 TraceCheckUtils]: 74: Hoare triple {15368#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15368#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:22,358 INFO L273 TraceCheckUtils]: 75: Hoare triple {15368#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15369#(<= main_~i~0 35)} is VALID [2018-11-23 13:06:22,359 INFO L273 TraceCheckUtils]: 76: Hoare triple {15369#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15369#(<= main_~i~0 35)} is VALID [2018-11-23 13:06:22,359 INFO L273 TraceCheckUtils]: 77: Hoare triple {15369#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15370#(<= main_~i~0 36)} is VALID [2018-11-23 13:06:22,360 INFO L273 TraceCheckUtils]: 78: Hoare triple {15370#(<= main_~i~0 36)} assume !(~i~0 < 1024); {15333#false} is VALID [2018-11-23 13:06:22,360 INFO L273 TraceCheckUtils]: 79: Hoare triple {15333#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {15333#false} is VALID [2018-11-23 13:06:22,361 INFO L256 TraceCheckUtils]: 80: Hoare triple {15333#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {15333#false} is VALID [2018-11-23 13:06:22,361 INFO L273 TraceCheckUtils]: 81: Hoare triple {15333#false} ~cond := #in~cond; {15333#false} is VALID [2018-11-23 13:06:22,361 INFO L273 TraceCheckUtils]: 82: Hoare triple {15333#false} assume 0 == ~cond; {15333#false} is VALID [2018-11-23 13:06:22,361 INFO L273 TraceCheckUtils]: 83: Hoare triple {15333#false} assume !false; {15333#false} is VALID [2018-11-23 13:06:22,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:22,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:22,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2018-11-23 13:06:22,391 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 84 [2018-11-23 13:06:22,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:22,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 13:06:22,491 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 13:06:22,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 13:06:22,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 13:06:22,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 13:06:22,492 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 40 states. [2018-11-23 13:06:22,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:22,900 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-11-23 13:06:22,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 13:06:22,900 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 84 [2018-11-23 13:06:22,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:22,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 13:06:22,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 94 transitions. [2018-11-23 13:06:22,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 13:06:22,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 94 transitions. [2018-11-23 13:06:22,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 94 transitions. [2018-11-23 13:06:22,988 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:22,990 INFO L225 Difference]: With dead ends: 94 [2018-11-23 13:06:22,990 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 13:06:22,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 13:06:22,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 13:06:23,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-11-23 13:06:23,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:23,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 87 states. [2018-11-23 13:06:23,022 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 87 states. [2018-11-23 13:06:23,022 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 87 states. [2018-11-23 13:06:23,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:23,024 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-11-23 13:06:23,024 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-11-23 13:06:23,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:23,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:23,025 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 88 states. [2018-11-23 13:06:23,025 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 88 states. [2018-11-23 13:06:23,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:23,026 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-11-23 13:06:23,026 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-11-23 13:06:23,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:23,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:23,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:23,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:23,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 13:06:23,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-11-23 13:06:23,028 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-11-23 13:06:23,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:23,028 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-11-23 13:06:23,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 13:06:23,028 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-11-23 13:06:23,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 13:06:23,029 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:23,029 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:23,029 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:23,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:23,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1537674631, now seen corresponding path program 37 times [2018-11-23 13:06:23,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:23,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:23,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:23,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:23,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:23,812 INFO L256 TraceCheckUtils]: 0: Hoare triple {16070#true} call ULTIMATE.init(); {16070#true} is VALID [2018-11-23 13:06:23,812 INFO L273 TraceCheckUtils]: 1: Hoare triple {16070#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16070#true} is VALID [2018-11-23 13:06:23,813 INFO L273 TraceCheckUtils]: 2: Hoare triple {16070#true} assume true; {16070#true} is VALID [2018-11-23 13:06:23,813 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16070#true} {16070#true} #35#return; {16070#true} is VALID [2018-11-23 13:06:23,813 INFO L256 TraceCheckUtils]: 4: Hoare triple {16070#true} call #t~ret2 := main(); {16070#true} is VALID [2018-11-23 13:06:23,814 INFO L273 TraceCheckUtils]: 5: Hoare triple {16070#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {16072#(= main_~i~0 0)} is VALID [2018-11-23 13:06:23,814 INFO L273 TraceCheckUtils]: 6: Hoare triple {16072#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16072#(= main_~i~0 0)} is VALID [2018-11-23 13:06:23,815 INFO L273 TraceCheckUtils]: 7: Hoare triple {16072#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16073#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:23,815 INFO L273 TraceCheckUtils]: 8: Hoare triple {16073#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16073#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:23,815 INFO L273 TraceCheckUtils]: 9: Hoare triple {16073#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16074#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:23,816 INFO L273 TraceCheckUtils]: 10: Hoare triple {16074#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16074#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:23,816 INFO L273 TraceCheckUtils]: 11: Hoare triple {16074#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16075#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:23,816 INFO L273 TraceCheckUtils]: 12: Hoare triple {16075#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16075#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:23,817 INFO L273 TraceCheckUtils]: 13: Hoare triple {16075#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16076#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:23,818 INFO L273 TraceCheckUtils]: 14: Hoare triple {16076#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16076#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:23,818 INFO L273 TraceCheckUtils]: 15: Hoare triple {16076#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16077#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:23,819 INFO L273 TraceCheckUtils]: 16: Hoare triple {16077#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16077#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:23,820 INFO L273 TraceCheckUtils]: 17: Hoare triple {16077#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16078#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:23,820 INFO L273 TraceCheckUtils]: 18: Hoare triple {16078#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16078#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:23,821 INFO L273 TraceCheckUtils]: 19: Hoare triple {16078#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16079#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:23,821 INFO L273 TraceCheckUtils]: 20: Hoare triple {16079#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16079#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:23,822 INFO L273 TraceCheckUtils]: 21: Hoare triple {16079#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16080#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:23,823 INFO L273 TraceCheckUtils]: 22: Hoare triple {16080#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16080#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:23,823 INFO L273 TraceCheckUtils]: 23: Hoare triple {16080#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16081#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:23,824 INFO L273 TraceCheckUtils]: 24: Hoare triple {16081#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16081#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:23,824 INFO L273 TraceCheckUtils]: 25: Hoare triple {16081#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16082#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:23,825 INFO L273 TraceCheckUtils]: 26: Hoare triple {16082#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16082#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:23,826 INFO L273 TraceCheckUtils]: 27: Hoare triple {16082#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16083#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:23,826 INFO L273 TraceCheckUtils]: 28: Hoare triple {16083#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16083#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:23,827 INFO L273 TraceCheckUtils]: 29: Hoare triple {16083#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16084#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:23,827 INFO L273 TraceCheckUtils]: 30: Hoare triple {16084#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16084#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:23,828 INFO L273 TraceCheckUtils]: 31: Hoare triple {16084#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16085#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:23,829 INFO L273 TraceCheckUtils]: 32: Hoare triple {16085#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16085#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:23,829 INFO L273 TraceCheckUtils]: 33: Hoare triple {16085#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16086#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:23,830 INFO L273 TraceCheckUtils]: 34: Hoare triple {16086#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16086#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:23,831 INFO L273 TraceCheckUtils]: 35: Hoare triple {16086#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16087#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:23,831 INFO L273 TraceCheckUtils]: 36: Hoare triple {16087#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16087#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:23,832 INFO L273 TraceCheckUtils]: 37: Hoare triple {16087#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16088#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:23,832 INFO L273 TraceCheckUtils]: 38: Hoare triple {16088#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16088#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:23,833 INFO L273 TraceCheckUtils]: 39: Hoare triple {16088#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16089#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:23,834 INFO L273 TraceCheckUtils]: 40: Hoare triple {16089#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16089#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:23,834 INFO L273 TraceCheckUtils]: 41: Hoare triple {16089#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16090#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:23,835 INFO L273 TraceCheckUtils]: 42: Hoare triple {16090#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16090#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:23,835 INFO L273 TraceCheckUtils]: 43: Hoare triple {16090#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16091#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:23,836 INFO L273 TraceCheckUtils]: 44: Hoare triple {16091#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16091#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:23,837 INFO L273 TraceCheckUtils]: 45: Hoare triple {16091#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16092#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:23,837 INFO L273 TraceCheckUtils]: 46: Hoare triple {16092#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16092#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:23,838 INFO L273 TraceCheckUtils]: 47: Hoare triple {16092#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16093#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:23,838 INFO L273 TraceCheckUtils]: 48: Hoare triple {16093#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16093#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:23,839 INFO L273 TraceCheckUtils]: 49: Hoare triple {16093#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16094#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:23,840 INFO L273 TraceCheckUtils]: 50: Hoare triple {16094#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16094#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:23,840 INFO L273 TraceCheckUtils]: 51: Hoare triple {16094#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16095#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:23,841 INFO L273 TraceCheckUtils]: 52: Hoare triple {16095#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16095#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:23,842 INFO L273 TraceCheckUtils]: 53: Hoare triple {16095#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16096#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:23,842 INFO L273 TraceCheckUtils]: 54: Hoare triple {16096#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16096#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:23,843 INFO L273 TraceCheckUtils]: 55: Hoare triple {16096#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16097#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:23,843 INFO L273 TraceCheckUtils]: 56: Hoare triple {16097#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16097#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:23,844 INFO L273 TraceCheckUtils]: 57: Hoare triple {16097#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16098#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:23,844 INFO L273 TraceCheckUtils]: 58: Hoare triple {16098#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16098#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:23,845 INFO L273 TraceCheckUtils]: 59: Hoare triple {16098#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16099#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:23,846 INFO L273 TraceCheckUtils]: 60: Hoare triple {16099#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16099#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:23,846 INFO L273 TraceCheckUtils]: 61: Hoare triple {16099#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16100#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:23,847 INFO L273 TraceCheckUtils]: 62: Hoare triple {16100#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16100#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:23,848 INFO L273 TraceCheckUtils]: 63: Hoare triple {16100#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16101#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:23,848 INFO L273 TraceCheckUtils]: 64: Hoare triple {16101#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16101#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:23,849 INFO L273 TraceCheckUtils]: 65: Hoare triple {16101#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16102#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:23,849 INFO L273 TraceCheckUtils]: 66: Hoare triple {16102#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16102#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:23,850 INFO L273 TraceCheckUtils]: 67: Hoare triple {16102#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16103#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:23,851 INFO L273 TraceCheckUtils]: 68: Hoare triple {16103#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16103#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:23,851 INFO L273 TraceCheckUtils]: 69: Hoare triple {16103#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16104#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:23,852 INFO L273 TraceCheckUtils]: 70: Hoare triple {16104#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16104#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:23,853 INFO L273 TraceCheckUtils]: 71: Hoare triple {16104#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16105#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:23,853 INFO L273 TraceCheckUtils]: 72: Hoare triple {16105#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16105#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:23,854 INFO L273 TraceCheckUtils]: 73: Hoare triple {16105#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16106#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:23,854 INFO L273 TraceCheckUtils]: 74: Hoare triple {16106#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16106#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:23,855 INFO L273 TraceCheckUtils]: 75: Hoare triple {16106#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16107#(<= main_~i~0 35)} is VALID [2018-11-23 13:06:23,855 INFO L273 TraceCheckUtils]: 76: Hoare triple {16107#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16107#(<= main_~i~0 35)} is VALID [2018-11-23 13:06:23,856 INFO L273 TraceCheckUtils]: 77: Hoare triple {16107#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16108#(<= main_~i~0 36)} is VALID [2018-11-23 13:06:23,857 INFO L273 TraceCheckUtils]: 78: Hoare triple {16108#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16108#(<= main_~i~0 36)} is VALID [2018-11-23 13:06:23,857 INFO L273 TraceCheckUtils]: 79: Hoare triple {16108#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16109#(<= main_~i~0 37)} is VALID [2018-11-23 13:06:23,858 INFO L273 TraceCheckUtils]: 80: Hoare triple {16109#(<= main_~i~0 37)} assume !(~i~0 < 1024); {16071#false} is VALID [2018-11-23 13:06:23,858 INFO L273 TraceCheckUtils]: 81: Hoare triple {16071#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {16071#false} is VALID [2018-11-23 13:06:23,858 INFO L256 TraceCheckUtils]: 82: Hoare triple {16071#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {16071#false} is VALID [2018-11-23 13:06:23,859 INFO L273 TraceCheckUtils]: 83: Hoare triple {16071#false} ~cond := #in~cond; {16071#false} is VALID [2018-11-23 13:06:23,859 INFO L273 TraceCheckUtils]: 84: Hoare triple {16071#false} assume 0 == ~cond; {16071#false} is VALID [2018-11-23 13:06:23,859 INFO L273 TraceCheckUtils]: 85: Hoare triple {16071#false} assume !false; {16071#false} is VALID [2018-11-23 13:06:23,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:23,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:23,866 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:23,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:23,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:24,171 INFO L256 TraceCheckUtils]: 0: Hoare triple {16070#true} call ULTIMATE.init(); {16070#true} is VALID [2018-11-23 13:06:24,171 INFO L273 TraceCheckUtils]: 1: Hoare triple {16070#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16070#true} is VALID [2018-11-23 13:06:24,171 INFO L273 TraceCheckUtils]: 2: Hoare triple {16070#true} assume true; {16070#true} is VALID [2018-11-23 13:06:24,171 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16070#true} {16070#true} #35#return; {16070#true} is VALID [2018-11-23 13:06:24,172 INFO L256 TraceCheckUtils]: 4: Hoare triple {16070#true} call #t~ret2 := main(); {16070#true} is VALID [2018-11-23 13:06:24,172 INFO L273 TraceCheckUtils]: 5: Hoare triple {16070#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {16128#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:24,173 INFO L273 TraceCheckUtils]: 6: Hoare triple {16128#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16128#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:24,173 INFO L273 TraceCheckUtils]: 7: Hoare triple {16128#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16073#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:24,174 INFO L273 TraceCheckUtils]: 8: Hoare triple {16073#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16073#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:24,174 INFO L273 TraceCheckUtils]: 9: Hoare triple {16073#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16074#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:24,175 INFO L273 TraceCheckUtils]: 10: Hoare triple {16074#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16074#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:24,175 INFO L273 TraceCheckUtils]: 11: Hoare triple {16074#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16075#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:24,175 INFO L273 TraceCheckUtils]: 12: Hoare triple {16075#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16075#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:24,176 INFO L273 TraceCheckUtils]: 13: Hoare triple {16075#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16076#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:24,176 INFO L273 TraceCheckUtils]: 14: Hoare triple {16076#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16076#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:24,177 INFO L273 TraceCheckUtils]: 15: Hoare triple {16076#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16077#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:24,178 INFO L273 TraceCheckUtils]: 16: Hoare triple {16077#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16077#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:24,178 INFO L273 TraceCheckUtils]: 17: Hoare triple {16077#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16078#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:24,179 INFO L273 TraceCheckUtils]: 18: Hoare triple {16078#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16078#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:24,180 INFO L273 TraceCheckUtils]: 19: Hoare triple {16078#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16079#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:24,180 INFO L273 TraceCheckUtils]: 20: Hoare triple {16079#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16079#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:24,181 INFO L273 TraceCheckUtils]: 21: Hoare triple {16079#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16080#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:24,181 INFO L273 TraceCheckUtils]: 22: Hoare triple {16080#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16080#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:24,182 INFO L273 TraceCheckUtils]: 23: Hoare triple {16080#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16081#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:24,183 INFO L273 TraceCheckUtils]: 24: Hoare triple {16081#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16081#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:24,183 INFO L273 TraceCheckUtils]: 25: Hoare triple {16081#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16082#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:24,185 INFO L273 TraceCheckUtils]: 26: Hoare triple {16082#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16082#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:24,185 INFO L273 TraceCheckUtils]: 27: Hoare triple {16082#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16083#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:24,186 INFO L273 TraceCheckUtils]: 28: Hoare triple {16083#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16083#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:24,187 INFO L273 TraceCheckUtils]: 29: Hoare triple {16083#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16084#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:24,187 INFO L273 TraceCheckUtils]: 30: Hoare triple {16084#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16084#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:24,188 INFO L273 TraceCheckUtils]: 31: Hoare triple {16084#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16085#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:24,188 INFO L273 TraceCheckUtils]: 32: Hoare triple {16085#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16085#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:24,189 INFO L273 TraceCheckUtils]: 33: Hoare triple {16085#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16086#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:24,190 INFO L273 TraceCheckUtils]: 34: Hoare triple {16086#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16086#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:24,190 INFO L273 TraceCheckUtils]: 35: Hoare triple {16086#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16087#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:24,191 INFO L273 TraceCheckUtils]: 36: Hoare triple {16087#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16087#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:24,192 INFO L273 TraceCheckUtils]: 37: Hoare triple {16087#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16088#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:24,192 INFO L273 TraceCheckUtils]: 38: Hoare triple {16088#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16088#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:24,193 INFO L273 TraceCheckUtils]: 39: Hoare triple {16088#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16089#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:24,193 INFO L273 TraceCheckUtils]: 40: Hoare triple {16089#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16089#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:24,194 INFO L273 TraceCheckUtils]: 41: Hoare triple {16089#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16090#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:24,195 INFO L273 TraceCheckUtils]: 42: Hoare triple {16090#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16090#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:24,195 INFO L273 TraceCheckUtils]: 43: Hoare triple {16090#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16091#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:24,196 INFO L273 TraceCheckUtils]: 44: Hoare triple {16091#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16091#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:24,196 INFO L273 TraceCheckUtils]: 45: Hoare triple {16091#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16092#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:24,197 INFO L273 TraceCheckUtils]: 46: Hoare triple {16092#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16092#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:24,198 INFO L273 TraceCheckUtils]: 47: Hoare triple {16092#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16093#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:24,198 INFO L273 TraceCheckUtils]: 48: Hoare triple {16093#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16093#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:24,199 INFO L273 TraceCheckUtils]: 49: Hoare triple {16093#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16094#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:24,199 INFO L273 TraceCheckUtils]: 50: Hoare triple {16094#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16094#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:24,200 INFO L273 TraceCheckUtils]: 51: Hoare triple {16094#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16095#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:24,201 INFO L273 TraceCheckUtils]: 52: Hoare triple {16095#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16095#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:24,201 INFO L273 TraceCheckUtils]: 53: Hoare triple {16095#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16096#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:24,202 INFO L273 TraceCheckUtils]: 54: Hoare triple {16096#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16096#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:24,203 INFO L273 TraceCheckUtils]: 55: Hoare triple {16096#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16097#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:24,203 INFO L273 TraceCheckUtils]: 56: Hoare triple {16097#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16097#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:24,204 INFO L273 TraceCheckUtils]: 57: Hoare triple {16097#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16098#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:24,204 INFO L273 TraceCheckUtils]: 58: Hoare triple {16098#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16098#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:24,205 INFO L273 TraceCheckUtils]: 59: Hoare triple {16098#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16099#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:24,206 INFO L273 TraceCheckUtils]: 60: Hoare triple {16099#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16099#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:24,206 INFO L273 TraceCheckUtils]: 61: Hoare triple {16099#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16100#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:24,207 INFO L273 TraceCheckUtils]: 62: Hoare triple {16100#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16100#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:24,207 INFO L273 TraceCheckUtils]: 63: Hoare triple {16100#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16101#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:24,208 INFO L273 TraceCheckUtils]: 64: Hoare triple {16101#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16101#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:24,209 INFO L273 TraceCheckUtils]: 65: Hoare triple {16101#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16102#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:24,209 INFO L273 TraceCheckUtils]: 66: Hoare triple {16102#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16102#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:24,210 INFO L273 TraceCheckUtils]: 67: Hoare triple {16102#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16103#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:24,210 INFO L273 TraceCheckUtils]: 68: Hoare triple {16103#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16103#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:24,211 INFO L273 TraceCheckUtils]: 69: Hoare triple {16103#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16104#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:24,212 INFO L273 TraceCheckUtils]: 70: Hoare triple {16104#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16104#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:24,212 INFO L273 TraceCheckUtils]: 71: Hoare triple {16104#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16105#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:24,213 INFO L273 TraceCheckUtils]: 72: Hoare triple {16105#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16105#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:24,214 INFO L273 TraceCheckUtils]: 73: Hoare triple {16105#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16106#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:24,214 INFO L273 TraceCheckUtils]: 74: Hoare triple {16106#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16106#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:24,215 INFO L273 TraceCheckUtils]: 75: Hoare triple {16106#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16107#(<= main_~i~0 35)} is VALID [2018-11-23 13:06:24,215 INFO L273 TraceCheckUtils]: 76: Hoare triple {16107#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16107#(<= main_~i~0 35)} is VALID [2018-11-23 13:06:24,216 INFO L273 TraceCheckUtils]: 77: Hoare triple {16107#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16108#(<= main_~i~0 36)} is VALID [2018-11-23 13:06:24,217 INFO L273 TraceCheckUtils]: 78: Hoare triple {16108#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16108#(<= main_~i~0 36)} is VALID [2018-11-23 13:06:24,217 INFO L273 TraceCheckUtils]: 79: Hoare triple {16108#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16109#(<= main_~i~0 37)} is VALID [2018-11-23 13:06:24,218 INFO L273 TraceCheckUtils]: 80: Hoare triple {16109#(<= main_~i~0 37)} assume !(~i~0 < 1024); {16071#false} is VALID [2018-11-23 13:06:24,218 INFO L273 TraceCheckUtils]: 81: Hoare triple {16071#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {16071#false} is VALID [2018-11-23 13:06:24,218 INFO L256 TraceCheckUtils]: 82: Hoare triple {16071#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {16071#false} is VALID [2018-11-23 13:06:24,218 INFO L273 TraceCheckUtils]: 83: Hoare triple {16071#false} ~cond := #in~cond; {16071#false} is VALID [2018-11-23 13:06:24,219 INFO L273 TraceCheckUtils]: 84: Hoare triple {16071#false} assume 0 == ~cond; {16071#false} is VALID [2018-11-23 13:06:24,219 INFO L273 TraceCheckUtils]: 85: Hoare triple {16071#false} assume !false; {16071#false} is VALID [2018-11-23 13:06:24,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:24,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:24,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-11-23 13:06:24,248 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 86 [2018-11-23 13:06:24,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:24,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 13:06:24,379 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:24,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 13:06:24,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 13:06:24,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 13:06:24,380 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 41 states. [2018-11-23 13:06:24,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:24,944 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-11-23 13:06:24,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 13:06:24,945 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 86 [2018-11-23 13:06:24,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:24,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 13:06:24,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 96 transitions. [2018-11-23 13:06:24,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 13:06:24,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 96 transitions. [2018-11-23 13:06:24,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 96 transitions. [2018-11-23 13:06:25,036 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 13:06:25,040 INFO L225 Difference]: With dead ends: 96 [2018-11-23 13:06:25,040 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 13:06:25,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 13:06:25,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 13:06:25,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-11-23 13:06:25,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:25,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 89 states. [2018-11-23 13:06:25,075 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 89 states. [2018-11-23 13:06:25,075 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 89 states. [2018-11-23 13:06:25,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:25,076 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-11-23 13:06:25,076 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-11-23 13:06:25,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:25,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:25,077 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 90 states. [2018-11-23 13:06:25,077 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 90 states. [2018-11-23 13:06:25,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:25,078 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-11-23 13:06:25,078 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-11-23 13:06:25,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:25,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:25,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:25,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:25,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 13:06:25,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-11-23 13:06:25,080 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-11-23 13:06:25,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:25,080 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-11-23 13:06:25,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 13:06:25,080 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-11-23 13:06:25,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-23 13:06:25,081 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:25,081 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:25,081 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:25,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:25,082 INFO L82 PathProgramCache]: Analyzing trace with hash -604151127, now seen corresponding path program 38 times [2018-11-23 13:06:25,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:25,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:25,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:25,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:25,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:25,860 INFO L256 TraceCheckUtils]: 0: Hoare triple {16825#true} call ULTIMATE.init(); {16825#true} is VALID [2018-11-23 13:06:25,861 INFO L273 TraceCheckUtils]: 1: Hoare triple {16825#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16825#true} is VALID [2018-11-23 13:06:25,861 INFO L273 TraceCheckUtils]: 2: Hoare triple {16825#true} assume true; {16825#true} is VALID [2018-11-23 13:06:25,861 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16825#true} {16825#true} #35#return; {16825#true} is VALID [2018-11-23 13:06:25,861 INFO L256 TraceCheckUtils]: 4: Hoare triple {16825#true} call #t~ret2 := main(); {16825#true} is VALID [2018-11-23 13:06:25,861 INFO L273 TraceCheckUtils]: 5: Hoare triple {16825#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {16827#(= main_~i~0 0)} is VALID [2018-11-23 13:06:25,862 INFO L273 TraceCheckUtils]: 6: Hoare triple {16827#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16827#(= main_~i~0 0)} is VALID [2018-11-23 13:06:25,862 INFO L273 TraceCheckUtils]: 7: Hoare triple {16827#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16828#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:25,862 INFO L273 TraceCheckUtils]: 8: Hoare triple {16828#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16828#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:25,863 INFO L273 TraceCheckUtils]: 9: Hoare triple {16828#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16829#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:25,863 INFO L273 TraceCheckUtils]: 10: Hoare triple {16829#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16829#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:25,864 INFO L273 TraceCheckUtils]: 11: Hoare triple {16829#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16830#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:25,865 INFO L273 TraceCheckUtils]: 12: Hoare triple {16830#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16830#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:25,865 INFO L273 TraceCheckUtils]: 13: Hoare triple {16830#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16831#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:25,866 INFO L273 TraceCheckUtils]: 14: Hoare triple {16831#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16831#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:25,867 INFO L273 TraceCheckUtils]: 15: Hoare triple {16831#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16832#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:25,867 INFO L273 TraceCheckUtils]: 16: Hoare triple {16832#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16832#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:25,868 INFO L273 TraceCheckUtils]: 17: Hoare triple {16832#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16833#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:25,868 INFO L273 TraceCheckUtils]: 18: Hoare triple {16833#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16833#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:25,869 INFO L273 TraceCheckUtils]: 19: Hoare triple {16833#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16834#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:25,870 INFO L273 TraceCheckUtils]: 20: Hoare triple {16834#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16834#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:25,870 INFO L273 TraceCheckUtils]: 21: Hoare triple {16834#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16835#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:25,871 INFO L273 TraceCheckUtils]: 22: Hoare triple {16835#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16835#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:25,871 INFO L273 TraceCheckUtils]: 23: Hoare triple {16835#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16836#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:25,872 INFO L273 TraceCheckUtils]: 24: Hoare triple {16836#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16836#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:25,873 INFO L273 TraceCheckUtils]: 25: Hoare triple {16836#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16837#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:25,873 INFO L273 TraceCheckUtils]: 26: Hoare triple {16837#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16837#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:25,874 INFO L273 TraceCheckUtils]: 27: Hoare triple {16837#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16838#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:25,874 INFO L273 TraceCheckUtils]: 28: Hoare triple {16838#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16838#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:25,875 INFO L273 TraceCheckUtils]: 29: Hoare triple {16838#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16839#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:25,876 INFO L273 TraceCheckUtils]: 30: Hoare triple {16839#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16839#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:25,876 INFO L273 TraceCheckUtils]: 31: Hoare triple {16839#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16840#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:25,877 INFO L273 TraceCheckUtils]: 32: Hoare triple {16840#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16840#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:25,878 INFO L273 TraceCheckUtils]: 33: Hoare triple {16840#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16841#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:25,878 INFO L273 TraceCheckUtils]: 34: Hoare triple {16841#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16841#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:25,879 INFO L273 TraceCheckUtils]: 35: Hoare triple {16841#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16842#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:25,879 INFO L273 TraceCheckUtils]: 36: Hoare triple {16842#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16842#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:25,880 INFO L273 TraceCheckUtils]: 37: Hoare triple {16842#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16843#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:25,880 INFO L273 TraceCheckUtils]: 38: Hoare triple {16843#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16843#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:25,881 INFO L273 TraceCheckUtils]: 39: Hoare triple {16843#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16844#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:25,882 INFO L273 TraceCheckUtils]: 40: Hoare triple {16844#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16844#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:25,882 INFO L273 TraceCheckUtils]: 41: Hoare triple {16844#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16845#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:25,883 INFO L273 TraceCheckUtils]: 42: Hoare triple {16845#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16845#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:25,884 INFO L273 TraceCheckUtils]: 43: Hoare triple {16845#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16846#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:25,884 INFO L273 TraceCheckUtils]: 44: Hoare triple {16846#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16846#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:25,885 INFO L273 TraceCheckUtils]: 45: Hoare triple {16846#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16847#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:25,885 INFO L273 TraceCheckUtils]: 46: Hoare triple {16847#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16847#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:25,886 INFO L273 TraceCheckUtils]: 47: Hoare triple {16847#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16848#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:25,887 INFO L273 TraceCheckUtils]: 48: Hoare triple {16848#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16848#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:25,887 INFO L273 TraceCheckUtils]: 49: Hoare triple {16848#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16849#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:25,888 INFO L273 TraceCheckUtils]: 50: Hoare triple {16849#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16849#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:25,888 INFO L273 TraceCheckUtils]: 51: Hoare triple {16849#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16850#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:25,889 INFO L273 TraceCheckUtils]: 52: Hoare triple {16850#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16850#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:25,890 INFO L273 TraceCheckUtils]: 53: Hoare triple {16850#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16851#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:25,890 INFO L273 TraceCheckUtils]: 54: Hoare triple {16851#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16851#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:25,891 INFO L273 TraceCheckUtils]: 55: Hoare triple {16851#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16852#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:25,891 INFO L273 TraceCheckUtils]: 56: Hoare triple {16852#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16852#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:25,892 INFO L273 TraceCheckUtils]: 57: Hoare triple {16852#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16853#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:25,893 INFO L273 TraceCheckUtils]: 58: Hoare triple {16853#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16853#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:25,893 INFO L273 TraceCheckUtils]: 59: Hoare triple {16853#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16854#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:25,894 INFO L273 TraceCheckUtils]: 60: Hoare triple {16854#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16854#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:25,895 INFO L273 TraceCheckUtils]: 61: Hoare triple {16854#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16855#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:25,895 INFO L273 TraceCheckUtils]: 62: Hoare triple {16855#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16855#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:25,896 INFO L273 TraceCheckUtils]: 63: Hoare triple {16855#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16856#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:25,896 INFO L273 TraceCheckUtils]: 64: Hoare triple {16856#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16856#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:25,897 INFO L273 TraceCheckUtils]: 65: Hoare triple {16856#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16857#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:25,898 INFO L273 TraceCheckUtils]: 66: Hoare triple {16857#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16857#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:25,898 INFO L273 TraceCheckUtils]: 67: Hoare triple {16857#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16858#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:25,899 INFO L273 TraceCheckUtils]: 68: Hoare triple {16858#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16858#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:25,899 INFO L273 TraceCheckUtils]: 69: Hoare triple {16858#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16859#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:25,900 INFO L273 TraceCheckUtils]: 70: Hoare triple {16859#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16859#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:25,901 INFO L273 TraceCheckUtils]: 71: Hoare triple {16859#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16860#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:25,901 INFO L273 TraceCheckUtils]: 72: Hoare triple {16860#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16860#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:25,902 INFO L273 TraceCheckUtils]: 73: Hoare triple {16860#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16861#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:25,902 INFO L273 TraceCheckUtils]: 74: Hoare triple {16861#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16861#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:25,903 INFO L273 TraceCheckUtils]: 75: Hoare triple {16861#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16862#(<= main_~i~0 35)} is VALID [2018-11-23 13:06:25,904 INFO L273 TraceCheckUtils]: 76: Hoare triple {16862#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16862#(<= main_~i~0 35)} is VALID [2018-11-23 13:06:25,904 INFO L273 TraceCheckUtils]: 77: Hoare triple {16862#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16863#(<= main_~i~0 36)} is VALID [2018-11-23 13:06:25,905 INFO L273 TraceCheckUtils]: 78: Hoare triple {16863#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16863#(<= main_~i~0 36)} is VALID [2018-11-23 13:06:25,906 INFO L273 TraceCheckUtils]: 79: Hoare triple {16863#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16864#(<= main_~i~0 37)} is VALID [2018-11-23 13:06:25,906 INFO L273 TraceCheckUtils]: 80: Hoare triple {16864#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16864#(<= main_~i~0 37)} is VALID [2018-11-23 13:06:25,907 INFO L273 TraceCheckUtils]: 81: Hoare triple {16864#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16865#(<= main_~i~0 38)} is VALID [2018-11-23 13:06:25,907 INFO L273 TraceCheckUtils]: 82: Hoare triple {16865#(<= main_~i~0 38)} assume !(~i~0 < 1024); {16826#false} is VALID [2018-11-23 13:06:25,908 INFO L273 TraceCheckUtils]: 83: Hoare triple {16826#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {16826#false} is VALID [2018-11-23 13:06:25,908 INFO L256 TraceCheckUtils]: 84: Hoare triple {16826#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {16826#false} is VALID [2018-11-23 13:06:25,908 INFO L273 TraceCheckUtils]: 85: Hoare triple {16826#false} ~cond := #in~cond; {16826#false} is VALID [2018-11-23 13:06:25,908 INFO L273 TraceCheckUtils]: 86: Hoare triple {16826#false} assume 0 == ~cond; {16826#false} is VALID [2018-11-23 13:06:25,908 INFO L273 TraceCheckUtils]: 87: Hoare triple {16826#false} assume !false; {16826#false} is VALID [2018-11-23 13:06:25,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:25,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:25,915 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:25,924 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:06:25,955 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:06:25,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:26,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:26,473 INFO L256 TraceCheckUtils]: 0: Hoare triple {16825#true} call ULTIMATE.init(); {16825#true} is VALID [2018-11-23 13:06:26,473 INFO L273 TraceCheckUtils]: 1: Hoare triple {16825#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16825#true} is VALID [2018-11-23 13:06:26,473 INFO L273 TraceCheckUtils]: 2: Hoare triple {16825#true} assume true; {16825#true} is VALID [2018-11-23 13:06:26,473 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16825#true} {16825#true} #35#return; {16825#true} is VALID [2018-11-23 13:06:26,473 INFO L256 TraceCheckUtils]: 4: Hoare triple {16825#true} call #t~ret2 := main(); {16825#true} is VALID [2018-11-23 13:06:26,474 INFO L273 TraceCheckUtils]: 5: Hoare triple {16825#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {16884#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:26,475 INFO L273 TraceCheckUtils]: 6: Hoare triple {16884#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16884#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:26,475 INFO L273 TraceCheckUtils]: 7: Hoare triple {16884#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16828#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:26,476 INFO L273 TraceCheckUtils]: 8: Hoare triple {16828#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16828#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:26,477 INFO L273 TraceCheckUtils]: 9: Hoare triple {16828#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16829#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:26,477 INFO L273 TraceCheckUtils]: 10: Hoare triple {16829#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16829#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:26,478 INFO L273 TraceCheckUtils]: 11: Hoare triple {16829#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16830#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:26,478 INFO L273 TraceCheckUtils]: 12: Hoare triple {16830#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16830#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:26,479 INFO L273 TraceCheckUtils]: 13: Hoare triple {16830#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16831#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:26,480 INFO L273 TraceCheckUtils]: 14: Hoare triple {16831#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16831#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:26,480 INFO L273 TraceCheckUtils]: 15: Hoare triple {16831#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16832#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:26,481 INFO L273 TraceCheckUtils]: 16: Hoare triple {16832#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16832#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:26,482 INFO L273 TraceCheckUtils]: 17: Hoare triple {16832#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16833#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:26,482 INFO L273 TraceCheckUtils]: 18: Hoare triple {16833#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16833#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:26,483 INFO L273 TraceCheckUtils]: 19: Hoare triple {16833#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16834#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:26,483 INFO L273 TraceCheckUtils]: 20: Hoare triple {16834#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16834#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:26,484 INFO L273 TraceCheckUtils]: 21: Hoare triple {16834#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16835#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:26,485 INFO L273 TraceCheckUtils]: 22: Hoare triple {16835#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16835#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:26,485 INFO L273 TraceCheckUtils]: 23: Hoare triple {16835#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16836#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:26,486 INFO L273 TraceCheckUtils]: 24: Hoare triple {16836#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16836#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:26,486 INFO L273 TraceCheckUtils]: 25: Hoare triple {16836#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16837#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:26,487 INFO L273 TraceCheckUtils]: 26: Hoare triple {16837#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16837#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:26,488 INFO L273 TraceCheckUtils]: 27: Hoare triple {16837#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16838#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:26,488 INFO L273 TraceCheckUtils]: 28: Hoare triple {16838#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16838#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:26,489 INFO L273 TraceCheckUtils]: 29: Hoare triple {16838#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16839#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:26,489 INFO L273 TraceCheckUtils]: 30: Hoare triple {16839#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16839#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:26,490 INFO L273 TraceCheckUtils]: 31: Hoare triple {16839#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16840#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:26,491 INFO L273 TraceCheckUtils]: 32: Hoare triple {16840#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16840#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:26,491 INFO L273 TraceCheckUtils]: 33: Hoare triple {16840#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16841#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:26,492 INFO L273 TraceCheckUtils]: 34: Hoare triple {16841#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16841#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:26,492 INFO L273 TraceCheckUtils]: 35: Hoare triple {16841#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16842#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:26,493 INFO L273 TraceCheckUtils]: 36: Hoare triple {16842#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16842#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:26,494 INFO L273 TraceCheckUtils]: 37: Hoare triple {16842#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16843#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:26,494 INFO L273 TraceCheckUtils]: 38: Hoare triple {16843#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16843#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:26,495 INFO L273 TraceCheckUtils]: 39: Hoare triple {16843#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16844#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:26,495 INFO L273 TraceCheckUtils]: 40: Hoare triple {16844#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16844#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:26,496 INFO L273 TraceCheckUtils]: 41: Hoare triple {16844#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16845#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:26,497 INFO L273 TraceCheckUtils]: 42: Hoare triple {16845#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16845#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:26,497 INFO L273 TraceCheckUtils]: 43: Hoare triple {16845#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16846#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:26,498 INFO L273 TraceCheckUtils]: 44: Hoare triple {16846#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16846#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:26,499 INFO L273 TraceCheckUtils]: 45: Hoare triple {16846#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16847#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:26,499 INFO L273 TraceCheckUtils]: 46: Hoare triple {16847#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16847#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:26,500 INFO L273 TraceCheckUtils]: 47: Hoare triple {16847#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16848#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:26,500 INFO L273 TraceCheckUtils]: 48: Hoare triple {16848#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16848#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:26,501 INFO L273 TraceCheckUtils]: 49: Hoare triple {16848#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16849#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:26,502 INFO L273 TraceCheckUtils]: 50: Hoare triple {16849#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16849#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:26,502 INFO L273 TraceCheckUtils]: 51: Hoare triple {16849#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16850#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:26,503 INFO L273 TraceCheckUtils]: 52: Hoare triple {16850#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16850#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:26,503 INFO L273 TraceCheckUtils]: 53: Hoare triple {16850#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16851#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:26,504 INFO L273 TraceCheckUtils]: 54: Hoare triple {16851#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16851#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:26,505 INFO L273 TraceCheckUtils]: 55: Hoare triple {16851#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16852#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:26,505 INFO L273 TraceCheckUtils]: 56: Hoare triple {16852#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16852#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:26,506 INFO L273 TraceCheckUtils]: 57: Hoare triple {16852#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16853#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:26,506 INFO L273 TraceCheckUtils]: 58: Hoare triple {16853#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16853#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:26,507 INFO L273 TraceCheckUtils]: 59: Hoare triple {16853#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16854#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:26,508 INFO L273 TraceCheckUtils]: 60: Hoare triple {16854#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16854#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:26,508 INFO L273 TraceCheckUtils]: 61: Hoare triple {16854#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16855#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:26,509 INFO L273 TraceCheckUtils]: 62: Hoare triple {16855#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16855#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:26,510 INFO L273 TraceCheckUtils]: 63: Hoare triple {16855#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16856#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:26,510 INFO L273 TraceCheckUtils]: 64: Hoare triple {16856#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16856#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:26,511 INFO L273 TraceCheckUtils]: 65: Hoare triple {16856#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16857#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:26,511 INFO L273 TraceCheckUtils]: 66: Hoare triple {16857#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16857#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:26,512 INFO L273 TraceCheckUtils]: 67: Hoare triple {16857#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16858#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:26,513 INFO L273 TraceCheckUtils]: 68: Hoare triple {16858#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16858#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:26,513 INFO L273 TraceCheckUtils]: 69: Hoare triple {16858#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16859#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:26,514 INFO L273 TraceCheckUtils]: 70: Hoare triple {16859#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16859#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:26,514 INFO L273 TraceCheckUtils]: 71: Hoare triple {16859#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16860#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:26,515 INFO L273 TraceCheckUtils]: 72: Hoare triple {16860#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16860#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:26,516 INFO L273 TraceCheckUtils]: 73: Hoare triple {16860#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16861#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:26,516 INFO L273 TraceCheckUtils]: 74: Hoare triple {16861#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16861#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:26,517 INFO L273 TraceCheckUtils]: 75: Hoare triple {16861#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16862#(<= main_~i~0 35)} is VALID [2018-11-23 13:06:26,517 INFO L273 TraceCheckUtils]: 76: Hoare triple {16862#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16862#(<= main_~i~0 35)} is VALID [2018-11-23 13:06:26,518 INFO L273 TraceCheckUtils]: 77: Hoare triple {16862#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16863#(<= main_~i~0 36)} is VALID [2018-11-23 13:06:26,519 INFO L273 TraceCheckUtils]: 78: Hoare triple {16863#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16863#(<= main_~i~0 36)} is VALID [2018-11-23 13:06:26,519 INFO L273 TraceCheckUtils]: 79: Hoare triple {16863#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16864#(<= main_~i~0 37)} is VALID [2018-11-23 13:06:26,520 INFO L273 TraceCheckUtils]: 80: Hoare triple {16864#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16864#(<= main_~i~0 37)} is VALID [2018-11-23 13:06:26,521 INFO L273 TraceCheckUtils]: 81: Hoare triple {16864#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16865#(<= main_~i~0 38)} is VALID [2018-11-23 13:06:26,521 INFO L273 TraceCheckUtils]: 82: Hoare triple {16865#(<= main_~i~0 38)} assume !(~i~0 < 1024); {16826#false} is VALID [2018-11-23 13:06:26,521 INFO L273 TraceCheckUtils]: 83: Hoare triple {16826#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {16826#false} is VALID [2018-11-23 13:06:26,522 INFO L256 TraceCheckUtils]: 84: Hoare triple {16826#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {16826#false} is VALID [2018-11-23 13:06:26,522 INFO L273 TraceCheckUtils]: 85: Hoare triple {16826#false} ~cond := #in~cond; {16826#false} is VALID [2018-11-23 13:06:26,522 INFO L273 TraceCheckUtils]: 86: Hoare triple {16826#false} assume 0 == ~cond; {16826#false} is VALID [2018-11-23 13:06:26,522 INFO L273 TraceCheckUtils]: 87: Hoare triple {16826#false} assume !false; {16826#false} is VALID [2018-11-23 13:06:26,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:26,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:26,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-11-23 13:06:26,547 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 88 [2018-11-23 13:06:26,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:26,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 13:06:26,635 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:26,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 13:06:26,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 13:06:26,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 13:06:26,637 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 42 states. [2018-11-23 13:06:27,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:27,464 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-11-23 13:06:27,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 13:06:27,464 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 88 [2018-11-23 13:06:27,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:27,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 13:06:27,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 98 transitions. [2018-11-23 13:06:27,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 13:06:27,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 98 transitions. [2018-11-23 13:06:27,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 98 transitions. [2018-11-23 13:06:27,558 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:27,560 INFO L225 Difference]: With dead ends: 98 [2018-11-23 13:06:27,560 INFO L226 Difference]: Without dead ends: 92 [2018-11-23 13:06:27,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 13:06:27,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-23 13:06:27,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2018-11-23 13:06:27,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:27,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 91 states. [2018-11-23 13:06:27,608 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 91 states. [2018-11-23 13:06:27,608 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 91 states. [2018-11-23 13:06:27,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:27,609 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-11-23 13:06:27,609 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-11-23 13:06:27,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:27,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:27,610 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 92 states. [2018-11-23 13:06:27,610 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 92 states. [2018-11-23 13:06:27,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:27,611 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-11-23 13:06:27,611 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-11-23 13:06:27,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:27,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:27,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:27,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:27,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 13:06:27,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-11-23 13:06:27,613 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-11-23 13:06:27,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:27,614 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-11-23 13:06:27,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 13:06:27,614 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-11-23 13:06:27,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 13:06:27,614 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:27,615 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:27,615 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:27,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:27,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1609369781, now seen corresponding path program 39 times [2018-11-23 13:06:27,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:27,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:27,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:27,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:27,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:28,496 INFO L256 TraceCheckUtils]: 0: Hoare triple {17597#true} call ULTIMATE.init(); {17597#true} is VALID [2018-11-23 13:06:28,496 INFO L273 TraceCheckUtils]: 1: Hoare triple {17597#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17597#true} is VALID [2018-11-23 13:06:28,497 INFO L273 TraceCheckUtils]: 2: Hoare triple {17597#true} assume true; {17597#true} is VALID [2018-11-23 13:06:28,497 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17597#true} {17597#true} #35#return; {17597#true} is VALID [2018-11-23 13:06:28,497 INFO L256 TraceCheckUtils]: 4: Hoare triple {17597#true} call #t~ret2 := main(); {17597#true} is VALID [2018-11-23 13:06:28,499 INFO L273 TraceCheckUtils]: 5: Hoare triple {17597#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {17599#(= main_~i~0 0)} is VALID [2018-11-23 13:06:28,499 INFO L273 TraceCheckUtils]: 6: Hoare triple {17599#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17599#(= main_~i~0 0)} is VALID [2018-11-23 13:06:28,500 INFO L273 TraceCheckUtils]: 7: Hoare triple {17599#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17600#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:28,500 INFO L273 TraceCheckUtils]: 8: Hoare triple {17600#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17600#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:28,500 INFO L273 TraceCheckUtils]: 9: Hoare triple {17600#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17601#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:28,501 INFO L273 TraceCheckUtils]: 10: Hoare triple {17601#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17601#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:28,501 INFO L273 TraceCheckUtils]: 11: Hoare triple {17601#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17602#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:28,501 INFO L273 TraceCheckUtils]: 12: Hoare triple {17602#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17602#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:28,502 INFO L273 TraceCheckUtils]: 13: Hoare triple {17602#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17603#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:28,502 INFO L273 TraceCheckUtils]: 14: Hoare triple {17603#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17603#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:28,502 INFO L273 TraceCheckUtils]: 15: Hoare triple {17603#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17604#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:28,503 INFO L273 TraceCheckUtils]: 16: Hoare triple {17604#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17604#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:28,504 INFO L273 TraceCheckUtils]: 17: Hoare triple {17604#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17605#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:28,504 INFO L273 TraceCheckUtils]: 18: Hoare triple {17605#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17605#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:28,505 INFO L273 TraceCheckUtils]: 19: Hoare triple {17605#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17606#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:28,505 INFO L273 TraceCheckUtils]: 20: Hoare triple {17606#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17606#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:28,506 INFO L273 TraceCheckUtils]: 21: Hoare triple {17606#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17607#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:28,507 INFO L273 TraceCheckUtils]: 22: Hoare triple {17607#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17607#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:28,507 INFO L273 TraceCheckUtils]: 23: Hoare triple {17607#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17608#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:28,508 INFO L273 TraceCheckUtils]: 24: Hoare triple {17608#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17608#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:28,508 INFO L273 TraceCheckUtils]: 25: Hoare triple {17608#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17609#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:28,509 INFO L273 TraceCheckUtils]: 26: Hoare triple {17609#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17609#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:28,510 INFO L273 TraceCheckUtils]: 27: Hoare triple {17609#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17610#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:28,510 INFO L273 TraceCheckUtils]: 28: Hoare triple {17610#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17610#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:28,511 INFO L273 TraceCheckUtils]: 29: Hoare triple {17610#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17611#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:28,511 INFO L273 TraceCheckUtils]: 30: Hoare triple {17611#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17611#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:28,512 INFO L273 TraceCheckUtils]: 31: Hoare triple {17611#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17612#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:28,513 INFO L273 TraceCheckUtils]: 32: Hoare triple {17612#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17612#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:28,513 INFO L273 TraceCheckUtils]: 33: Hoare triple {17612#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17613#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:28,514 INFO L273 TraceCheckUtils]: 34: Hoare triple {17613#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17613#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:28,515 INFO L273 TraceCheckUtils]: 35: Hoare triple {17613#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17614#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:28,515 INFO L273 TraceCheckUtils]: 36: Hoare triple {17614#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17614#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:28,516 INFO L273 TraceCheckUtils]: 37: Hoare triple {17614#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17615#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:28,516 INFO L273 TraceCheckUtils]: 38: Hoare triple {17615#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17615#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:28,517 INFO L273 TraceCheckUtils]: 39: Hoare triple {17615#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17616#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:28,537 INFO L273 TraceCheckUtils]: 40: Hoare triple {17616#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17616#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:28,548 INFO L273 TraceCheckUtils]: 41: Hoare triple {17616#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17617#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:28,548 INFO L273 TraceCheckUtils]: 42: Hoare triple {17617#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17617#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:28,549 INFO L273 TraceCheckUtils]: 43: Hoare triple {17617#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17618#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:28,549 INFO L273 TraceCheckUtils]: 44: Hoare triple {17618#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17618#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:28,550 INFO L273 TraceCheckUtils]: 45: Hoare triple {17618#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17619#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:28,550 INFO L273 TraceCheckUtils]: 46: Hoare triple {17619#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17619#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:28,550 INFO L273 TraceCheckUtils]: 47: Hoare triple {17619#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17620#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:28,551 INFO L273 TraceCheckUtils]: 48: Hoare triple {17620#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17620#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:28,551 INFO L273 TraceCheckUtils]: 49: Hoare triple {17620#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17621#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:28,551 INFO L273 TraceCheckUtils]: 50: Hoare triple {17621#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17621#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:28,552 INFO L273 TraceCheckUtils]: 51: Hoare triple {17621#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17622#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:28,552 INFO L273 TraceCheckUtils]: 52: Hoare triple {17622#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17622#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:28,553 INFO L273 TraceCheckUtils]: 53: Hoare triple {17622#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17623#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:28,558 INFO L273 TraceCheckUtils]: 54: Hoare triple {17623#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17623#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:28,558 INFO L273 TraceCheckUtils]: 55: Hoare triple {17623#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17624#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:28,558 INFO L273 TraceCheckUtils]: 56: Hoare triple {17624#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17624#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:28,559 INFO L273 TraceCheckUtils]: 57: Hoare triple {17624#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17625#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:28,559 INFO L273 TraceCheckUtils]: 58: Hoare triple {17625#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17625#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:28,560 INFO L273 TraceCheckUtils]: 59: Hoare triple {17625#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17626#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:28,560 INFO L273 TraceCheckUtils]: 60: Hoare triple {17626#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17626#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:28,560 INFO L273 TraceCheckUtils]: 61: Hoare triple {17626#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17627#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:28,561 INFO L273 TraceCheckUtils]: 62: Hoare triple {17627#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17627#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:28,561 INFO L273 TraceCheckUtils]: 63: Hoare triple {17627#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17628#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:28,561 INFO L273 TraceCheckUtils]: 64: Hoare triple {17628#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17628#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:28,562 INFO L273 TraceCheckUtils]: 65: Hoare triple {17628#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17629#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:28,562 INFO L273 TraceCheckUtils]: 66: Hoare triple {17629#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17629#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:28,563 INFO L273 TraceCheckUtils]: 67: Hoare triple {17629#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17630#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:28,564 INFO L273 TraceCheckUtils]: 68: Hoare triple {17630#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17630#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:28,564 INFO L273 TraceCheckUtils]: 69: Hoare triple {17630#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17631#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:28,565 INFO L273 TraceCheckUtils]: 70: Hoare triple {17631#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17631#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:28,566 INFO L273 TraceCheckUtils]: 71: Hoare triple {17631#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17632#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:28,566 INFO L273 TraceCheckUtils]: 72: Hoare triple {17632#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17632#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:28,567 INFO L273 TraceCheckUtils]: 73: Hoare triple {17632#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17633#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:28,567 INFO L273 TraceCheckUtils]: 74: Hoare triple {17633#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17633#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:28,568 INFO L273 TraceCheckUtils]: 75: Hoare triple {17633#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17634#(<= main_~i~0 35)} is VALID [2018-11-23 13:06:28,569 INFO L273 TraceCheckUtils]: 76: Hoare triple {17634#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17634#(<= main_~i~0 35)} is VALID [2018-11-23 13:06:28,569 INFO L273 TraceCheckUtils]: 77: Hoare triple {17634#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17635#(<= main_~i~0 36)} is VALID [2018-11-23 13:06:28,570 INFO L273 TraceCheckUtils]: 78: Hoare triple {17635#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17635#(<= main_~i~0 36)} is VALID [2018-11-23 13:06:28,570 INFO L273 TraceCheckUtils]: 79: Hoare triple {17635#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17636#(<= main_~i~0 37)} is VALID [2018-11-23 13:06:28,571 INFO L273 TraceCheckUtils]: 80: Hoare triple {17636#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17636#(<= main_~i~0 37)} is VALID [2018-11-23 13:06:28,572 INFO L273 TraceCheckUtils]: 81: Hoare triple {17636#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17637#(<= main_~i~0 38)} is VALID [2018-11-23 13:06:28,572 INFO L273 TraceCheckUtils]: 82: Hoare triple {17637#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17637#(<= main_~i~0 38)} is VALID [2018-11-23 13:06:28,573 INFO L273 TraceCheckUtils]: 83: Hoare triple {17637#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17638#(<= main_~i~0 39)} is VALID [2018-11-23 13:06:28,574 INFO L273 TraceCheckUtils]: 84: Hoare triple {17638#(<= main_~i~0 39)} assume !(~i~0 < 1024); {17598#false} is VALID [2018-11-23 13:06:28,574 INFO L273 TraceCheckUtils]: 85: Hoare triple {17598#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {17598#false} is VALID [2018-11-23 13:06:28,574 INFO L256 TraceCheckUtils]: 86: Hoare triple {17598#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {17598#false} is VALID [2018-11-23 13:06:28,574 INFO L273 TraceCheckUtils]: 87: Hoare triple {17598#false} ~cond := #in~cond; {17598#false} is VALID [2018-11-23 13:06:28,574 INFO L273 TraceCheckUtils]: 88: Hoare triple {17598#false} assume 0 == ~cond; {17598#false} is VALID [2018-11-23 13:06:28,575 INFO L273 TraceCheckUtils]: 89: Hoare triple {17598#false} assume !false; {17598#false} is VALID [2018-11-23 13:06:28,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:28,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:28,581 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:28,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:06:39,093 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-11-23 13:06:39,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:39,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:39,464 INFO L256 TraceCheckUtils]: 0: Hoare triple {17597#true} call ULTIMATE.init(); {17597#true} is VALID [2018-11-23 13:06:39,464 INFO L273 TraceCheckUtils]: 1: Hoare triple {17597#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17597#true} is VALID [2018-11-23 13:06:39,464 INFO L273 TraceCheckUtils]: 2: Hoare triple {17597#true} assume true; {17597#true} is VALID [2018-11-23 13:06:39,464 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17597#true} {17597#true} #35#return; {17597#true} is VALID [2018-11-23 13:06:39,464 INFO L256 TraceCheckUtils]: 4: Hoare triple {17597#true} call #t~ret2 := main(); {17597#true} is VALID [2018-11-23 13:06:39,465 INFO L273 TraceCheckUtils]: 5: Hoare triple {17597#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {17657#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:39,465 INFO L273 TraceCheckUtils]: 6: Hoare triple {17657#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17657#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:39,465 INFO L273 TraceCheckUtils]: 7: Hoare triple {17657#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17600#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:39,466 INFO L273 TraceCheckUtils]: 8: Hoare triple {17600#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17600#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:39,466 INFO L273 TraceCheckUtils]: 9: Hoare triple {17600#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17601#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:39,466 INFO L273 TraceCheckUtils]: 10: Hoare triple {17601#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17601#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:39,467 INFO L273 TraceCheckUtils]: 11: Hoare triple {17601#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17602#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:39,467 INFO L273 TraceCheckUtils]: 12: Hoare triple {17602#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17602#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:39,468 INFO L273 TraceCheckUtils]: 13: Hoare triple {17602#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17603#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:39,469 INFO L273 TraceCheckUtils]: 14: Hoare triple {17603#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17603#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:39,469 INFO L273 TraceCheckUtils]: 15: Hoare triple {17603#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17604#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:39,470 INFO L273 TraceCheckUtils]: 16: Hoare triple {17604#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17604#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:39,470 INFO L273 TraceCheckUtils]: 17: Hoare triple {17604#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17605#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:39,471 INFO L273 TraceCheckUtils]: 18: Hoare triple {17605#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17605#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:39,472 INFO L273 TraceCheckUtils]: 19: Hoare triple {17605#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17606#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:39,472 INFO L273 TraceCheckUtils]: 20: Hoare triple {17606#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17606#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:39,473 INFO L273 TraceCheckUtils]: 21: Hoare triple {17606#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17607#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:39,473 INFO L273 TraceCheckUtils]: 22: Hoare triple {17607#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17607#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:39,474 INFO L273 TraceCheckUtils]: 23: Hoare triple {17607#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17608#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:39,475 INFO L273 TraceCheckUtils]: 24: Hoare triple {17608#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17608#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:39,475 INFO L273 TraceCheckUtils]: 25: Hoare triple {17608#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17609#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:39,476 INFO L273 TraceCheckUtils]: 26: Hoare triple {17609#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17609#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:39,477 INFO L273 TraceCheckUtils]: 27: Hoare triple {17609#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17610#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:39,477 INFO L273 TraceCheckUtils]: 28: Hoare triple {17610#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17610#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:39,478 INFO L273 TraceCheckUtils]: 29: Hoare triple {17610#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17611#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:39,478 INFO L273 TraceCheckUtils]: 30: Hoare triple {17611#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17611#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:39,479 INFO L273 TraceCheckUtils]: 31: Hoare triple {17611#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17612#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:39,480 INFO L273 TraceCheckUtils]: 32: Hoare triple {17612#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17612#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:39,480 INFO L273 TraceCheckUtils]: 33: Hoare triple {17612#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17613#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:39,481 INFO L273 TraceCheckUtils]: 34: Hoare triple {17613#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17613#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:39,482 INFO L273 TraceCheckUtils]: 35: Hoare triple {17613#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17614#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:39,482 INFO L273 TraceCheckUtils]: 36: Hoare triple {17614#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17614#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:39,483 INFO L273 TraceCheckUtils]: 37: Hoare triple {17614#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17615#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:39,483 INFO L273 TraceCheckUtils]: 38: Hoare triple {17615#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17615#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:39,484 INFO L273 TraceCheckUtils]: 39: Hoare triple {17615#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17616#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:39,485 INFO L273 TraceCheckUtils]: 40: Hoare triple {17616#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17616#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:39,485 INFO L273 TraceCheckUtils]: 41: Hoare triple {17616#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17617#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:39,486 INFO L273 TraceCheckUtils]: 42: Hoare triple {17617#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17617#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:39,486 INFO L273 TraceCheckUtils]: 43: Hoare triple {17617#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17618#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:39,487 INFO L273 TraceCheckUtils]: 44: Hoare triple {17618#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17618#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:39,488 INFO L273 TraceCheckUtils]: 45: Hoare triple {17618#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17619#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:39,488 INFO L273 TraceCheckUtils]: 46: Hoare triple {17619#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17619#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:39,489 INFO L273 TraceCheckUtils]: 47: Hoare triple {17619#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17620#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:39,489 INFO L273 TraceCheckUtils]: 48: Hoare triple {17620#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17620#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:39,490 INFO L273 TraceCheckUtils]: 49: Hoare triple {17620#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17621#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:39,491 INFO L273 TraceCheckUtils]: 50: Hoare triple {17621#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17621#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:39,491 INFO L273 TraceCheckUtils]: 51: Hoare triple {17621#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17622#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:39,492 INFO L273 TraceCheckUtils]: 52: Hoare triple {17622#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17622#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:39,493 INFO L273 TraceCheckUtils]: 53: Hoare triple {17622#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17623#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:39,493 INFO L273 TraceCheckUtils]: 54: Hoare triple {17623#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17623#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:39,494 INFO L273 TraceCheckUtils]: 55: Hoare triple {17623#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17624#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:39,494 INFO L273 TraceCheckUtils]: 56: Hoare triple {17624#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17624#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:39,495 INFO L273 TraceCheckUtils]: 57: Hoare triple {17624#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17625#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:39,496 INFO L273 TraceCheckUtils]: 58: Hoare triple {17625#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17625#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:39,496 INFO L273 TraceCheckUtils]: 59: Hoare triple {17625#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17626#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:39,497 INFO L273 TraceCheckUtils]: 60: Hoare triple {17626#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17626#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:39,497 INFO L273 TraceCheckUtils]: 61: Hoare triple {17626#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17627#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:39,498 INFO L273 TraceCheckUtils]: 62: Hoare triple {17627#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17627#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:39,499 INFO L273 TraceCheckUtils]: 63: Hoare triple {17627#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17628#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:39,499 INFO L273 TraceCheckUtils]: 64: Hoare triple {17628#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17628#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:39,500 INFO L273 TraceCheckUtils]: 65: Hoare triple {17628#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17629#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:39,500 INFO L273 TraceCheckUtils]: 66: Hoare triple {17629#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17629#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:39,501 INFO L273 TraceCheckUtils]: 67: Hoare triple {17629#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17630#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:39,502 INFO L273 TraceCheckUtils]: 68: Hoare triple {17630#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17630#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:39,502 INFO L273 TraceCheckUtils]: 69: Hoare triple {17630#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17631#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:39,503 INFO L273 TraceCheckUtils]: 70: Hoare triple {17631#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17631#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:39,504 INFO L273 TraceCheckUtils]: 71: Hoare triple {17631#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17632#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:39,504 INFO L273 TraceCheckUtils]: 72: Hoare triple {17632#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17632#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:39,505 INFO L273 TraceCheckUtils]: 73: Hoare triple {17632#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17633#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:39,505 INFO L273 TraceCheckUtils]: 74: Hoare triple {17633#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17633#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:39,506 INFO L273 TraceCheckUtils]: 75: Hoare triple {17633#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17634#(<= main_~i~0 35)} is VALID [2018-11-23 13:06:39,507 INFO L273 TraceCheckUtils]: 76: Hoare triple {17634#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17634#(<= main_~i~0 35)} is VALID [2018-11-23 13:06:39,507 INFO L273 TraceCheckUtils]: 77: Hoare triple {17634#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17635#(<= main_~i~0 36)} is VALID [2018-11-23 13:06:39,508 INFO L273 TraceCheckUtils]: 78: Hoare triple {17635#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17635#(<= main_~i~0 36)} is VALID [2018-11-23 13:06:39,509 INFO L273 TraceCheckUtils]: 79: Hoare triple {17635#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17636#(<= main_~i~0 37)} is VALID [2018-11-23 13:06:39,509 INFO L273 TraceCheckUtils]: 80: Hoare triple {17636#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17636#(<= main_~i~0 37)} is VALID [2018-11-23 13:06:39,510 INFO L273 TraceCheckUtils]: 81: Hoare triple {17636#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17637#(<= main_~i~0 38)} is VALID [2018-11-23 13:06:39,510 INFO L273 TraceCheckUtils]: 82: Hoare triple {17637#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {17637#(<= main_~i~0 38)} is VALID [2018-11-23 13:06:39,511 INFO L273 TraceCheckUtils]: 83: Hoare triple {17637#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17638#(<= main_~i~0 39)} is VALID [2018-11-23 13:06:39,512 INFO L273 TraceCheckUtils]: 84: Hoare triple {17638#(<= main_~i~0 39)} assume !(~i~0 < 1024); {17598#false} is VALID [2018-11-23 13:06:39,512 INFO L273 TraceCheckUtils]: 85: Hoare triple {17598#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {17598#false} is VALID [2018-11-23 13:06:39,512 INFO L256 TraceCheckUtils]: 86: Hoare triple {17598#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {17598#false} is VALID [2018-11-23 13:06:39,512 INFO L273 TraceCheckUtils]: 87: Hoare triple {17598#false} ~cond := #in~cond; {17598#false} is VALID [2018-11-23 13:06:39,512 INFO L273 TraceCheckUtils]: 88: Hoare triple {17598#false} assume 0 == ~cond; {17598#false} is VALID [2018-11-23 13:06:39,513 INFO L273 TraceCheckUtils]: 89: Hoare triple {17598#false} assume !false; {17598#false} is VALID [2018-11-23 13:06:39,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:39,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:39,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2018-11-23 13:06:39,543 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 90 [2018-11-23 13:06:39,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:39,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-23 13:06:39,632 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 13:06:39,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-23 13:06:39,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-23 13:06:39,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 13:06:39,634 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 43 states. [2018-11-23 13:06:40,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:40,124 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-11-23 13:06:40,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 13:06:40,124 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 90 [2018-11-23 13:06:40,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:40,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 13:06:40,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 100 transitions. [2018-11-23 13:06:40,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 13:06:40,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 100 transitions. [2018-11-23 13:06:40,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 100 transitions. [2018-11-23 13:06:40,219 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:40,221 INFO L225 Difference]: With dead ends: 100 [2018-11-23 13:06:40,221 INFO L226 Difference]: Without dead ends: 94 [2018-11-23 13:06:40,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 13:06:40,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-23 13:06:40,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-11-23 13:06:40,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:40,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 93 states. [2018-11-23 13:06:40,257 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 93 states. [2018-11-23 13:06:40,257 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 93 states. [2018-11-23 13:06:40,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:40,259 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-11-23 13:06:40,259 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-11-23 13:06:40,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:40,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:40,260 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 94 states. [2018-11-23 13:06:40,260 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 94 states. [2018-11-23 13:06:40,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:40,261 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-11-23 13:06:40,262 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-11-23 13:06:40,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:40,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:40,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:40,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:40,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 13:06:40,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-11-23 13:06:40,264 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2018-11-23 13:06:40,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:40,264 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-11-23 13:06:40,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-23 13:06:40,265 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-11-23 13:06:40,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-23 13:06:40,265 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:40,265 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:40,266 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:40,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:40,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1256854675, now seen corresponding path program 40 times [2018-11-23 13:06:40,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:40,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:40,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:40,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:40,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:41,163 INFO L256 TraceCheckUtils]: 0: Hoare triple {18386#true} call ULTIMATE.init(); {18386#true} is VALID [2018-11-23 13:06:41,163 INFO L273 TraceCheckUtils]: 1: Hoare triple {18386#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18386#true} is VALID [2018-11-23 13:06:41,163 INFO L273 TraceCheckUtils]: 2: Hoare triple {18386#true} assume true; {18386#true} is VALID [2018-11-23 13:06:41,163 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18386#true} {18386#true} #35#return; {18386#true} is VALID [2018-11-23 13:06:41,164 INFO L256 TraceCheckUtils]: 4: Hoare triple {18386#true} call #t~ret2 := main(); {18386#true} is VALID [2018-11-23 13:06:41,164 INFO L273 TraceCheckUtils]: 5: Hoare triple {18386#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {18388#(= main_~i~0 0)} is VALID [2018-11-23 13:06:41,164 INFO L273 TraceCheckUtils]: 6: Hoare triple {18388#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18388#(= main_~i~0 0)} is VALID [2018-11-23 13:06:41,165 INFO L273 TraceCheckUtils]: 7: Hoare triple {18388#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18389#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:41,165 INFO L273 TraceCheckUtils]: 8: Hoare triple {18389#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18389#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:41,166 INFO L273 TraceCheckUtils]: 9: Hoare triple {18389#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18390#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:41,166 INFO L273 TraceCheckUtils]: 10: Hoare triple {18390#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18390#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:41,166 INFO L273 TraceCheckUtils]: 11: Hoare triple {18390#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18391#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:41,167 INFO L273 TraceCheckUtils]: 12: Hoare triple {18391#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18391#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:41,168 INFO L273 TraceCheckUtils]: 13: Hoare triple {18391#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18392#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:41,168 INFO L273 TraceCheckUtils]: 14: Hoare triple {18392#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18392#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:41,169 INFO L273 TraceCheckUtils]: 15: Hoare triple {18392#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18393#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:41,169 INFO L273 TraceCheckUtils]: 16: Hoare triple {18393#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18393#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:41,170 INFO L273 TraceCheckUtils]: 17: Hoare triple {18393#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18394#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:41,170 INFO L273 TraceCheckUtils]: 18: Hoare triple {18394#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18394#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:41,171 INFO L273 TraceCheckUtils]: 19: Hoare triple {18394#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18395#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:41,172 INFO L273 TraceCheckUtils]: 20: Hoare triple {18395#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18395#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:41,172 INFO L273 TraceCheckUtils]: 21: Hoare triple {18395#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18396#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:41,173 INFO L273 TraceCheckUtils]: 22: Hoare triple {18396#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18396#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:41,173 INFO L273 TraceCheckUtils]: 23: Hoare triple {18396#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18397#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:41,174 INFO L273 TraceCheckUtils]: 24: Hoare triple {18397#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18397#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:41,174 INFO L273 TraceCheckUtils]: 25: Hoare triple {18397#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18398#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:41,175 INFO L273 TraceCheckUtils]: 26: Hoare triple {18398#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18398#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:41,176 INFO L273 TraceCheckUtils]: 27: Hoare triple {18398#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18399#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:41,176 INFO L273 TraceCheckUtils]: 28: Hoare triple {18399#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18399#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:41,177 INFO L273 TraceCheckUtils]: 29: Hoare triple {18399#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18400#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:41,177 INFO L273 TraceCheckUtils]: 30: Hoare triple {18400#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18400#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:41,178 INFO L273 TraceCheckUtils]: 31: Hoare triple {18400#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18401#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:41,179 INFO L273 TraceCheckUtils]: 32: Hoare triple {18401#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18401#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:41,179 INFO L273 TraceCheckUtils]: 33: Hoare triple {18401#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18402#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:41,180 INFO L273 TraceCheckUtils]: 34: Hoare triple {18402#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18402#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:41,181 INFO L273 TraceCheckUtils]: 35: Hoare triple {18402#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18403#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:41,181 INFO L273 TraceCheckUtils]: 36: Hoare triple {18403#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18403#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:41,182 INFO L273 TraceCheckUtils]: 37: Hoare triple {18403#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18404#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:41,182 INFO L273 TraceCheckUtils]: 38: Hoare triple {18404#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18404#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:41,183 INFO L273 TraceCheckUtils]: 39: Hoare triple {18404#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18405#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:41,183 INFO L273 TraceCheckUtils]: 40: Hoare triple {18405#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18405#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:41,184 INFO L273 TraceCheckUtils]: 41: Hoare triple {18405#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18406#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:41,185 INFO L273 TraceCheckUtils]: 42: Hoare triple {18406#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18406#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:41,185 INFO L273 TraceCheckUtils]: 43: Hoare triple {18406#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18407#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:41,186 INFO L273 TraceCheckUtils]: 44: Hoare triple {18407#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18407#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:41,186 INFO L273 TraceCheckUtils]: 45: Hoare triple {18407#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18408#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:41,187 INFO L273 TraceCheckUtils]: 46: Hoare triple {18408#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18408#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:41,188 INFO L273 TraceCheckUtils]: 47: Hoare triple {18408#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18409#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:41,188 INFO L273 TraceCheckUtils]: 48: Hoare triple {18409#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18409#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:41,189 INFO L273 TraceCheckUtils]: 49: Hoare triple {18409#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18410#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:41,189 INFO L273 TraceCheckUtils]: 50: Hoare triple {18410#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18410#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:41,190 INFO L273 TraceCheckUtils]: 51: Hoare triple {18410#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18411#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:41,190 INFO L273 TraceCheckUtils]: 52: Hoare triple {18411#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18411#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:41,191 INFO L273 TraceCheckUtils]: 53: Hoare triple {18411#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18412#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:41,192 INFO L273 TraceCheckUtils]: 54: Hoare triple {18412#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18412#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:41,192 INFO L273 TraceCheckUtils]: 55: Hoare triple {18412#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18413#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:41,193 INFO L273 TraceCheckUtils]: 56: Hoare triple {18413#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18413#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:41,193 INFO L273 TraceCheckUtils]: 57: Hoare triple {18413#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18414#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:41,194 INFO L273 TraceCheckUtils]: 58: Hoare triple {18414#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18414#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:41,195 INFO L273 TraceCheckUtils]: 59: Hoare triple {18414#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18415#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:41,195 INFO L273 TraceCheckUtils]: 60: Hoare triple {18415#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18415#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:41,196 INFO L273 TraceCheckUtils]: 61: Hoare triple {18415#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18416#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:41,196 INFO L273 TraceCheckUtils]: 62: Hoare triple {18416#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18416#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:41,197 INFO L273 TraceCheckUtils]: 63: Hoare triple {18416#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18417#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:41,197 INFO L273 TraceCheckUtils]: 64: Hoare triple {18417#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18417#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:41,198 INFO L273 TraceCheckUtils]: 65: Hoare triple {18417#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18418#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:41,199 INFO L273 TraceCheckUtils]: 66: Hoare triple {18418#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18418#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:41,199 INFO L273 TraceCheckUtils]: 67: Hoare triple {18418#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18419#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:41,200 INFO L273 TraceCheckUtils]: 68: Hoare triple {18419#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18419#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:41,200 INFO L273 TraceCheckUtils]: 69: Hoare triple {18419#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18420#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:41,201 INFO L273 TraceCheckUtils]: 70: Hoare triple {18420#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18420#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:41,202 INFO L273 TraceCheckUtils]: 71: Hoare triple {18420#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18421#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:41,202 INFO L273 TraceCheckUtils]: 72: Hoare triple {18421#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18421#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:41,203 INFO L273 TraceCheckUtils]: 73: Hoare triple {18421#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18422#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:41,203 INFO L273 TraceCheckUtils]: 74: Hoare triple {18422#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18422#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:41,204 INFO L273 TraceCheckUtils]: 75: Hoare triple {18422#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18423#(<= main_~i~0 35)} is VALID [2018-11-23 13:06:41,204 INFO L273 TraceCheckUtils]: 76: Hoare triple {18423#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18423#(<= main_~i~0 35)} is VALID [2018-11-23 13:06:41,205 INFO L273 TraceCheckUtils]: 77: Hoare triple {18423#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18424#(<= main_~i~0 36)} is VALID [2018-11-23 13:06:41,205 INFO L273 TraceCheckUtils]: 78: Hoare triple {18424#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18424#(<= main_~i~0 36)} is VALID [2018-11-23 13:06:41,206 INFO L273 TraceCheckUtils]: 79: Hoare triple {18424#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18425#(<= main_~i~0 37)} is VALID [2018-11-23 13:06:41,207 INFO L273 TraceCheckUtils]: 80: Hoare triple {18425#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18425#(<= main_~i~0 37)} is VALID [2018-11-23 13:06:41,207 INFO L273 TraceCheckUtils]: 81: Hoare triple {18425#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18426#(<= main_~i~0 38)} is VALID [2018-11-23 13:06:41,208 INFO L273 TraceCheckUtils]: 82: Hoare triple {18426#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18426#(<= main_~i~0 38)} is VALID [2018-11-23 13:06:41,208 INFO L273 TraceCheckUtils]: 83: Hoare triple {18426#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18427#(<= main_~i~0 39)} is VALID [2018-11-23 13:06:41,209 INFO L273 TraceCheckUtils]: 84: Hoare triple {18427#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18427#(<= main_~i~0 39)} is VALID [2018-11-23 13:06:41,209 INFO L273 TraceCheckUtils]: 85: Hoare triple {18427#(<= main_~i~0 39)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18428#(<= main_~i~0 40)} is VALID [2018-11-23 13:06:41,210 INFO L273 TraceCheckUtils]: 86: Hoare triple {18428#(<= main_~i~0 40)} assume !(~i~0 < 1024); {18387#false} is VALID [2018-11-23 13:06:41,210 INFO L273 TraceCheckUtils]: 87: Hoare triple {18387#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {18387#false} is VALID [2018-11-23 13:06:41,211 INFO L256 TraceCheckUtils]: 88: Hoare triple {18387#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {18387#false} is VALID [2018-11-23 13:06:41,211 INFO L273 TraceCheckUtils]: 89: Hoare triple {18387#false} ~cond := #in~cond; {18387#false} is VALID [2018-11-23 13:06:41,211 INFO L273 TraceCheckUtils]: 90: Hoare triple {18387#false} assume 0 == ~cond; {18387#false} is VALID [2018-11-23 13:06:41,211 INFO L273 TraceCheckUtils]: 91: Hoare triple {18387#false} assume !false; {18387#false} is VALID [2018-11-23 13:06:41,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:41,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:41,218 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:41,226 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:06:41,258 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:06:41,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:41,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:41,520 INFO L256 TraceCheckUtils]: 0: Hoare triple {18386#true} call ULTIMATE.init(); {18386#true} is VALID [2018-11-23 13:06:41,520 INFO L273 TraceCheckUtils]: 1: Hoare triple {18386#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18386#true} is VALID [2018-11-23 13:06:41,520 INFO L273 TraceCheckUtils]: 2: Hoare triple {18386#true} assume true; {18386#true} is VALID [2018-11-23 13:06:41,520 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18386#true} {18386#true} #35#return; {18386#true} is VALID [2018-11-23 13:06:41,521 INFO L256 TraceCheckUtils]: 4: Hoare triple {18386#true} call #t~ret2 := main(); {18386#true} is VALID [2018-11-23 13:06:41,521 INFO L273 TraceCheckUtils]: 5: Hoare triple {18386#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {18447#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:41,522 INFO L273 TraceCheckUtils]: 6: Hoare triple {18447#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18447#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:41,522 INFO L273 TraceCheckUtils]: 7: Hoare triple {18447#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18389#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:41,523 INFO L273 TraceCheckUtils]: 8: Hoare triple {18389#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18389#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:41,523 INFO L273 TraceCheckUtils]: 9: Hoare triple {18389#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18390#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:41,523 INFO L273 TraceCheckUtils]: 10: Hoare triple {18390#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18390#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:41,524 INFO L273 TraceCheckUtils]: 11: Hoare triple {18390#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18391#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:41,524 INFO L273 TraceCheckUtils]: 12: Hoare triple {18391#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18391#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:41,525 INFO L273 TraceCheckUtils]: 13: Hoare triple {18391#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18392#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:41,525 INFO L273 TraceCheckUtils]: 14: Hoare triple {18392#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18392#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:41,526 INFO L273 TraceCheckUtils]: 15: Hoare triple {18392#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18393#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:41,527 INFO L273 TraceCheckUtils]: 16: Hoare triple {18393#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18393#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:41,527 INFO L273 TraceCheckUtils]: 17: Hoare triple {18393#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18394#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:41,528 INFO L273 TraceCheckUtils]: 18: Hoare triple {18394#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18394#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:41,529 INFO L273 TraceCheckUtils]: 19: Hoare triple {18394#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18395#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:41,529 INFO L273 TraceCheckUtils]: 20: Hoare triple {18395#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18395#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:41,530 INFO L273 TraceCheckUtils]: 21: Hoare triple {18395#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18396#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:41,530 INFO L273 TraceCheckUtils]: 22: Hoare triple {18396#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18396#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:41,531 INFO L273 TraceCheckUtils]: 23: Hoare triple {18396#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18397#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:41,532 INFO L273 TraceCheckUtils]: 24: Hoare triple {18397#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18397#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:41,532 INFO L273 TraceCheckUtils]: 25: Hoare triple {18397#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18398#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:41,533 INFO L273 TraceCheckUtils]: 26: Hoare triple {18398#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18398#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:41,534 INFO L273 TraceCheckUtils]: 27: Hoare triple {18398#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18399#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:41,534 INFO L273 TraceCheckUtils]: 28: Hoare triple {18399#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18399#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:41,535 INFO L273 TraceCheckUtils]: 29: Hoare triple {18399#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18400#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:41,535 INFO L273 TraceCheckUtils]: 30: Hoare triple {18400#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18400#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:41,536 INFO L273 TraceCheckUtils]: 31: Hoare triple {18400#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18401#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:41,537 INFO L273 TraceCheckUtils]: 32: Hoare triple {18401#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18401#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:41,537 INFO L273 TraceCheckUtils]: 33: Hoare triple {18401#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18402#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:41,538 INFO L273 TraceCheckUtils]: 34: Hoare triple {18402#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18402#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:41,538 INFO L273 TraceCheckUtils]: 35: Hoare triple {18402#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18403#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:41,539 INFO L273 TraceCheckUtils]: 36: Hoare triple {18403#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18403#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:41,540 INFO L273 TraceCheckUtils]: 37: Hoare triple {18403#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18404#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:41,540 INFO L273 TraceCheckUtils]: 38: Hoare triple {18404#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18404#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:41,541 INFO L273 TraceCheckUtils]: 39: Hoare triple {18404#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18405#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:41,541 INFO L273 TraceCheckUtils]: 40: Hoare triple {18405#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18405#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:41,542 INFO L273 TraceCheckUtils]: 41: Hoare triple {18405#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18406#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:41,543 INFO L273 TraceCheckUtils]: 42: Hoare triple {18406#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18406#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:41,543 INFO L273 TraceCheckUtils]: 43: Hoare triple {18406#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18407#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:41,544 INFO L273 TraceCheckUtils]: 44: Hoare triple {18407#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18407#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:41,545 INFO L273 TraceCheckUtils]: 45: Hoare triple {18407#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18408#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:41,545 INFO L273 TraceCheckUtils]: 46: Hoare triple {18408#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18408#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:41,546 INFO L273 TraceCheckUtils]: 47: Hoare triple {18408#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18409#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:41,546 INFO L273 TraceCheckUtils]: 48: Hoare triple {18409#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18409#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:41,547 INFO L273 TraceCheckUtils]: 49: Hoare triple {18409#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18410#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:41,548 INFO L273 TraceCheckUtils]: 50: Hoare triple {18410#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18410#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:41,548 INFO L273 TraceCheckUtils]: 51: Hoare triple {18410#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18411#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:41,549 INFO L273 TraceCheckUtils]: 52: Hoare triple {18411#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18411#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:41,550 INFO L273 TraceCheckUtils]: 53: Hoare triple {18411#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18412#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:41,550 INFO L273 TraceCheckUtils]: 54: Hoare triple {18412#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18412#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:41,551 INFO L273 TraceCheckUtils]: 55: Hoare triple {18412#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18413#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:41,551 INFO L273 TraceCheckUtils]: 56: Hoare triple {18413#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18413#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:41,552 INFO L273 TraceCheckUtils]: 57: Hoare triple {18413#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18414#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:41,552 INFO L273 TraceCheckUtils]: 58: Hoare triple {18414#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18414#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:41,553 INFO L273 TraceCheckUtils]: 59: Hoare triple {18414#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18415#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:41,554 INFO L273 TraceCheckUtils]: 60: Hoare triple {18415#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18415#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:41,554 INFO L273 TraceCheckUtils]: 61: Hoare triple {18415#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18416#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:41,555 INFO L273 TraceCheckUtils]: 62: Hoare triple {18416#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18416#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:41,556 INFO L273 TraceCheckUtils]: 63: Hoare triple {18416#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18417#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:41,556 INFO L273 TraceCheckUtils]: 64: Hoare triple {18417#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18417#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:41,557 INFO L273 TraceCheckUtils]: 65: Hoare triple {18417#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18418#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:41,557 INFO L273 TraceCheckUtils]: 66: Hoare triple {18418#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18418#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:41,558 INFO L273 TraceCheckUtils]: 67: Hoare triple {18418#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18419#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:41,558 INFO L273 TraceCheckUtils]: 68: Hoare triple {18419#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18419#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:41,559 INFO L273 TraceCheckUtils]: 69: Hoare triple {18419#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18420#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:41,560 INFO L273 TraceCheckUtils]: 70: Hoare triple {18420#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18420#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:41,560 INFO L273 TraceCheckUtils]: 71: Hoare triple {18420#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18421#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:41,561 INFO L273 TraceCheckUtils]: 72: Hoare triple {18421#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18421#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:41,561 INFO L273 TraceCheckUtils]: 73: Hoare triple {18421#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18422#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:41,562 INFO L273 TraceCheckUtils]: 74: Hoare triple {18422#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18422#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:41,563 INFO L273 TraceCheckUtils]: 75: Hoare triple {18422#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18423#(<= main_~i~0 35)} is VALID [2018-11-23 13:06:41,563 INFO L273 TraceCheckUtils]: 76: Hoare triple {18423#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18423#(<= main_~i~0 35)} is VALID [2018-11-23 13:06:41,564 INFO L273 TraceCheckUtils]: 77: Hoare triple {18423#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18424#(<= main_~i~0 36)} is VALID [2018-11-23 13:06:41,564 INFO L273 TraceCheckUtils]: 78: Hoare triple {18424#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18424#(<= main_~i~0 36)} is VALID [2018-11-23 13:06:41,565 INFO L273 TraceCheckUtils]: 79: Hoare triple {18424#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18425#(<= main_~i~0 37)} is VALID [2018-11-23 13:06:41,566 INFO L273 TraceCheckUtils]: 80: Hoare triple {18425#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18425#(<= main_~i~0 37)} is VALID [2018-11-23 13:06:41,566 INFO L273 TraceCheckUtils]: 81: Hoare triple {18425#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18426#(<= main_~i~0 38)} is VALID [2018-11-23 13:06:41,567 INFO L273 TraceCheckUtils]: 82: Hoare triple {18426#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18426#(<= main_~i~0 38)} is VALID [2018-11-23 13:06:41,567 INFO L273 TraceCheckUtils]: 83: Hoare triple {18426#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18427#(<= main_~i~0 39)} is VALID [2018-11-23 13:06:41,568 INFO L273 TraceCheckUtils]: 84: Hoare triple {18427#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18427#(<= main_~i~0 39)} is VALID [2018-11-23 13:06:41,569 INFO L273 TraceCheckUtils]: 85: Hoare triple {18427#(<= main_~i~0 39)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18428#(<= main_~i~0 40)} is VALID [2018-11-23 13:06:41,569 INFO L273 TraceCheckUtils]: 86: Hoare triple {18428#(<= main_~i~0 40)} assume !(~i~0 < 1024); {18387#false} is VALID [2018-11-23 13:06:41,570 INFO L273 TraceCheckUtils]: 87: Hoare triple {18387#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {18387#false} is VALID [2018-11-23 13:06:41,570 INFO L256 TraceCheckUtils]: 88: Hoare triple {18387#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {18387#false} is VALID [2018-11-23 13:06:41,570 INFO L273 TraceCheckUtils]: 89: Hoare triple {18387#false} ~cond := #in~cond; {18387#false} is VALID [2018-11-23 13:06:41,570 INFO L273 TraceCheckUtils]: 90: Hoare triple {18387#false} assume 0 == ~cond; {18387#false} is VALID [2018-11-23 13:06:41,570 INFO L273 TraceCheckUtils]: 91: Hoare triple {18387#false} assume !false; {18387#false} is VALID [2018-11-23 13:06:41,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:41,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:41,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2018-11-23 13:06:41,598 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 92 [2018-11-23 13:06:41,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:41,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-23 13:06:41,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:41,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-23 13:06:41,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 13:06:41,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 13:06:41,685 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 44 states. [2018-11-23 13:06:42,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:42,203 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-11-23 13:06:42,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 13:06:42,203 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 92 [2018-11-23 13:06:42,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:42,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 13:06:42,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 102 transitions. [2018-11-23 13:06:42,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 13:06:42,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 102 transitions. [2018-11-23 13:06:42,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 102 transitions. [2018-11-23 13:06:42,296 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 13:06:42,298 INFO L225 Difference]: With dead ends: 102 [2018-11-23 13:06:42,298 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 13:06:42,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 13:06:42,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 13:06:42,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-11-23 13:06:42,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:42,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 95 states. [2018-11-23 13:06:42,331 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 95 states. [2018-11-23 13:06:42,331 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 95 states. [2018-11-23 13:06:42,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:42,333 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-11-23 13:06:42,333 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-11-23 13:06:42,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:42,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:42,333 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 96 states. [2018-11-23 13:06:42,334 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 96 states. [2018-11-23 13:06:42,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:42,335 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-11-23 13:06:42,335 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-11-23 13:06:42,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:42,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:42,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:42,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:42,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-23 13:06:42,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-11-23 13:06:42,337 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2018-11-23 13:06:42,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:42,338 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-11-23 13:06:42,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-23 13:06:42,338 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-11-23 13:06:42,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-23 13:06:42,338 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:42,339 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:42,339 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:42,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:42,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1792254193, now seen corresponding path program 41 times [2018-11-23 13:06:42,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:42,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:42,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:42,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:42,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:43,596 INFO L256 TraceCheckUtils]: 0: Hoare triple {19192#true} call ULTIMATE.init(); {19192#true} is VALID [2018-11-23 13:06:43,596 INFO L273 TraceCheckUtils]: 1: Hoare triple {19192#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19192#true} is VALID [2018-11-23 13:06:43,596 INFO L273 TraceCheckUtils]: 2: Hoare triple {19192#true} assume true; {19192#true} is VALID [2018-11-23 13:06:43,597 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19192#true} {19192#true} #35#return; {19192#true} is VALID [2018-11-23 13:06:43,597 INFO L256 TraceCheckUtils]: 4: Hoare triple {19192#true} call #t~ret2 := main(); {19192#true} is VALID [2018-11-23 13:06:43,597 INFO L273 TraceCheckUtils]: 5: Hoare triple {19192#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {19194#(= main_~i~0 0)} is VALID [2018-11-23 13:06:43,598 INFO L273 TraceCheckUtils]: 6: Hoare triple {19194#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19194#(= main_~i~0 0)} is VALID [2018-11-23 13:06:43,598 INFO L273 TraceCheckUtils]: 7: Hoare triple {19194#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19195#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:43,599 INFO L273 TraceCheckUtils]: 8: Hoare triple {19195#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19195#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:43,600 INFO L273 TraceCheckUtils]: 9: Hoare triple {19195#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19196#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:43,600 INFO L273 TraceCheckUtils]: 10: Hoare triple {19196#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19196#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:43,601 INFO L273 TraceCheckUtils]: 11: Hoare triple {19196#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19197#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:43,601 INFO L273 TraceCheckUtils]: 12: Hoare triple {19197#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19197#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:43,602 INFO L273 TraceCheckUtils]: 13: Hoare triple {19197#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19198#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:43,603 INFO L273 TraceCheckUtils]: 14: Hoare triple {19198#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19198#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:43,603 INFO L273 TraceCheckUtils]: 15: Hoare triple {19198#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19199#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:43,604 INFO L273 TraceCheckUtils]: 16: Hoare triple {19199#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19199#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:43,605 INFO L273 TraceCheckUtils]: 17: Hoare triple {19199#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19200#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:43,605 INFO L273 TraceCheckUtils]: 18: Hoare triple {19200#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19200#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:43,606 INFO L273 TraceCheckUtils]: 19: Hoare triple {19200#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19201#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:43,606 INFO L273 TraceCheckUtils]: 20: Hoare triple {19201#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19201#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:43,607 INFO L273 TraceCheckUtils]: 21: Hoare triple {19201#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19202#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:43,607 INFO L273 TraceCheckUtils]: 22: Hoare triple {19202#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19202#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:43,608 INFO L273 TraceCheckUtils]: 23: Hoare triple {19202#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19203#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:43,609 INFO L273 TraceCheckUtils]: 24: Hoare triple {19203#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19203#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:43,609 INFO L273 TraceCheckUtils]: 25: Hoare triple {19203#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19204#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:43,610 INFO L273 TraceCheckUtils]: 26: Hoare triple {19204#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19204#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:43,611 INFO L273 TraceCheckUtils]: 27: Hoare triple {19204#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19205#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:43,611 INFO L273 TraceCheckUtils]: 28: Hoare triple {19205#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19205#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:43,612 INFO L273 TraceCheckUtils]: 29: Hoare triple {19205#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19206#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:43,612 INFO L273 TraceCheckUtils]: 30: Hoare triple {19206#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19206#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:43,613 INFO L273 TraceCheckUtils]: 31: Hoare triple {19206#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19207#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:43,614 INFO L273 TraceCheckUtils]: 32: Hoare triple {19207#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19207#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:43,614 INFO L273 TraceCheckUtils]: 33: Hoare triple {19207#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19208#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:43,615 INFO L273 TraceCheckUtils]: 34: Hoare triple {19208#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19208#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:43,615 INFO L273 TraceCheckUtils]: 35: Hoare triple {19208#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19209#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:43,616 INFO L273 TraceCheckUtils]: 36: Hoare triple {19209#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19209#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:43,617 INFO L273 TraceCheckUtils]: 37: Hoare triple {19209#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19210#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:43,617 INFO L273 TraceCheckUtils]: 38: Hoare triple {19210#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19210#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:43,618 INFO L273 TraceCheckUtils]: 39: Hoare triple {19210#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19211#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:43,618 INFO L273 TraceCheckUtils]: 40: Hoare triple {19211#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19211#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:43,619 INFO L273 TraceCheckUtils]: 41: Hoare triple {19211#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19212#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:43,620 INFO L273 TraceCheckUtils]: 42: Hoare triple {19212#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19212#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:43,620 INFO L273 TraceCheckUtils]: 43: Hoare triple {19212#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19213#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:43,621 INFO L273 TraceCheckUtils]: 44: Hoare triple {19213#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19213#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:43,622 INFO L273 TraceCheckUtils]: 45: Hoare triple {19213#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19214#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:43,622 INFO L273 TraceCheckUtils]: 46: Hoare triple {19214#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19214#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:43,623 INFO L273 TraceCheckUtils]: 47: Hoare triple {19214#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19215#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:43,623 INFO L273 TraceCheckUtils]: 48: Hoare triple {19215#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19215#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:43,624 INFO L273 TraceCheckUtils]: 49: Hoare triple {19215#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19216#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:43,624 INFO L273 TraceCheckUtils]: 50: Hoare triple {19216#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19216#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:43,625 INFO L273 TraceCheckUtils]: 51: Hoare triple {19216#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19217#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:43,626 INFO L273 TraceCheckUtils]: 52: Hoare triple {19217#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19217#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:43,626 INFO L273 TraceCheckUtils]: 53: Hoare triple {19217#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19218#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:43,627 INFO L273 TraceCheckUtils]: 54: Hoare triple {19218#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19218#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:43,627 INFO L273 TraceCheckUtils]: 55: Hoare triple {19218#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19219#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:43,628 INFO L273 TraceCheckUtils]: 56: Hoare triple {19219#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19219#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:43,629 INFO L273 TraceCheckUtils]: 57: Hoare triple {19219#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19220#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:43,629 INFO L273 TraceCheckUtils]: 58: Hoare triple {19220#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19220#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:43,630 INFO L273 TraceCheckUtils]: 59: Hoare triple {19220#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19221#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:43,630 INFO L273 TraceCheckUtils]: 60: Hoare triple {19221#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19221#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:43,631 INFO L273 TraceCheckUtils]: 61: Hoare triple {19221#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19222#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:43,631 INFO L273 TraceCheckUtils]: 62: Hoare triple {19222#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19222#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:43,632 INFO L273 TraceCheckUtils]: 63: Hoare triple {19222#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19223#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:43,632 INFO L273 TraceCheckUtils]: 64: Hoare triple {19223#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19223#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:43,633 INFO L273 TraceCheckUtils]: 65: Hoare triple {19223#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19224#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:43,634 INFO L273 TraceCheckUtils]: 66: Hoare triple {19224#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19224#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:43,634 INFO L273 TraceCheckUtils]: 67: Hoare triple {19224#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19225#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:43,635 INFO L273 TraceCheckUtils]: 68: Hoare triple {19225#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19225#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:43,635 INFO L273 TraceCheckUtils]: 69: Hoare triple {19225#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19226#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:43,636 INFO L273 TraceCheckUtils]: 70: Hoare triple {19226#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19226#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:43,637 INFO L273 TraceCheckUtils]: 71: Hoare triple {19226#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19227#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:43,637 INFO L273 TraceCheckUtils]: 72: Hoare triple {19227#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19227#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:43,638 INFO L273 TraceCheckUtils]: 73: Hoare triple {19227#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19228#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:43,638 INFO L273 TraceCheckUtils]: 74: Hoare triple {19228#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19228#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:43,639 INFO L273 TraceCheckUtils]: 75: Hoare triple {19228#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19229#(<= main_~i~0 35)} is VALID [2018-11-23 13:06:43,640 INFO L273 TraceCheckUtils]: 76: Hoare triple {19229#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19229#(<= main_~i~0 35)} is VALID [2018-11-23 13:06:43,640 INFO L273 TraceCheckUtils]: 77: Hoare triple {19229#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19230#(<= main_~i~0 36)} is VALID [2018-11-23 13:06:43,641 INFO L273 TraceCheckUtils]: 78: Hoare triple {19230#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19230#(<= main_~i~0 36)} is VALID [2018-11-23 13:06:43,641 INFO L273 TraceCheckUtils]: 79: Hoare triple {19230#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19231#(<= main_~i~0 37)} is VALID [2018-11-23 13:06:43,642 INFO L273 TraceCheckUtils]: 80: Hoare triple {19231#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19231#(<= main_~i~0 37)} is VALID [2018-11-23 13:06:43,643 INFO L273 TraceCheckUtils]: 81: Hoare triple {19231#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19232#(<= main_~i~0 38)} is VALID [2018-11-23 13:06:43,643 INFO L273 TraceCheckUtils]: 82: Hoare triple {19232#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19232#(<= main_~i~0 38)} is VALID [2018-11-23 13:06:43,644 INFO L273 TraceCheckUtils]: 83: Hoare triple {19232#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19233#(<= main_~i~0 39)} is VALID [2018-11-23 13:06:43,644 INFO L273 TraceCheckUtils]: 84: Hoare triple {19233#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19233#(<= main_~i~0 39)} is VALID [2018-11-23 13:06:43,645 INFO L273 TraceCheckUtils]: 85: Hoare triple {19233#(<= main_~i~0 39)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19234#(<= main_~i~0 40)} is VALID [2018-11-23 13:06:43,645 INFO L273 TraceCheckUtils]: 86: Hoare triple {19234#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19234#(<= main_~i~0 40)} is VALID [2018-11-23 13:06:43,646 INFO L273 TraceCheckUtils]: 87: Hoare triple {19234#(<= main_~i~0 40)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19235#(<= main_~i~0 41)} is VALID [2018-11-23 13:06:43,647 INFO L273 TraceCheckUtils]: 88: Hoare triple {19235#(<= main_~i~0 41)} assume !(~i~0 < 1024); {19193#false} is VALID [2018-11-23 13:06:43,647 INFO L273 TraceCheckUtils]: 89: Hoare triple {19193#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {19193#false} is VALID [2018-11-23 13:06:43,647 INFO L256 TraceCheckUtils]: 90: Hoare triple {19193#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {19193#false} is VALID [2018-11-23 13:06:43,647 INFO L273 TraceCheckUtils]: 91: Hoare triple {19193#false} ~cond := #in~cond; {19193#false} is VALID [2018-11-23 13:06:43,648 INFO L273 TraceCheckUtils]: 92: Hoare triple {19193#false} assume 0 == ~cond; {19193#false} is VALID [2018-11-23 13:06:43,648 INFO L273 TraceCheckUtils]: 93: Hoare triple {19193#false} assume !false; {19193#false} is VALID [2018-11-23 13:06:43,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:43,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:43,656 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:43,664 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:06:48,086 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-11-23 13:06:48,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:48,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:48,577 INFO L256 TraceCheckUtils]: 0: Hoare triple {19192#true} call ULTIMATE.init(); {19192#true} is VALID [2018-11-23 13:06:48,577 INFO L273 TraceCheckUtils]: 1: Hoare triple {19192#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19192#true} is VALID [2018-11-23 13:06:48,577 INFO L273 TraceCheckUtils]: 2: Hoare triple {19192#true} assume true; {19192#true} is VALID [2018-11-23 13:06:48,577 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19192#true} {19192#true} #35#return; {19192#true} is VALID [2018-11-23 13:06:48,577 INFO L256 TraceCheckUtils]: 4: Hoare triple {19192#true} call #t~ret2 := main(); {19192#true} is VALID [2018-11-23 13:06:48,578 INFO L273 TraceCheckUtils]: 5: Hoare triple {19192#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {19254#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:48,579 INFO L273 TraceCheckUtils]: 6: Hoare triple {19254#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19254#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:48,579 INFO L273 TraceCheckUtils]: 7: Hoare triple {19254#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19195#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:48,579 INFO L273 TraceCheckUtils]: 8: Hoare triple {19195#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19195#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:48,580 INFO L273 TraceCheckUtils]: 9: Hoare triple {19195#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19196#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:48,580 INFO L273 TraceCheckUtils]: 10: Hoare triple {19196#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19196#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:48,580 INFO L273 TraceCheckUtils]: 11: Hoare triple {19196#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19197#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:48,581 INFO L273 TraceCheckUtils]: 12: Hoare triple {19197#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19197#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:48,581 INFO L273 TraceCheckUtils]: 13: Hoare triple {19197#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19198#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:48,582 INFO L273 TraceCheckUtils]: 14: Hoare triple {19198#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19198#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:48,582 INFO L273 TraceCheckUtils]: 15: Hoare triple {19198#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19199#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:48,583 INFO L273 TraceCheckUtils]: 16: Hoare triple {19199#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19199#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:48,584 INFO L273 TraceCheckUtils]: 17: Hoare triple {19199#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19200#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:48,584 INFO L273 TraceCheckUtils]: 18: Hoare triple {19200#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19200#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:48,585 INFO L273 TraceCheckUtils]: 19: Hoare triple {19200#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19201#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:48,585 INFO L273 TraceCheckUtils]: 20: Hoare triple {19201#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19201#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:48,586 INFO L273 TraceCheckUtils]: 21: Hoare triple {19201#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19202#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:48,586 INFO L273 TraceCheckUtils]: 22: Hoare triple {19202#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19202#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:48,587 INFO L273 TraceCheckUtils]: 23: Hoare triple {19202#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19203#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:48,588 INFO L273 TraceCheckUtils]: 24: Hoare triple {19203#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19203#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:48,588 INFO L273 TraceCheckUtils]: 25: Hoare triple {19203#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19204#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:48,589 INFO L273 TraceCheckUtils]: 26: Hoare triple {19204#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19204#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:48,590 INFO L273 TraceCheckUtils]: 27: Hoare triple {19204#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19205#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:48,590 INFO L273 TraceCheckUtils]: 28: Hoare triple {19205#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19205#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:48,591 INFO L273 TraceCheckUtils]: 29: Hoare triple {19205#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19206#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:48,591 INFO L273 TraceCheckUtils]: 30: Hoare triple {19206#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19206#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:48,592 INFO L273 TraceCheckUtils]: 31: Hoare triple {19206#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19207#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:48,593 INFO L273 TraceCheckUtils]: 32: Hoare triple {19207#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19207#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:48,593 INFO L273 TraceCheckUtils]: 33: Hoare triple {19207#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19208#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:48,594 INFO L273 TraceCheckUtils]: 34: Hoare triple {19208#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19208#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:48,595 INFO L273 TraceCheckUtils]: 35: Hoare triple {19208#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19209#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:48,595 INFO L273 TraceCheckUtils]: 36: Hoare triple {19209#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19209#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:48,596 INFO L273 TraceCheckUtils]: 37: Hoare triple {19209#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19210#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:48,596 INFO L273 TraceCheckUtils]: 38: Hoare triple {19210#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19210#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:48,597 INFO L273 TraceCheckUtils]: 39: Hoare triple {19210#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19211#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:48,597 INFO L273 TraceCheckUtils]: 40: Hoare triple {19211#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19211#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:48,598 INFO L273 TraceCheckUtils]: 41: Hoare triple {19211#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19212#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:48,599 INFO L273 TraceCheckUtils]: 42: Hoare triple {19212#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19212#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:48,599 INFO L273 TraceCheckUtils]: 43: Hoare triple {19212#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19213#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:48,600 INFO L273 TraceCheckUtils]: 44: Hoare triple {19213#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19213#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:48,601 INFO L273 TraceCheckUtils]: 45: Hoare triple {19213#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19214#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:48,601 INFO L273 TraceCheckUtils]: 46: Hoare triple {19214#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19214#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:48,602 INFO L273 TraceCheckUtils]: 47: Hoare triple {19214#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19215#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:48,602 INFO L273 TraceCheckUtils]: 48: Hoare triple {19215#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19215#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:48,603 INFO L273 TraceCheckUtils]: 49: Hoare triple {19215#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19216#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:48,604 INFO L273 TraceCheckUtils]: 50: Hoare triple {19216#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19216#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:48,604 INFO L273 TraceCheckUtils]: 51: Hoare triple {19216#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19217#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:48,605 INFO L273 TraceCheckUtils]: 52: Hoare triple {19217#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19217#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:48,606 INFO L273 TraceCheckUtils]: 53: Hoare triple {19217#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19218#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:48,606 INFO L273 TraceCheckUtils]: 54: Hoare triple {19218#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19218#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:48,607 INFO L273 TraceCheckUtils]: 55: Hoare triple {19218#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19219#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:48,607 INFO L273 TraceCheckUtils]: 56: Hoare triple {19219#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19219#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:48,608 INFO L273 TraceCheckUtils]: 57: Hoare triple {19219#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19220#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:48,608 INFO L273 TraceCheckUtils]: 58: Hoare triple {19220#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19220#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:48,609 INFO L273 TraceCheckUtils]: 59: Hoare triple {19220#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19221#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:48,610 INFO L273 TraceCheckUtils]: 60: Hoare triple {19221#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19221#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:48,610 INFO L273 TraceCheckUtils]: 61: Hoare triple {19221#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19222#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:48,611 INFO L273 TraceCheckUtils]: 62: Hoare triple {19222#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19222#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:48,612 INFO L273 TraceCheckUtils]: 63: Hoare triple {19222#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19223#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:48,612 INFO L273 TraceCheckUtils]: 64: Hoare triple {19223#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19223#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:48,613 INFO L273 TraceCheckUtils]: 65: Hoare triple {19223#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19224#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:48,613 INFO L273 TraceCheckUtils]: 66: Hoare triple {19224#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19224#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:48,614 INFO L273 TraceCheckUtils]: 67: Hoare triple {19224#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19225#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:48,615 INFO L273 TraceCheckUtils]: 68: Hoare triple {19225#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19225#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:48,615 INFO L273 TraceCheckUtils]: 69: Hoare triple {19225#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19226#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:48,616 INFO L273 TraceCheckUtils]: 70: Hoare triple {19226#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19226#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:48,617 INFO L273 TraceCheckUtils]: 71: Hoare triple {19226#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19227#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:48,617 INFO L273 TraceCheckUtils]: 72: Hoare triple {19227#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19227#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:48,618 INFO L273 TraceCheckUtils]: 73: Hoare triple {19227#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19228#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:48,618 INFO L273 TraceCheckUtils]: 74: Hoare triple {19228#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19228#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:48,619 INFO L273 TraceCheckUtils]: 75: Hoare triple {19228#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19229#(<= main_~i~0 35)} is VALID [2018-11-23 13:06:48,619 INFO L273 TraceCheckUtils]: 76: Hoare triple {19229#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19229#(<= main_~i~0 35)} is VALID [2018-11-23 13:06:48,620 INFO L273 TraceCheckUtils]: 77: Hoare triple {19229#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19230#(<= main_~i~0 36)} is VALID [2018-11-23 13:06:48,621 INFO L273 TraceCheckUtils]: 78: Hoare triple {19230#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19230#(<= main_~i~0 36)} is VALID [2018-11-23 13:06:48,621 INFO L273 TraceCheckUtils]: 79: Hoare triple {19230#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19231#(<= main_~i~0 37)} is VALID [2018-11-23 13:06:48,622 INFO L273 TraceCheckUtils]: 80: Hoare triple {19231#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19231#(<= main_~i~0 37)} is VALID [2018-11-23 13:06:48,623 INFO L273 TraceCheckUtils]: 81: Hoare triple {19231#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19232#(<= main_~i~0 38)} is VALID [2018-11-23 13:06:48,623 INFO L273 TraceCheckUtils]: 82: Hoare triple {19232#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19232#(<= main_~i~0 38)} is VALID [2018-11-23 13:06:48,624 INFO L273 TraceCheckUtils]: 83: Hoare triple {19232#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19233#(<= main_~i~0 39)} is VALID [2018-11-23 13:06:48,624 INFO L273 TraceCheckUtils]: 84: Hoare triple {19233#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19233#(<= main_~i~0 39)} is VALID [2018-11-23 13:06:48,625 INFO L273 TraceCheckUtils]: 85: Hoare triple {19233#(<= main_~i~0 39)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19234#(<= main_~i~0 40)} is VALID [2018-11-23 13:06:48,626 INFO L273 TraceCheckUtils]: 86: Hoare triple {19234#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19234#(<= main_~i~0 40)} is VALID [2018-11-23 13:06:48,626 INFO L273 TraceCheckUtils]: 87: Hoare triple {19234#(<= main_~i~0 40)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19235#(<= main_~i~0 41)} is VALID [2018-11-23 13:06:48,627 INFO L273 TraceCheckUtils]: 88: Hoare triple {19235#(<= main_~i~0 41)} assume !(~i~0 < 1024); {19193#false} is VALID [2018-11-23 13:06:48,627 INFO L273 TraceCheckUtils]: 89: Hoare triple {19193#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {19193#false} is VALID [2018-11-23 13:06:48,627 INFO L256 TraceCheckUtils]: 90: Hoare triple {19193#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {19193#false} is VALID [2018-11-23 13:06:48,628 INFO L273 TraceCheckUtils]: 91: Hoare triple {19193#false} ~cond := #in~cond; {19193#false} is VALID [2018-11-23 13:06:48,628 INFO L273 TraceCheckUtils]: 92: Hoare triple {19193#false} assume 0 == ~cond; {19193#false} is VALID [2018-11-23 13:06:48,628 INFO L273 TraceCheckUtils]: 93: Hoare triple {19193#false} assume !false; {19193#false} is VALID [2018-11-23 13:06:48,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:48,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:48,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2018-11-23 13:06:48,658 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 94 [2018-11-23 13:06:48,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:48,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states. [2018-11-23 13:06:48,747 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:48,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-23 13:06:48,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-23 13:06:48,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 13:06:48,749 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 45 states. [2018-11-23 13:06:49,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:49,226 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-11-23 13:06:49,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-23 13:06:49,227 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 94 [2018-11-23 13:06:49,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:49,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 13:06:49,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 104 transitions. [2018-11-23 13:06:49,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 13:06:49,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 104 transitions. [2018-11-23 13:06:49,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 104 transitions. [2018-11-23 13:06:49,329 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:49,331 INFO L225 Difference]: With dead ends: 104 [2018-11-23 13:06:49,331 INFO L226 Difference]: Without dead ends: 98 [2018-11-23 13:06:49,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 13:06:49,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-23 13:06:49,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-11-23 13:06:49,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:49,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 97 states. [2018-11-23 13:06:49,385 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 97 states. [2018-11-23 13:06:49,385 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 97 states. [2018-11-23 13:06:49,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:49,387 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-11-23 13:06:49,387 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-11-23 13:06:49,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:49,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:49,388 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 98 states. [2018-11-23 13:06:49,388 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 98 states. [2018-11-23 13:06:49,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:49,390 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-11-23 13:06:49,390 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-11-23 13:06:49,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:49,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:49,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:49,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:49,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 13:06:49,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-11-23 13:06:49,392 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2018-11-23 13:06:49,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:49,392 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-11-23 13:06:49,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-23 13:06:49,392 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-11-23 13:06:49,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 13:06:49,393 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:49,393 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:49,394 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:49,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:49,394 INFO L82 PathProgramCache]: Analyzing trace with hash -915115471, now seen corresponding path program 42 times [2018-11-23 13:06:49,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:49,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:49,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:49,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:49,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:50,300 INFO L256 TraceCheckUtils]: 0: Hoare triple {20015#true} call ULTIMATE.init(); {20015#true} is VALID [2018-11-23 13:06:50,301 INFO L273 TraceCheckUtils]: 1: Hoare triple {20015#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20015#true} is VALID [2018-11-23 13:06:50,301 INFO L273 TraceCheckUtils]: 2: Hoare triple {20015#true} assume true; {20015#true} is VALID [2018-11-23 13:06:50,301 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20015#true} {20015#true} #35#return; {20015#true} is VALID [2018-11-23 13:06:50,301 INFO L256 TraceCheckUtils]: 4: Hoare triple {20015#true} call #t~ret2 := main(); {20015#true} is VALID [2018-11-23 13:06:50,302 INFO L273 TraceCheckUtils]: 5: Hoare triple {20015#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {20017#(= main_~i~0 0)} is VALID [2018-11-23 13:06:50,302 INFO L273 TraceCheckUtils]: 6: Hoare triple {20017#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20017#(= main_~i~0 0)} is VALID [2018-11-23 13:06:50,303 INFO L273 TraceCheckUtils]: 7: Hoare triple {20017#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20018#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:50,303 INFO L273 TraceCheckUtils]: 8: Hoare triple {20018#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20018#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:50,304 INFO L273 TraceCheckUtils]: 9: Hoare triple {20018#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20019#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:50,304 INFO L273 TraceCheckUtils]: 10: Hoare triple {20019#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20019#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:50,304 INFO L273 TraceCheckUtils]: 11: Hoare triple {20019#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20020#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:50,305 INFO L273 TraceCheckUtils]: 12: Hoare triple {20020#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20020#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:50,305 INFO L273 TraceCheckUtils]: 13: Hoare triple {20020#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20021#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:50,306 INFO L273 TraceCheckUtils]: 14: Hoare triple {20021#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20021#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:50,307 INFO L273 TraceCheckUtils]: 15: Hoare triple {20021#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20022#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:50,307 INFO L273 TraceCheckUtils]: 16: Hoare triple {20022#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20022#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:50,308 INFO L273 TraceCheckUtils]: 17: Hoare triple {20022#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20023#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:50,308 INFO L273 TraceCheckUtils]: 18: Hoare triple {20023#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20023#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:50,309 INFO L273 TraceCheckUtils]: 19: Hoare triple {20023#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20024#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:50,309 INFO L273 TraceCheckUtils]: 20: Hoare triple {20024#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20024#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:50,310 INFO L273 TraceCheckUtils]: 21: Hoare triple {20024#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20025#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:50,311 INFO L273 TraceCheckUtils]: 22: Hoare triple {20025#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20025#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:50,311 INFO L273 TraceCheckUtils]: 23: Hoare triple {20025#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20026#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:50,312 INFO L273 TraceCheckUtils]: 24: Hoare triple {20026#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20026#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:50,313 INFO L273 TraceCheckUtils]: 25: Hoare triple {20026#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20027#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:50,313 INFO L273 TraceCheckUtils]: 26: Hoare triple {20027#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20027#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:50,314 INFO L273 TraceCheckUtils]: 27: Hoare triple {20027#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20028#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:50,314 INFO L273 TraceCheckUtils]: 28: Hoare triple {20028#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20028#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:50,315 INFO L273 TraceCheckUtils]: 29: Hoare triple {20028#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20029#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:50,316 INFO L273 TraceCheckUtils]: 30: Hoare triple {20029#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20029#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:50,316 INFO L273 TraceCheckUtils]: 31: Hoare triple {20029#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20030#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:50,317 INFO L273 TraceCheckUtils]: 32: Hoare triple {20030#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20030#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:50,318 INFO L273 TraceCheckUtils]: 33: Hoare triple {20030#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20031#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:50,318 INFO L273 TraceCheckUtils]: 34: Hoare triple {20031#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20031#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:50,319 INFO L273 TraceCheckUtils]: 35: Hoare triple {20031#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20032#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:50,319 INFO L273 TraceCheckUtils]: 36: Hoare triple {20032#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20032#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:50,320 INFO L273 TraceCheckUtils]: 37: Hoare triple {20032#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20033#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:50,321 INFO L273 TraceCheckUtils]: 38: Hoare triple {20033#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20033#(<= main_~i~0 16)} is VALID [2018-11-23 13:06:50,321 INFO L273 TraceCheckUtils]: 39: Hoare triple {20033#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20034#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:50,322 INFO L273 TraceCheckUtils]: 40: Hoare triple {20034#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20034#(<= main_~i~0 17)} is VALID [2018-11-23 13:06:50,322 INFO L273 TraceCheckUtils]: 41: Hoare triple {20034#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20035#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:50,323 INFO L273 TraceCheckUtils]: 42: Hoare triple {20035#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20035#(<= main_~i~0 18)} is VALID [2018-11-23 13:06:50,324 INFO L273 TraceCheckUtils]: 43: Hoare triple {20035#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20036#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:50,324 INFO L273 TraceCheckUtils]: 44: Hoare triple {20036#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20036#(<= main_~i~0 19)} is VALID [2018-11-23 13:06:50,325 INFO L273 TraceCheckUtils]: 45: Hoare triple {20036#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20037#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:50,325 INFO L273 TraceCheckUtils]: 46: Hoare triple {20037#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20037#(<= main_~i~0 20)} is VALID [2018-11-23 13:06:50,326 INFO L273 TraceCheckUtils]: 47: Hoare triple {20037#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20038#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:50,327 INFO L273 TraceCheckUtils]: 48: Hoare triple {20038#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20038#(<= main_~i~0 21)} is VALID [2018-11-23 13:06:50,327 INFO L273 TraceCheckUtils]: 49: Hoare triple {20038#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20039#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:50,328 INFO L273 TraceCheckUtils]: 50: Hoare triple {20039#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20039#(<= main_~i~0 22)} is VALID [2018-11-23 13:06:50,329 INFO L273 TraceCheckUtils]: 51: Hoare triple {20039#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20040#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:50,329 INFO L273 TraceCheckUtils]: 52: Hoare triple {20040#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20040#(<= main_~i~0 23)} is VALID [2018-11-23 13:06:50,330 INFO L273 TraceCheckUtils]: 53: Hoare triple {20040#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20041#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:50,330 INFO L273 TraceCheckUtils]: 54: Hoare triple {20041#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20041#(<= main_~i~0 24)} is VALID [2018-11-23 13:06:50,331 INFO L273 TraceCheckUtils]: 55: Hoare triple {20041#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20042#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:50,332 INFO L273 TraceCheckUtils]: 56: Hoare triple {20042#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20042#(<= main_~i~0 25)} is VALID [2018-11-23 13:06:50,332 INFO L273 TraceCheckUtils]: 57: Hoare triple {20042#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20043#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:50,333 INFO L273 TraceCheckUtils]: 58: Hoare triple {20043#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20043#(<= main_~i~0 26)} is VALID [2018-11-23 13:06:50,333 INFO L273 TraceCheckUtils]: 59: Hoare triple {20043#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20044#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:50,334 INFO L273 TraceCheckUtils]: 60: Hoare triple {20044#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20044#(<= main_~i~0 27)} is VALID [2018-11-23 13:06:50,335 INFO L273 TraceCheckUtils]: 61: Hoare triple {20044#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20045#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:50,335 INFO L273 TraceCheckUtils]: 62: Hoare triple {20045#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20045#(<= main_~i~0 28)} is VALID [2018-11-23 13:06:50,336 INFO L273 TraceCheckUtils]: 63: Hoare triple {20045#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20046#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:50,336 INFO L273 TraceCheckUtils]: 64: Hoare triple {20046#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20046#(<= main_~i~0 29)} is VALID [2018-11-23 13:06:50,337 INFO L273 TraceCheckUtils]: 65: Hoare triple {20046#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20047#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:50,338 INFO L273 TraceCheckUtils]: 66: Hoare triple {20047#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20047#(<= main_~i~0 30)} is VALID [2018-11-23 13:06:50,338 INFO L273 TraceCheckUtils]: 67: Hoare triple {20047#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20048#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:50,339 INFO L273 TraceCheckUtils]: 68: Hoare triple {20048#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20048#(<= main_~i~0 31)} is VALID [2018-11-23 13:06:50,340 INFO L273 TraceCheckUtils]: 69: Hoare triple {20048#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20049#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:50,340 INFO L273 TraceCheckUtils]: 70: Hoare triple {20049#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20049#(<= main_~i~0 32)} is VALID [2018-11-23 13:06:50,341 INFO L273 TraceCheckUtils]: 71: Hoare triple {20049#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20050#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:50,341 INFO L273 TraceCheckUtils]: 72: Hoare triple {20050#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20050#(<= main_~i~0 33)} is VALID [2018-11-23 13:06:50,342 INFO L273 TraceCheckUtils]: 73: Hoare triple {20050#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20051#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:50,343 INFO L273 TraceCheckUtils]: 74: Hoare triple {20051#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20051#(<= main_~i~0 34)} is VALID [2018-11-23 13:06:50,343 INFO L273 TraceCheckUtils]: 75: Hoare triple {20051#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20052#(<= main_~i~0 35)} is VALID [2018-11-23 13:06:50,344 INFO L273 TraceCheckUtils]: 76: Hoare triple {20052#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20052#(<= main_~i~0 35)} is VALID [2018-11-23 13:06:50,344 INFO L273 TraceCheckUtils]: 77: Hoare triple {20052#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20053#(<= main_~i~0 36)} is VALID [2018-11-23 13:06:50,345 INFO L273 TraceCheckUtils]: 78: Hoare triple {20053#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20053#(<= main_~i~0 36)} is VALID [2018-11-23 13:06:50,346 INFO L273 TraceCheckUtils]: 79: Hoare triple {20053#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20054#(<= main_~i~0 37)} is VALID [2018-11-23 13:06:50,346 INFO L273 TraceCheckUtils]: 80: Hoare triple {20054#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20054#(<= main_~i~0 37)} is VALID [2018-11-23 13:06:50,347 INFO L273 TraceCheckUtils]: 81: Hoare triple {20054#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20055#(<= main_~i~0 38)} is VALID [2018-11-23 13:06:50,347 INFO L273 TraceCheckUtils]: 82: Hoare triple {20055#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20055#(<= main_~i~0 38)} is VALID [2018-11-23 13:06:50,348 INFO L273 TraceCheckUtils]: 83: Hoare triple {20055#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20056#(<= main_~i~0 39)} is VALID [2018-11-23 13:06:50,349 INFO L273 TraceCheckUtils]: 84: Hoare triple {20056#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20056#(<= main_~i~0 39)} is VALID [2018-11-23 13:06:50,349 INFO L273 TraceCheckUtils]: 85: Hoare triple {20056#(<= main_~i~0 39)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20057#(<= main_~i~0 40)} is VALID [2018-11-23 13:06:50,350 INFO L273 TraceCheckUtils]: 86: Hoare triple {20057#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20057#(<= main_~i~0 40)} is VALID [2018-11-23 13:06:50,351 INFO L273 TraceCheckUtils]: 87: Hoare triple {20057#(<= main_~i~0 40)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20058#(<= main_~i~0 41)} is VALID [2018-11-23 13:06:50,351 INFO L273 TraceCheckUtils]: 88: Hoare triple {20058#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20058#(<= main_~i~0 41)} is VALID [2018-11-23 13:06:50,352 INFO L273 TraceCheckUtils]: 89: Hoare triple {20058#(<= main_~i~0 41)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20059#(<= main_~i~0 42)} is VALID [2018-11-23 13:06:50,352 INFO L273 TraceCheckUtils]: 90: Hoare triple {20059#(<= main_~i~0 42)} assume !(~i~0 < 1024); {20016#false} is VALID [2018-11-23 13:06:50,353 INFO L273 TraceCheckUtils]: 91: Hoare triple {20016#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {20016#false} is VALID [2018-11-23 13:06:50,353 INFO L256 TraceCheckUtils]: 92: Hoare triple {20016#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {20016#false} is VALID [2018-11-23 13:06:50,353 INFO L273 TraceCheckUtils]: 93: Hoare triple {20016#false} ~cond := #in~cond; {20016#false} is VALID [2018-11-23 13:06:50,353 INFO L273 TraceCheckUtils]: 94: Hoare triple {20016#false} assume 0 == ~cond; {20016#false} is VALID [2018-11-23 13:06:50,353 INFO L273 TraceCheckUtils]: 95: Hoare triple {20016#false} assume !false; {20016#false} is VALID [2018-11-23 13:06:50,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:50,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:50,361 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:50,370 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:07:08,602 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-11-23 13:07:08,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:08,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:09,090 INFO L256 TraceCheckUtils]: 0: Hoare triple {20015#true} call ULTIMATE.init(); {20015#true} is VALID [2018-11-23 13:07:09,090 INFO L273 TraceCheckUtils]: 1: Hoare triple {20015#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20015#true} is VALID [2018-11-23 13:07:09,090 INFO L273 TraceCheckUtils]: 2: Hoare triple {20015#true} assume true; {20015#true} is VALID [2018-11-23 13:07:09,091 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20015#true} {20015#true} #35#return; {20015#true} is VALID [2018-11-23 13:07:09,091 INFO L256 TraceCheckUtils]: 4: Hoare triple {20015#true} call #t~ret2 := main(); {20015#true} is VALID [2018-11-23 13:07:09,092 INFO L273 TraceCheckUtils]: 5: Hoare triple {20015#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {20078#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:09,092 INFO L273 TraceCheckUtils]: 6: Hoare triple {20078#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20078#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:09,093 INFO L273 TraceCheckUtils]: 7: Hoare triple {20078#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20018#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:09,093 INFO L273 TraceCheckUtils]: 8: Hoare triple {20018#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20018#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:09,094 INFO L273 TraceCheckUtils]: 9: Hoare triple {20018#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20019#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:09,094 INFO L273 TraceCheckUtils]: 10: Hoare triple {20019#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20019#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:09,095 INFO L273 TraceCheckUtils]: 11: Hoare triple {20019#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20020#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:09,095 INFO L273 TraceCheckUtils]: 12: Hoare triple {20020#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20020#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:09,096 INFO L273 TraceCheckUtils]: 13: Hoare triple {20020#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20021#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:09,096 INFO L273 TraceCheckUtils]: 14: Hoare triple {20021#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20021#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:09,097 INFO L273 TraceCheckUtils]: 15: Hoare triple {20021#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20022#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:09,098 INFO L273 TraceCheckUtils]: 16: Hoare triple {20022#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20022#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:09,098 INFO L273 TraceCheckUtils]: 17: Hoare triple {20022#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20023#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:09,099 INFO L273 TraceCheckUtils]: 18: Hoare triple {20023#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20023#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:09,100 INFO L273 TraceCheckUtils]: 19: Hoare triple {20023#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20024#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:09,100 INFO L273 TraceCheckUtils]: 20: Hoare triple {20024#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20024#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:09,101 INFO L273 TraceCheckUtils]: 21: Hoare triple {20024#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20025#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:09,101 INFO L273 TraceCheckUtils]: 22: Hoare triple {20025#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20025#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:09,102 INFO L273 TraceCheckUtils]: 23: Hoare triple {20025#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20026#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:09,103 INFO L273 TraceCheckUtils]: 24: Hoare triple {20026#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20026#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:09,103 INFO L273 TraceCheckUtils]: 25: Hoare triple {20026#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20027#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:09,104 INFO L273 TraceCheckUtils]: 26: Hoare triple {20027#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20027#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:09,105 INFO L273 TraceCheckUtils]: 27: Hoare triple {20027#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20028#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:09,105 INFO L273 TraceCheckUtils]: 28: Hoare triple {20028#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20028#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:09,106 INFO L273 TraceCheckUtils]: 29: Hoare triple {20028#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20029#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:09,106 INFO L273 TraceCheckUtils]: 30: Hoare triple {20029#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20029#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:09,107 INFO L273 TraceCheckUtils]: 31: Hoare triple {20029#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20030#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:09,108 INFO L273 TraceCheckUtils]: 32: Hoare triple {20030#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20030#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:09,108 INFO L273 TraceCheckUtils]: 33: Hoare triple {20030#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20031#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:09,109 INFO L273 TraceCheckUtils]: 34: Hoare triple {20031#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20031#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:09,110 INFO L273 TraceCheckUtils]: 35: Hoare triple {20031#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20032#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:09,110 INFO L273 TraceCheckUtils]: 36: Hoare triple {20032#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20032#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:09,111 INFO L273 TraceCheckUtils]: 37: Hoare triple {20032#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20033#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:09,111 INFO L273 TraceCheckUtils]: 38: Hoare triple {20033#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20033#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:09,112 INFO L273 TraceCheckUtils]: 39: Hoare triple {20033#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20034#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:09,113 INFO L273 TraceCheckUtils]: 40: Hoare triple {20034#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20034#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:09,113 INFO L273 TraceCheckUtils]: 41: Hoare triple {20034#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20035#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:09,114 INFO L273 TraceCheckUtils]: 42: Hoare triple {20035#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20035#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:09,114 INFO L273 TraceCheckUtils]: 43: Hoare triple {20035#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20036#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:09,115 INFO L273 TraceCheckUtils]: 44: Hoare triple {20036#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20036#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:09,116 INFO L273 TraceCheckUtils]: 45: Hoare triple {20036#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20037#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:09,116 INFO L273 TraceCheckUtils]: 46: Hoare triple {20037#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20037#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:09,117 INFO L273 TraceCheckUtils]: 47: Hoare triple {20037#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20038#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:09,117 INFO L273 TraceCheckUtils]: 48: Hoare triple {20038#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20038#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:09,118 INFO L273 TraceCheckUtils]: 49: Hoare triple {20038#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20039#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:09,119 INFO L273 TraceCheckUtils]: 50: Hoare triple {20039#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20039#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:09,119 INFO L273 TraceCheckUtils]: 51: Hoare triple {20039#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20040#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:09,120 INFO L273 TraceCheckUtils]: 52: Hoare triple {20040#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20040#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:09,121 INFO L273 TraceCheckUtils]: 53: Hoare triple {20040#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20041#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:09,121 INFO L273 TraceCheckUtils]: 54: Hoare triple {20041#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20041#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:09,122 INFO L273 TraceCheckUtils]: 55: Hoare triple {20041#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20042#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:09,122 INFO L273 TraceCheckUtils]: 56: Hoare triple {20042#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20042#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:09,123 INFO L273 TraceCheckUtils]: 57: Hoare triple {20042#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20043#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:09,124 INFO L273 TraceCheckUtils]: 58: Hoare triple {20043#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20043#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:09,124 INFO L273 TraceCheckUtils]: 59: Hoare triple {20043#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20044#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:09,125 INFO L273 TraceCheckUtils]: 60: Hoare triple {20044#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20044#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:09,126 INFO L273 TraceCheckUtils]: 61: Hoare triple {20044#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20045#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:09,126 INFO L273 TraceCheckUtils]: 62: Hoare triple {20045#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20045#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:09,127 INFO L273 TraceCheckUtils]: 63: Hoare triple {20045#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20046#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:09,127 INFO L273 TraceCheckUtils]: 64: Hoare triple {20046#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20046#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:09,128 INFO L273 TraceCheckUtils]: 65: Hoare triple {20046#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20047#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:09,128 INFO L273 TraceCheckUtils]: 66: Hoare triple {20047#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20047#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:09,129 INFO L273 TraceCheckUtils]: 67: Hoare triple {20047#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20048#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:09,130 INFO L273 TraceCheckUtils]: 68: Hoare triple {20048#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20048#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:09,130 INFO L273 TraceCheckUtils]: 69: Hoare triple {20048#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20049#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:09,131 INFO L273 TraceCheckUtils]: 70: Hoare triple {20049#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20049#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:09,132 INFO L273 TraceCheckUtils]: 71: Hoare triple {20049#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20050#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:09,132 INFO L273 TraceCheckUtils]: 72: Hoare triple {20050#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20050#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:09,133 INFO L273 TraceCheckUtils]: 73: Hoare triple {20050#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20051#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:09,133 INFO L273 TraceCheckUtils]: 74: Hoare triple {20051#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20051#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:09,134 INFO L273 TraceCheckUtils]: 75: Hoare triple {20051#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20052#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:09,135 INFO L273 TraceCheckUtils]: 76: Hoare triple {20052#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20052#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:09,135 INFO L273 TraceCheckUtils]: 77: Hoare triple {20052#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20053#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:09,136 INFO L273 TraceCheckUtils]: 78: Hoare triple {20053#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20053#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:09,137 INFO L273 TraceCheckUtils]: 79: Hoare triple {20053#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20054#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:09,137 INFO L273 TraceCheckUtils]: 80: Hoare triple {20054#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20054#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:09,138 INFO L273 TraceCheckUtils]: 81: Hoare triple {20054#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20055#(<= main_~i~0 38)} is VALID [2018-11-23 13:07:09,138 INFO L273 TraceCheckUtils]: 82: Hoare triple {20055#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20055#(<= main_~i~0 38)} is VALID [2018-11-23 13:07:09,139 INFO L273 TraceCheckUtils]: 83: Hoare triple {20055#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20056#(<= main_~i~0 39)} is VALID [2018-11-23 13:07:09,140 INFO L273 TraceCheckUtils]: 84: Hoare triple {20056#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20056#(<= main_~i~0 39)} is VALID [2018-11-23 13:07:09,140 INFO L273 TraceCheckUtils]: 85: Hoare triple {20056#(<= main_~i~0 39)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20057#(<= main_~i~0 40)} is VALID [2018-11-23 13:07:09,141 INFO L273 TraceCheckUtils]: 86: Hoare triple {20057#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20057#(<= main_~i~0 40)} is VALID [2018-11-23 13:07:09,141 INFO L273 TraceCheckUtils]: 87: Hoare triple {20057#(<= main_~i~0 40)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20058#(<= main_~i~0 41)} is VALID [2018-11-23 13:07:09,142 INFO L273 TraceCheckUtils]: 88: Hoare triple {20058#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20058#(<= main_~i~0 41)} is VALID [2018-11-23 13:07:09,143 INFO L273 TraceCheckUtils]: 89: Hoare triple {20058#(<= main_~i~0 41)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20059#(<= main_~i~0 42)} is VALID [2018-11-23 13:07:09,143 INFO L273 TraceCheckUtils]: 90: Hoare triple {20059#(<= main_~i~0 42)} assume !(~i~0 < 1024); {20016#false} is VALID [2018-11-23 13:07:09,144 INFO L273 TraceCheckUtils]: 91: Hoare triple {20016#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {20016#false} is VALID [2018-11-23 13:07:09,144 INFO L256 TraceCheckUtils]: 92: Hoare triple {20016#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {20016#false} is VALID [2018-11-23 13:07:09,144 INFO L273 TraceCheckUtils]: 93: Hoare triple {20016#false} ~cond := #in~cond; {20016#false} is VALID [2018-11-23 13:07:09,144 INFO L273 TraceCheckUtils]: 94: Hoare triple {20016#false} assume 0 == ~cond; {20016#false} is VALID [2018-11-23 13:07:09,144 INFO L273 TraceCheckUtils]: 95: Hoare triple {20016#false} assume !false; {20016#false} is VALID [2018-11-23 13:07:09,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:09,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:09,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2018-11-23 13:07:09,176 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 96 [2018-11-23 13:07:09,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:09,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-23 13:07:09,267 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 13:07:09,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-23 13:07:09,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-23 13:07:09,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 13:07:09,269 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 46 states. [2018-11-23 13:07:09,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:09,707 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-11-23 13:07:09,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-23 13:07:09,707 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 96 [2018-11-23 13:07:09,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:09,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 13:07:09,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 106 transitions. [2018-11-23 13:07:09,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 13:07:09,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 106 transitions. [2018-11-23 13:07:09,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 106 transitions. [2018-11-23 13:07:09,811 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:09,812 INFO L225 Difference]: With dead ends: 106 [2018-11-23 13:07:09,813 INFO L226 Difference]: Without dead ends: 100 [2018-11-23 13:07:09,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 13:07:09,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-23 13:07:09,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-11-23 13:07:09,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:09,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand 99 states. [2018-11-23 13:07:09,866 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 99 states. [2018-11-23 13:07:09,866 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 99 states. [2018-11-23 13:07:09,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:09,868 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-11-23 13:07:09,868 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-11-23 13:07:09,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:09,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:09,869 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 100 states. [2018-11-23 13:07:09,869 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 100 states. [2018-11-23 13:07:09,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:09,870 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-11-23 13:07:09,870 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-11-23 13:07:09,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:09,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:09,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:09,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:09,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 13:07:09,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-11-23 13:07:09,873 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2018-11-23 13:07:09,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:09,873 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-11-23 13:07:09,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-23 13:07:09,873 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-11-23 13:07:09,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-23 13:07:09,874 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:09,874 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:09,874 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:09,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:09,874 INFO L82 PathProgramCache]: Analyzing trace with hash 201606355, now seen corresponding path program 43 times [2018-11-23 13:07:09,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:09,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:09,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:09,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:09,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:10,928 INFO L256 TraceCheckUtils]: 0: Hoare triple {20855#true} call ULTIMATE.init(); {20855#true} is VALID [2018-11-23 13:07:10,928 INFO L273 TraceCheckUtils]: 1: Hoare triple {20855#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20855#true} is VALID [2018-11-23 13:07:10,928 INFO L273 TraceCheckUtils]: 2: Hoare triple {20855#true} assume true; {20855#true} is VALID [2018-11-23 13:07:10,929 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20855#true} {20855#true} #35#return; {20855#true} is VALID [2018-11-23 13:07:10,929 INFO L256 TraceCheckUtils]: 4: Hoare triple {20855#true} call #t~ret2 := main(); {20855#true} is VALID [2018-11-23 13:07:10,929 INFO L273 TraceCheckUtils]: 5: Hoare triple {20855#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {20857#(= main_~i~0 0)} is VALID [2018-11-23 13:07:10,930 INFO L273 TraceCheckUtils]: 6: Hoare triple {20857#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20857#(= main_~i~0 0)} is VALID [2018-11-23 13:07:10,931 INFO L273 TraceCheckUtils]: 7: Hoare triple {20857#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20858#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:10,931 INFO L273 TraceCheckUtils]: 8: Hoare triple {20858#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20858#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:10,931 INFO L273 TraceCheckUtils]: 9: Hoare triple {20858#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20859#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:10,932 INFO L273 TraceCheckUtils]: 10: Hoare triple {20859#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20859#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:10,932 INFO L273 TraceCheckUtils]: 11: Hoare triple {20859#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20860#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:10,932 INFO L273 TraceCheckUtils]: 12: Hoare triple {20860#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20860#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:10,933 INFO L273 TraceCheckUtils]: 13: Hoare triple {20860#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20861#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:10,933 INFO L273 TraceCheckUtils]: 14: Hoare triple {20861#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20861#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:10,934 INFO L273 TraceCheckUtils]: 15: Hoare triple {20861#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20862#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:10,935 INFO L273 TraceCheckUtils]: 16: Hoare triple {20862#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20862#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:10,935 INFO L273 TraceCheckUtils]: 17: Hoare triple {20862#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20863#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:10,936 INFO L273 TraceCheckUtils]: 18: Hoare triple {20863#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20863#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:10,937 INFO L273 TraceCheckUtils]: 19: Hoare triple {20863#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20864#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:10,937 INFO L273 TraceCheckUtils]: 20: Hoare triple {20864#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20864#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:10,938 INFO L273 TraceCheckUtils]: 21: Hoare triple {20864#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20865#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:10,938 INFO L273 TraceCheckUtils]: 22: Hoare triple {20865#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20865#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:10,939 INFO L273 TraceCheckUtils]: 23: Hoare triple {20865#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20866#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:10,939 INFO L273 TraceCheckUtils]: 24: Hoare triple {20866#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20866#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:10,940 INFO L273 TraceCheckUtils]: 25: Hoare triple {20866#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20867#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:10,941 INFO L273 TraceCheckUtils]: 26: Hoare triple {20867#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20867#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:10,941 INFO L273 TraceCheckUtils]: 27: Hoare triple {20867#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20868#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:10,942 INFO L273 TraceCheckUtils]: 28: Hoare triple {20868#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20868#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:10,943 INFO L273 TraceCheckUtils]: 29: Hoare triple {20868#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20869#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:10,943 INFO L273 TraceCheckUtils]: 30: Hoare triple {20869#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20869#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:10,944 INFO L273 TraceCheckUtils]: 31: Hoare triple {20869#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20870#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:10,944 INFO L273 TraceCheckUtils]: 32: Hoare triple {20870#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20870#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:10,945 INFO L273 TraceCheckUtils]: 33: Hoare triple {20870#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20871#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:10,946 INFO L273 TraceCheckUtils]: 34: Hoare triple {20871#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20871#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:10,946 INFO L273 TraceCheckUtils]: 35: Hoare triple {20871#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20872#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:10,947 INFO L273 TraceCheckUtils]: 36: Hoare triple {20872#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20872#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:10,948 INFO L273 TraceCheckUtils]: 37: Hoare triple {20872#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20873#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:10,948 INFO L273 TraceCheckUtils]: 38: Hoare triple {20873#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20873#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:10,949 INFO L273 TraceCheckUtils]: 39: Hoare triple {20873#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20874#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:10,949 INFO L273 TraceCheckUtils]: 40: Hoare triple {20874#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20874#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:10,950 INFO L273 TraceCheckUtils]: 41: Hoare triple {20874#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20875#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:10,951 INFO L273 TraceCheckUtils]: 42: Hoare triple {20875#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20875#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:10,951 INFO L273 TraceCheckUtils]: 43: Hoare triple {20875#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20876#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:10,952 INFO L273 TraceCheckUtils]: 44: Hoare triple {20876#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20876#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:10,952 INFO L273 TraceCheckUtils]: 45: Hoare triple {20876#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20877#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:10,953 INFO L273 TraceCheckUtils]: 46: Hoare triple {20877#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20877#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:10,954 INFO L273 TraceCheckUtils]: 47: Hoare triple {20877#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20878#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:10,954 INFO L273 TraceCheckUtils]: 48: Hoare triple {20878#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20878#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:10,955 INFO L273 TraceCheckUtils]: 49: Hoare triple {20878#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20879#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:10,955 INFO L273 TraceCheckUtils]: 50: Hoare triple {20879#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20879#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:10,956 INFO L273 TraceCheckUtils]: 51: Hoare triple {20879#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20880#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:10,957 INFO L273 TraceCheckUtils]: 52: Hoare triple {20880#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20880#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:10,957 INFO L273 TraceCheckUtils]: 53: Hoare triple {20880#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20881#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:10,958 INFO L273 TraceCheckUtils]: 54: Hoare triple {20881#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20881#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:10,959 INFO L273 TraceCheckUtils]: 55: Hoare triple {20881#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20882#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:10,959 INFO L273 TraceCheckUtils]: 56: Hoare triple {20882#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20882#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:10,960 INFO L273 TraceCheckUtils]: 57: Hoare triple {20882#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20883#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:10,960 INFO L273 TraceCheckUtils]: 58: Hoare triple {20883#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20883#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:10,961 INFO L273 TraceCheckUtils]: 59: Hoare triple {20883#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20884#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:10,962 INFO L273 TraceCheckUtils]: 60: Hoare triple {20884#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20884#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:10,962 INFO L273 TraceCheckUtils]: 61: Hoare triple {20884#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20885#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:10,963 INFO L273 TraceCheckUtils]: 62: Hoare triple {20885#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20885#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:10,964 INFO L273 TraceCheckUtils]: 63: Hoare triple {20885#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20886#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:10,964 INFO L273 TraceCheckUtils]: 64: Hoare triple {20886#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20886#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:10,965 INFO L273 TraceCheckUtils]: 65: Hoare triple {20886#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20887#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:10,965 INFO L273 TraceCheckUtils]: 66: Hoare triple {20887#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20887#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:10,966 INFO L273 TraceCheckUtils]: 67: Hoare triple {20887#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20888#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:10,967 INFO L273 TraceCheckUtils]: 68: Hoare triple {20888#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20888#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:10,967 INFO L273 TraceCheckUtils]: 69: Hoare triple {20888#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20889#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:10,968 INFO L273 TraceCheckUtils]: 70: Hoare triple {20889#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20889#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:10,969 INFO L273 TraceCheckUtils]: 71: Hoare triple {20889#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20890#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:10,969 INFO L273 TraceCheckUtils]: 72: Hoare triple {20890#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20890#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:10,991 INFO L273 TraceCheckUtils]: 73: Hoare triple {20890#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20891#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:10,992 INFO L273 TraceCheckUtils]: 74: Hoare triple {20891#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20891#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:10,992 INFO L273 TraceCheckUtils]: 75: Hoare triple {20891#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20892#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:10,993 INFO L273 TraceCheckUtils]: 76: Hoare triple {20892#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20892#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:10,993 INFO L273 TraceCheckUtils]: 77: Hoare triple {20892#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20893#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:10,993 INFO L273 TraceCheckUtils]: 78: Hoare triple {20893#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20893#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:10,994 INFO L273 TraceCheckUtils]: 79: Hoare triple {20893#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20894#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:10,994 INFO L273 TraceCheckUtils]: 80: Hoare triple {20894#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20894#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:10,994 INFO L273 TraceCheckUtils]: 81: Hoare triple {20894#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20895#(<= main_~i~0 38)} is VALID [2018-11-23 13:07:10,995 INFO L273 TraceCheckUtils]: 82: Hoare triple {20895#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20895#(<= main_~i~0 38)} is VALID [2018-11-23 13:07:10,995 INFO L273 TraceCheckUtils]: 83: Hoare triple {20895#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20896#(<= main_~i~0 39)} is VALID [2018-11-23 13:07:10,995 INFO L273 TraceCheckUtils]: 84: Hoare triple {20896#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20896#(<= main_~i~0 39)} is VALID [2018-11-23 13:07:10,996 INFO L273 TraceCheckUtils]: 85: Hoare triple {20896#(<= main_~i~0 39)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20897#(<= main_~i~0 40)} is VALID [2018-11-23 13:07:10,996 INFO L273 TraceCheckUtils]: 86: Hoare triple {20897#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20897#(<= main_~i~0 40)} is VALID [2018-11-23 13:07:10,997 INFO L273 TraceCheckUtils]: 87: Hoare triple {20897#(<= main_~i~0 40)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20898#(<= main_~i~0 41)} is VALID [2018-11-23 13:07:10,998 INFO L273 TraceCheckUtils]: 88: Hoare triple {20898#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20898#(<= main_~i~0 41)} is VALID [2018-11-23 13:07:10,998 INFO L273 TraceCheckUtils]: 89: Hoare triple {20898#(<= main_~i~0 41)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20899#(<= main_~i~0 42)} is VALID [2018-11-23 13:07:10,999 INFO L273 TraceCheckUtils]: 90: Hoare triple {20899#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20899#(<= main_~i~0 42)} is VALID [2018-11-23 13:07:11,000 INFO L273 TraceCheckUtils]: 91: Hoare triple {20899#(<= main_~i~0 42)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20900#(<= main_~i~0 43)} is VALID [2018-11-23 13:07:11,000 INFO L273 TraceCheckUtils]: 92: Hoare triple {20900#(<= main_~i~0 43)} assume !(~i~0 < 1024); {20856#false} is VALID [2018-11-23 13:07:11,001 INFO L273 TraceCheckUtils]: 93: Hoare triple {20856#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {20856#false} is VALID [2018-11-23 13:07:11,001 INFO L256 TraceCheckUtils]: 94: Hoare triple {20856#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {20856#false} is VALID [2018-11-23 13:07:11,001 INFO L273 TraceCheckUtils]: 95: Hoare triple {20856#false} ~cond := #in~cond; {20856#false} is VALID [2018-11-23 13:07:11,001 INFO L273 TraceCheckUtils]: 96: Hoare triple {20856#false} assume 0 == ~cond; {20856#false} is VALID [2018-11-23 13:07:11,001 INFO L273 TraceCheckUtils]: 97: Hoare triple {20856#false} assume !false; {20856#false} is VALID [2018-11-23 13:07:11,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:11,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:11,009 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:11,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:07:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:11,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:11,337 INFO L256 TraceCheckUtils]: 0: Hoare triple {20855#true} call ULTIMATE.init(); {20855#true} is VALID [2018-11-23 13:07:11,338 INFO L273 TraceCheckUtils]: 1: Hoare triple {20855#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20855#true} is VALID [2018-11-23 13:07:11,338 INFO L273 TraceCheckUtils]: 2: Hoare triple {20855#true} assume true; {20855#true} is VALID [2018-11-23 13:07:11,338 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20855#true} {20855#true} #35#return; {20855#true} is VALID [2018-11-23 13:07:11,338 INFO L256 TraceCheckUtils]: 4: Hoare triple {20855#true} call #t~ret2 := main(); {20855#true} is VALID [2018-11-23 13:07:11,339 INFO L273 TraceCheckUtils]: 5: Hoare triple {20855#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {20919#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:11,339 INFO L273 TraceCheckUtils]: 6: Hoare triple {20919#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20919#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:11,340 INFO L273 TraceCheckUtils]: 7: Hoare triple {20919#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20858#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:11,340 INFO L273 TraceCheckUtils]: 8: Hoare triple {20858#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20858#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:11,341 INFO L273 TraceCheckUtils]: 9: Hoare triple {20858#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20859#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:11,341 INFO L273 TraceCheckUtils]: 10: Hoare triple {20859#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20859#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:11,341 INFO L273 TraceCheckUtils]: 11: Hoare triple {20859#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20860#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:11,342 INFO L273 TraceCheckUtils]: 12: Hoare triple {20860#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20860#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:11,343 INFO L273 TraceCheckUtils]: 13: Hoare triple {20860#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20861#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:11,343 INFO L273 TraceCheckUtils]: 14: Hoare triple {20861#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20861#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:11,344 INFO L273 TraceCheckUtils]: 15: Hoare triple {20861#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20862#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:11,344 INFO L273 TraceCheckUtils]: 16: Hoare triple {20862#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20862#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:11,345 INFO L273 TraceCheckUtils]: 17: Hoare triple {20862#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20863#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:11,346 INFO L273 TraceCheckUtils]: 18: Hoare triple {20863#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20863#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:11,346 INFO L273 TraceCheckUtils]: 19: Hoare triple {20863#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20864#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:11,347 INFO L273 TraceCheckUtils]: 20: Hoare triple {20864#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20864#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:11,348 INFO L273 TraceCheckUtils]: 21: Hoare triple {20864#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20865#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:11,348 INFO L273 TraceCheckUtils]: 22: Hoare triple {20865#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20865#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:11,349 INFO L273 TraceCheckUtils]: 23: Hoare triple {20865#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20866#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:11,349 INFO L273 TraceCheckUtils]: 24: Hoare triple {20866#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20866#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:11,350 INFO L273 TraceCheckUtils]: 25: Hoare triple {20866#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20867#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:11,351 INFO L273 TraceCheckUtils]: 26: Hoare triple {20867#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20867#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:11,351 INFO L273 TraceCheckUtils]: 27: Hoare triple {20867#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20868#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:11,352 INFO L273 TraceCheckUtils]: 28: Hoare triple {20868#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20868#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:11,353 INFO L273 TraceCheckUtils]: 29: Hoare triple {20868#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20869#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:11,353 INFO L273 TraceCheckUtils]: 30: Hoare triple {20869#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20869#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:11,354 INFO L273 TraceCheckUtils]: 31: Hoare triple {20869#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20870#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:11,354 INFO L273 TraceCheckUtils]: 32: Hoare triple {20870#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20870#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:11,355 INFO L273 TraceCheckUtils]: 33: Hoare triple {20870#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20871#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:11,356 INFO L273 TraceCheckUtils]: 34: Hoare triple {20871#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20871#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:11,356 INFO L273 TraceCheckUtils]: 35: Hoare triple {20871#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20872#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:11,357 INFO L273 TraceCheckUtils]: 36: Hoare triple {20872#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20872#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:11,358 INFO L273 TraceCheckUtils]: 37: Hoare triple {20872#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20873#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:11,358 INFO L273 TraceCheckUtils]: 38: Hoare triple {20873#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20873#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:11,359 INFO L273 TraceCheckUtils]: 39: Hoare triple {20873#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20874#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:11,359 INFO L273 TraceCheckUtils]: 40: Hoare triple {20874#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20874#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:11,360 INFO L273 TraceCheckUtils]: 41: Hoare triple {20874#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20875#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:11,361 INFO L273 TraceCheckUtils]: 42: Hoare triple {20875#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20875#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:11,361 INFO L273 TraceCheckUtils]: 43: Hoare triple {20875#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20876#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:11,362 INFO L273 TraceCheckUtils]: 44: Hoare triple {20876#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20876#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:11,363 INFO L273 TraceCheckUtils]: 45: Hoare triple {20876#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20877#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:11,363 INFO L273 TraceCheckUtils]: 46: Hoare triple {20877#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20877#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:11,364 INFO L273 TraceCheckUtils]: 47: Hoare triple {20877#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20878#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:11,364 INFO L273 TraceCheckUtils]: 48: Hoare triple {20878#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20878#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:11,365 INFO L273 TraceCheckUtils]: 49: Hoare triple {20878#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20879#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:11,365 INFO L273 TraceCheckUtils]: 50: Hoare triple {20879#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20879#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:11,366 INFO L273 TraceCheckUtils]: 51: Hoare triple {20879#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20880#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:11,367 INFO L273 TraceCheckUtils]: 52: Hoare triple {20880#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20880#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:11,367 INFO L273 TraceCheckUtils]: 53: Hoare triple {20880#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20881#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:11,368 INFO L273 TraceCheckUtils]: 54: Hoare triple {20881#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20881#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:11,369 INFO L273 TraceCheckUtils]: 55: Hoare triple {20881#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20882#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:11,369 INFO L273 TraceCheckUtils]: 56: Hoare triple {20882#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20882#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:11,370 INFO L273 TraceCheckUtils]: 57: Hoare triple {20882#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20883#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:11,370 INFO L273 TraceCheckUtils]: 58: Hoare triple {20883#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20883#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:11,371 INFO L273 TraceCheckUtils]: 59: Hoare triple {20883#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20884#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:11,371 INFO L273 TraceCheckUtils]: 60: Hoare triple {20884#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20884#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:11,372 INFO L273 TraceCheckUtils]: 61: Hoare triple {20884#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20885#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:11,373 INFO L273 TraceCheckUtils]: 62: Hoare triple {20885#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20885#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:11,373 INFO L273 TraceCheckUtils]: 63: Hoare triple {20885#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20886#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:11,374 INFO L273 TraceCheckUtils]: 64: Hoare triple {20886#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20886#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:11,375 INFO L273 TraceCheckUtils]: 65: Hoare triple {20886#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20887#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:11,375 INFO L273 TraceCheckUtils]: 66: Hoare triple {20887#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20887#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:11,376 INFO L273 TraceCheckUtils]: 67: Hoare triple {20887#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20888#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:11,376 INFO L273 TraceCheckUtils]: 68: Hoare triple {20888#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20888#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:11,377 INFO L273 TraceCheckUtils]: 69: Hoare triple {20888#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20889#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:11,378 INFO L273 TraceCheckUtils]: 70: Hoare triple {20889#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20889#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:11,378 INFO L273 TraceCheckUtils]: 71: Hoare triple {20889#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20890#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:11,379 INFO L273 TraceCheckUtils]: 72: Hoare triple {20890#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20890#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:11,380 INFO L273 TraceCheckUtils]: 73: Hoare triple {20890#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20891#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:11,380 INFO L273 TraceCheckUtils]: 74: Hoare triple {20891#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20891#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:11,381 INFO L273 TraceCheckUtils]: 75: Hoare triple {20891#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20892#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:11,381 INFO L273 TraceCheckUtils]: 76: Hoare triple {20892#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20892#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:11,382 INFO L273 TraceCheckUtils]: 77: Hoare triple {20892#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20893#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:11,383 INFO L273 TraceCheckUtils]: 78: Hoare triple {20893#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20893#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:11,383 INFO L273 TraceCheckUtils]: 79: Hoare triple {20893#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20894#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:11,384 INFO L273 TraceCheckUtils]: 80: Hoare triple {20894#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20894#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:11,384 INFO L273 TraceCheckUtils]: 81: Hoare triple {20894#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20895#(<= main_~i~0 38)} is VALID [2018-11-23 13:07:11,385 INFO L273 TraceCheckUtils]: 82: Hoare triple {20895#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20895#(<= main_~i~0 38)} is VALID [2018-11-23 13:07:11,386 INFO L273 TraceCheckUtils]: 83: Hoare triple {20895#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20896#(<= main_~i~0 39)} is VALID [2018-11-23 13:07:11,386 INFO L273 TraceCheckUtils]: 84: Hoare triple {20896#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20896#(<= main_~i~0 39)} is VALID [2018-11-23 13:07:11,387 INFO L273 TraceCheckUtils]: 85: Hoare triple {20896#(<= main_~i~0 39)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20897#(<= main_~i~0 40)} is VALID [2018-11-23 13:07:11,387 INFO L273 TraceCheckUtils]: 86: Hoare triple {20897#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20897#(<= main_~i~0 40)} is VALID [2018-11-23 13:07:11,388 INFO L273 TraceCheckUtils]: 87: Hoare triple {20897#(<= main_~i~0 40)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20898#(<= main_~i~0 41)} is VALID [2018-11-23 13:07:11,389 INFO L273 TraceCheckUtils]: 88: Hoare triple {20898#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20898#(<= main_~i~0 41)} is VALID [2018-11-23 13:07:11,389 INFO L273 TraceCheckUtils]: 89: Hoare triple {20898#(<= main_~i~0 41)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20899#(<= main_~i~0 42)} is VALID [2018-11-23 13:07:11,390 INFO L273 TraceCheckUtils]: 90: Hoare triple {20899#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20899#(<= main_~i~0 42)} is VALID [2018-11-23 13:07:11,391 INFO L273 TraceCheckUtils]: 91: Hoare triple {20899#(<= main_~i~0 42)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20900#(<= main_~i~0 43)} is VALID [2018-11-23 13:07:11,391 INFO L273 TraceCheckUtils]: 92: Hoare triple {20900#(<= main_~i~0 43)} assume !(~i~0 < 1024); {20856#false} is VALID [2018-11-23 13:07:11,391 INFO L273 TraceCheckUtils]: 93: Hoare triple {20856#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {20856#false} is VALID [2018-11-23 13:07:11,392 INFO L256 TraceCheckUtils]: 94: Hoare triple {20856#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {20856#false} is VALID [2018-11-23 13:07:11,392 INFO L273 TraceCheckUtils]: 95: Hoare triple {20856#false} ~cond := #in~cond; {20856#false} is VALID [2018-11-23 13:07:11,392 INFO L273 TraceCheckUtils]: 96: Hoare triple {20856#false} assume 0 == ~cond; {20856#false} is VALID [2018-11-23 13:07:11,392 INFO L273 TraceCheckUtils]: 97: Hoare triple {20856#false} assume !false; {20856#false} is VALID [2018-11-23 13:07:11,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:11,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:11,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2018-11-23 13:07:11,421 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 98 [2018-11-23 13:07:11,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:11,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states. [2018-11-23 13:07:11,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:11,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-23 13:07:11,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-23 13:07:11,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 13:07:11,519 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 47 states. [2018-11-23 13:07:12,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:12,024 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-11-23 13:07:12,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-23 13:07:12,024 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 98 [2018-11-23 13:07:12,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:12,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 13:07:12,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 108 transitions. [2018-11-23 13:07:12,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 13:07:12,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 108 transitions. [2018-11-23 13:07:12,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 108 transitions. [2018-11-23 13:07:12,132 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 13:07:12,134 INFO L225 Difference]: With dead ends: 108 [2018-11-23 13:07:12,134 INFO L226 Difference]: Without dead ends: 102 [2018-11-23 13:07:12,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 13:07:12,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-23 13:07:12,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-11-23 13:07:12,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:12,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 101 states. [2018-11-23 13:07:12,172 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 101 states. [2018-11-23 13:07:12,172 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 101 states. [2018-11-23 13:07:12,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:12,174 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-11-23 13:07:12,174 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-11-23 13:07:12,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:12,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:12,175 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 102 states. [2018-11-23 13:07:12,175 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 102 states. [2018-11-23 13:07:12,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:12,176 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-11-23 13:07:12,176 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-11-23 13:07:12,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:12,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:12,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:12,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:12,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-23 13:07:12,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-11-23 13:07:12,177 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2018-11-23 13:07:12,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:12,178 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-11-23 13:07:12,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-23 13:07:12,178 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-11-23 13:07:12,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 13:07:12,178 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:12,178 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:12,179 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:12,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:12,179 INFO L82 PathProgramCache]: Analyzing trace with hash -370542859, now seen corresponding path program 44 times [2018-11-23 13:07:12,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:12,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:12,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:12,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:07:12,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:14,160 INFO L256 TraceCheckUtils]: 0: Hoare triple {21712#true} call ULTIMATE.init(); {21712#true} is VALID [2018-11-23 13:07:14,161 INFO L273 TraceCheckUtils]: 1: Hoare triple {21712#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21712#true} is VALID [2018-11-23 13:07:14,161 INFO L273 TraceCheckUtils]: 2: Hoare triple {21712#true} assume true; {21712#true} is VALID [2018-11-23 13:07:14,161 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21712#true} {21712#true} #35#return; {21712#true} is VALID [2018-11-23 13:07:14,161 INFO L256 TraceCheckUtils]: 4: Hoare triple {21712#true} call #t~ret2 := main(); {21712#true} is VALID [2018-11-23 13:07:14,165 INFO L273 TraceCheckUtils]: 5: Hoare triple {21712#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {21714#(= main_~i~0 0)} is VALID [2018-11-23 13:07:14,165 INFO L273 TraceCheckUtils]: 6: Hoare triple {21714#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21714#(= main_~i~0 0)} is VALID [2018-11-23 13:07:14,166 INFO L273 TraceCheckUtils]: 7: Hoare triple {21714#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21715#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:14,166 INFO L273 TraceCheckUtils]: 8: Hoare triple {21715#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21715#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:14,167 INFO L273 TraceCheckUtils]: 9: Hoare triple {21715#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21716#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:14,167 INFO L273 TraceCheckUtils]: 10: Hoare triple {21716#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21716#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:14,167 INFO L273 TraceCheckUtils]: 11: Hoare triple {21716#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21717#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:14,168 INFO L273 TraceCheckUtils]: 12: Hoare triple {21717#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21717#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:14,168 INFO L273 TraceCheckUtils]: 13: Hoare triple {21717#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21718#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:14,168 INFO L273 TraceCheckUtils]: 14: Hoare triple {21718#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21718#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:14,169 INFO L273 TraceCheckUtils]: 15: Hoare triple {21718#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21719#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:14,169 INFO L273 TraceCheckUtils]: 16: Hoare triple {21719#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21719#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:14,170 INFO L273 TraceCheckUtils]: 17: Hoare triple {21719#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21720#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:14,170 INFO L273 TraceCheckUtils]: 18: Hoare triple {21720#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21720#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:14,171 INFO L273 TraceCheckUtils]: 19: Hoare triple {21720#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21721#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:14,172 INFO L273 TraceCheckUtils]: 20: Hoare triple {21721#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21721#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:14,172 INFO L273 TraceCheckUtils]: 21: Hoare triple {21721#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21722#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:14,173 INFO L273 TraceCheckUtils]: 22: Hoare triple {21722#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21722#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:14,174 INFO L273 TraceCheckUtils]: 23: Hoare triple {21722#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21723#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:14,174 INFO L273 TraceCheckUtils]: 24: Hoare triple {21723#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21723#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:14,175 INFO L273 TraceCheckUtils]: 25: Hoare triple {21723#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21724#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:14,175 INFO L273 TraceCheckUtils]: 26: Hoare triple {21724#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21724#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:14,176 INFO L273 TraceCheckUtils]: 27: Hoare triple {21724#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21725#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:14,176 INFO L273 TraceCheckUtils]: 28: Hoare triple {21725#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21725#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:14,177 INFO L273 TraceCheckUtils]: 29: Hoare triple {21725#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21726#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:14,178 INFO L273 TraceCheckUtils]: 30: Hoare triple {21726#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21726#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:14,178 INFO L273 TraceCheckUtils]: 31: Hoare triple {21726#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21727#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:14,179 INFO L273 TraceCheckUtils]: 32: Hoare triple {21727#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21727#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:14,180 INFO L273 TraceCheckUtils]: 33: Hoare triple {21727#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21728#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:14,180 INFO L273 TraceCheckUtils]: 34: Hoare triple {21728#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21728#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:14,181 INFO L273 TraceCheckUtils]: 35: Hoare triple {21728#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21729#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:14,181 INFO L273 TraceCheckUtils]: 36: Hoare triple {21729#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21729#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:14,182 INFO L273 TraceCheckUtils]: 37: Hoare triple {21729#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21730#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:14,183 INFO L273 TraceCheckUtils]: 38: Hoare triple {21730#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21730#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:14,183 INFO L273 TraceCheckUtils]: 39: Hoare triple {21730#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21731#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:14,184 INFO L273 TraceCheckUtils]: 40: Hoare triple {21731#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21731#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:14,185 INFO L273 TraceCheckUtils]: 41: Hoare triple {21731#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21732#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:14,185 INFO L273 TraceCheckUtils]: 42: Hoare triple {21732#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21732#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:14,186 INFO L273 TraceCheckUtils]: 43: Hoare triple {21732#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21733#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:14,186 INFO L273 TraceCheckUtils]: 44: Hoare triple {21733#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21733#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:14,187 INFO L273 TraceCheckUtils]: 45: Hoare triple {21733#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21734#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:14,187 INFO L273 TraceCheckUtils]: 46: Hoare triple {21734#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21734#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:14,188 INFO L273 TraceCheckUtils]: 47: Hoare triple {21734#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21735#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:14,189 INFO L273 TraceCheckUtils]: 48: Hoare triple {21735#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21735#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:14,189 INFO L273 TraceCheckUtils]: 49: Hoare triple {21735#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21736#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:14,190 INFO L273 TraceCheckUtils]: 50: Hoare triple {21736#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21736#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:14,190 INFO L273 TraceCheckUtils]: 51: Hoare triple {21736#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21737#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:14,191 INFO L273 TraceCheckUtils]: 52: Hoare triple {21737#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21737#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:14,192 INFO L273 TraceCheckUtils]: 53: Hoare triple {21737#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21738#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:14,192 INFO L273 TraceCheckUtils]: 54: Hoare triple {21738#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21738#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:14,193 INFO L273 TraceCheckUtils]: 55: Hoare triple {21738#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21739#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:14,193 INFO L273 TraceCheckUtils]: 56: Hoare triple {21739#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21739#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:14,194 INFO L273 TraceCheckUtils]: 57: Hoare triple {21739#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21740#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:14,195 INFO L273 TraceCheckUtils]: 58: Hoare triple {21740#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21740#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:14,195 INFO L273 TraceCheckUtils]: 59: Hoare triple {21740#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21741#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:14,196 INFO L273 TraceCheckUtils]: 60: Hoare triple {21741#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21741#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:14,197 INFO L273 TraceCheckUtils]: 61: Hoare triple {21741#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21742#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:14,197 INFO L273 TraceCheckUtils]: 62: Hoare triple {21742#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21742#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:14,198 INFO L273 TraceCheckUtils]: 63: Hoare triple {21742#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21743#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:14,198 INFO L273 TraceCheckUtils]: 64: Hoare triple {21743#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21743#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:14,199 INFO L273 TraceCheckUtils]: 65: Hoare triple {21743#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21744#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:14,199 INFO L273 TraceCheckUtils]: 66: Hoare triple {21744#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21744#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:14,200 INFO L273 TraceCheckUtils]: 67: Hoare triple {21744#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21745#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:14,201 INFO L273 TraceCheckUtils]: 68: Hoare triple {21745#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21745#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:14,201 INFO L273 TraceCheckUtils]: 69: Hoare triple {21745#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21746#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:14,202 INFO L273 TraceCheckUtils]: 70: Hoare triple {21746#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21746#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:14,203 INFO L273 TraceCheckUtils]: 71: Hoare triple {21746#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21747#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:14,203 INFO L273 TraceCheckUtils]: 72: Hoare triple {21747#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21747#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:14,204 INFO L273 TraceCheckUtils]: 73: Hoare triple {21747#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21748#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:14,204 INFO L273 TraceCheckUtils]: 74: Hoare triple {21748#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21748#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:14,205 INFO L273 TraceCheckUtils]: 75: Hoare triple {21748#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21749#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:14,206 INFO L273 TraceCheckUtils]: 76: Hoare triple {21749#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21749#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:14,206 INFO L273 TraceCheckUtils]: 77: Hoare triple {21749#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21750#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:14,207 INFO L273 TraceCheckUtils]: 78: Hoare triple {21750#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21750#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:14,208 INFO L273 TraceCheckUtils]: 79: Hoare triple {21750#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21751#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:14,208 INFO L273 TraceCheckUtils]: 80: Hoare triple {21751#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21751#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:14,209 INFO L273 TraceCheckUtils]: 81: Hoare triple {21751#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21752#(<= main_~i~0 38)} is VALID [2018-11-23 13:07:14,209 INFO L273 TraceCheckUtils]: 82: Hoare triple {21752#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21752#(<= main_~i~0 38)} is VALID [2018-11-23 13:07:14,210 INFO L273 TraceCheckUtils]: 83: Hoare triple {21752#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21753#(<= main_~i~0 39)} is VALID [2018-11-23 13:07:14,211 INFO L273 TraceCheckUtils]: 84: Hoare triple {21753#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21753#(<= main_~i~0 39)} is VALID [2018-11-23 13:07:14,211 INFO L273 TraceCheckUtils]: 85: Hoare triple {21753#(<= main_~i~0 39)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21754#(<= main_~i~0 40)} is VALID [2018-11-23 13:07:14,212 INFO L273 TraceCheckUtils]: 86: Hoare triple {21754#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21754#(<= main_~i~0 40)} is VALID [2018-11-23 13:07:14,213 INFO L273 TraceCheckUtils]: 87: Hoare triple {21754#(<= main_~i~0 40)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21755#(<= main_~i~0 41)} is VALID [2018-11-23 13:07:14,213 INFO L273 TraceCheckUtils]: 88: Hoare triple {21755#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21755#(<= main_~i~0 41)} is VALID [2018-11-23 13:07:14,214 INFO L273 TraceCheckUtils]: 89: Hoare triple {21755#(<= main_~i~0 41)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21756#(<= main_~i~0 42)} is VALID [2018-11-23 13:07:14,214 INFO L273 TraceCheckUtils]: 90: Hoare triple {21756#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21756#(<= main_~i~0 42)} is VALID [2018-11-23 13:07:14,215 INFO L273 TraceCheckUtils]: 91: Hoare triple {21756#(<= main_~i~0 42)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21757#(<= main_~i~0 43)} is VALID [2018-11-23 13:07:14,216 INFO L273 TraceCheckUtils]: 92: Hoare triple {21757#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21757#(<= main_~i~0 43)} is VALID [2018-11-23 13:07:14,216 INFO L273 TraceCheckUtils]: 93: Hoare triple {21757#(<= main_~i~0 43)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21758#(<= main_~i~0 44)} is VALID [2018-11-23 13:07:14,217 INFO L273 TraceCheckUtils]: 94: Hoare triple {21758#(<= main_~i~0 44)} assume !(~i~0 < 1024); {21713#false} is VALID [2018-11-23 13:07:14,217 INFO L273 TraceCheckUtils]: 95: Hoare triple {21713#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {21713#false} is VALID [2018-11-23 13:07:14,217 INFO L256 TraceCheckUtils]: 96: Hoare triple {21713#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {21713#false} is VALID [2018-11-23 13:07:14,218 INFO L273 TraceCheckUtils]: 97: Hoare triple {21713#false} ~cond := #in~cond; {21713#false} is VALID [2018-11-23 13:07:14,218 INFO L273 TraceCheckUtils]: 98: Hoare triple {21713#false} assume 0 == ~cond; {21713#false} is VALID [2018-11-23 13:07:14,218 INFO L273 TraceCheckUtils]: 99: Hoare triple {21713#false} assume !false; {21713#false} is VALID [2018-11-23 13:07:14,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:14,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:14,227 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:14,237 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:07:14,274 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:07:14,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:14,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:14,619 INFO L256 TraceCheckUtils]: 0: Hoare triple {21712#true} call ULTIMATE.init(); {21712#true} is VALID [2018-11-23 13:07:14,619 INFO L273 TraceCheckUtils]: 1: Hoare triple {21712#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21712#true} is VALID [2018-11-23 13:07:14,620 INFO L273 TraceCheckUtils]: 2: Hoare triple {21712#true} assume true; {21712#true} is VALID [2018-11-23 13:07:14,620 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21712#true} {21712#true} #35#return; {21712#true} is VALID [2018-11-23 13:07:14,620 INFO L256 TraceCheckUtils]: 4: Hoare triple {21712#true} call #t~ret2 := main(); {21712#true} is VALID [2018-11-23 13:07:14,621 INFO L273 TraceCheckUtils]: 5: Hoare triple {21712#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {21777#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:14,621 INFO L273 TraceCheckUtils]: 6: Hoare triple {21777#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21777#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:14,621 INFO L273 TraceCheckUtils]: 7: Hoare triple {21777#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21715#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:14,622 INFO L273 TraceCheckUtils]: 8: Hoare triple {21715#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21715#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:14,622 INFO L273 TraceCheckUtils]: 9: Hoare triple {21715#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21716#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:14,622 INFO L273 TraceCheckUtils]: 10: Hoare triple {21716#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21716#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:14,623 INFO L273 TraceCheckUtils]: 11: Hoare triple {21716#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21717#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:14,623 INFO L273 TraceCheckUtils]: 12: Hoare triple {21717#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21717#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:14,624 INFO L273 TraceCheckUtils]: 13: Hoare triple {21717#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21718#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:14,624 INFO L273 TraceCheckUtils]: 14: Hoare triple {21718#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21718#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:14,625 INFO L273 TraceCheckUtils]: 15: Hoare triple {21718#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21719#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:14,625 INFO L273 TraceCheckUtils]: 16: Hoare triple {21719#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21719#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:14,626 INFO L273 TraceCheckUtils]: 17: Hoare triple {21719#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21720#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:14,627 INFO L273 TraceCheckUtils]: 18: Hoare triple {21720#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21720#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:14,627 INFO L273 TraceCheckUtils]: 19: Hoare triple {21720#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21721#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:14,628 INFO L273 TraceCheckUtils]: 20: Hoare triple {21721#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21721#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:14,628 INFO L273 TraceCheckUtils]: 21: Hoare triple {21721#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21722#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:14,629 INFO L273 TraceCheckUtils]: 22: Hoare triple {21722#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21722#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:14,630 INFO L273 TraceCheckUtils]: 23: Hoare triple {21722#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21723#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:14,630 INFO L273 TraceCheckUtils]: 24: Hoare triple {21723#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21723#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:14,631 INFO L273 TraceCheckUtils]: 25: Hoare triple {21723#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21724#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:14,631 INFO L273 TraceCheckUtils]: 26: Hoare triple {21724#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21724#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:14,632 INFO L273 TraceCheckUtils]: 27: Hoare triple {21724#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21725#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:14,633 INFO L273 TraceCheckUtils]: 28: Hoare triple {21725#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21725#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:14,633 INFO L273 TraceCheckUtils]: 29: Hoare triple {21725#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21726#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:14,634 INFO L273 TraceCheckUtils]: 30: Hoare triple {21726#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21726#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:14,634 INFO L273 TraceCheckUtils]: 31: Hoare triple {21726#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21727#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:14,635 INFO L273 TraceCheckUtils]: 32: Hoare triple {21727#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21727#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:14,636 INFO L273 TraceCheckUtils]: 33: Hoare triple {21727#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21728#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:14,636 INFO L273 TraceCheckUtils]: 34: Hoare triple {21728#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21728#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:14,637 INFO L273 TraceCheckUtils]: 35: Hoare triple {21728#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21729#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:14,637 INFO L273 TraceCheckUtils]: 36: Hoare triple {21729#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21729#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:14,638 INFO L273 TraceCheckUtils]: 37: Hoare triple {21729#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21730#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:14,638 INFO L273 TraceCheckUtils]: 38: Hoare triple {21730#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21730#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:14,639 INFO L273 TraceCheckUtils]: 39: Hoare triple {21730#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21731#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:14,640 INFO L273 TraceCheckUtils]: 40: Hoare triple {21731#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21731#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:14,640 INFO L273 TraceCheckUtils]: 41: Hoare triple {21731#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21732#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:14,641 INFO L273 TraceCheckUtils]: 42: Hoare triple {21732#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21732#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:14,641 INFO L273 TraceCheckUtils]: 43: Hoare triple {21732#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21733#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:14,642 INFO L273 TraceCheckUtils]: 44: Hoare triple {21733#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21733#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:14,643 INFO L273 TraceCheckUtils]: 45: Hoare triple {21733#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21734#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:14,643 INFO L273 TraceCheckUtils]: 46: Hoare triple {21734#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21734#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:14,644 INFO L273 TraceCheckUtils]: 47: Hoare triple {21734#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21735#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:14,644 INFO L273 TraceCheckUtils]: 48: Hoare triple {21735#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21735#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:14,645 INFO L273 TraceCheckUtils]: 49: Hoare triple {21735#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21736#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:14,645 INFO L273 TraceCheckUtils]: 50: Hoare triple {21736#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21736#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:14,646 INFO L273 TraceCheckUtils]: 51: Hoare triple {21736#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21737#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:14,647 INFO L273 TraceCheckUtils]: 52: Hoare triple {21737#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21737#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:14,647 INFO L273 TraceCheckUtils]: 53: Hoare triple {21737#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21738#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:14,648 INFO L273 TraceCheckUtils]: 54: Hoare triple {21738#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21738#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:14,648 INFO L273 TraceCheckUtils]: 55: Hoare triple {21738#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21739#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:14,649 INFO L273 TraceCheckUtils]: 56: Hoare triple {21739#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21739#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:14,650 INFO L273 TraceCheckUtils]: 57: Hoare triple {21739#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21740#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:14,650 INFO L273 TraceCheckUtils]: 58: Hoare triple {21740#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21740#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:14,651 INFO L273 TraceCheckUtils]: 59: Hoare triple {21740#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21741#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:14,651 INFO L273 TraceCheckUtils]: 60: Hoare triple {21741#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21741#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:14,652 INFO L273 TraceCheckUtils]: 61: Hoare triple {21741#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21742#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:14,653 INFO L273 TraceCheckUtils]: 62: Hoare triple {21742#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21742#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:14,653 INFO L273 TraceCheckUtils]: 63: Hoare triple {21742#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21743#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:14,654 INFO L273 TraceCheckUtils]: 64: Hoare triple {21743#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21743#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:14,654 INFO L273 TraceCheckUtils]: 65: Hoare triple {21743#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21744#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:14,655 INFO L273 TraceCheckUtils]: 66: Hoare triple {21744#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21744#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:14,656 INFO L273 TraceCheckUtils]: 67: Hoare triple {21744#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21745#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:14,656 INFO L273 TraceCheckUtils]: 68: Hoare triple {21745#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21745#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:14,657 INFO L273 TraceCheckUtils]: 69: Hoare triple {21745#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21746#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:14,657 INFO L273 TraceCheckUtils]: 70: Hoare triple {21746#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21746#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:14,658 INFO L273 TraceCheckUtils]: 71: Hoare triple {21746#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21747#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:14,658 INFO L273 TraceCheckUtils]: 72: Hoare triple {21747#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21747#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:14,659 INFO L273 TraceCheckUtils]: 73: Hoare triple {21747#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21748#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:14,660 INFO L273 TraceCheckUtils]: 74: Hoare triple {21748#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21748#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:14,660 INFO L273 TraceCheckUtils]: 75: Hoare triple {21748#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21749#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:14,661 INFO L273 TraceCheckUtils]: 76: Hoare triple {21749#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21749#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:14,661 INFO L273 TraceCheckUtils]: 77: Hoare triple {21749#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21750#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:14,662 INFO L273 TraceCheckUtils]: 78: Hoare triple {21750#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21750#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:14,663 INFO L273 TraceCheckUtils]: 79: Hoare triple {21750#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21751#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:14,663 INFO L273 TraceCheckUtils]: 80: Hoare triple {21751#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21751#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:14,664 INFO L273 TraceCheckUtils]: 81: Hoare triple {21751#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21752#(<= main_~i~0 38)} is VALID [2018-11-23 13:07:14,664 INFO L273 TraceCheckUtils]: 82: Hoare triple {21752#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21752#(<= main_~i~0 38)} is VALID [2018-11-23 13:07:14,665 INFO L273 TraceCheckUtils]: 83: Hoare triple {21752#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21753#(<= main_~i~0 39)} is VALID [2018-11-23 13:07:14,666 INFO L273 TraceCheckUtils]: 84: Hoare triple {21753#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21753#(<= main_~i~0 39)} is VALID [2018-11-23 13:07:14,666 INFO L273 TraceCheckUtils]: 85: Hoare triple {21753#(<= main_~i~0 39)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21754#(<= main_~i~0 40)} is VALID [2018-11-23 13:07:14,667 INFO L273 TraceCheckUtils]: 86: Hoare triple {21754#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21754#(<= main_~i~0 40)} is VALID [2018-11-23 13:07:14,667 INFO L273 TraceCheckUtils]: 87: Hoare triple {21754#(<= main_~i~0 40)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21755#(<= main_~i~0 41)} is VALID [2018-11-23 13:07:14,668 INFO L273 TraceCheckUtils]: 88: Hoare triple {21755#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21755#(<= main_~i~0 41)} is VALID [2018-11-23 13:07:14,669 INFO L273 TraceCheckUtils]: 89: Hoare triple {21755#(<= main_~i~0 41)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21756#(<= main_~i~0 42)} is VALID [2018-11-23 13:07:14,669 INFO L273 TraceCheckUtils]: 90: Hoare triple {21756#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21756#(<= main_~i~0 42)} is VALID [2018-11-23 13:07:14,670 INFO L273 TraceCheckUtils]: 91: Hoare triple {21756#(<= main_~i~0 42)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21757#(<= main_~i~0 43)} is VALID [2018-11-23 13:07:14,670 INFO L273 TraceCheckUtils]: 92: Hoare triple {21757#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {21757#(<= main_~i~0 43)} is VALID [2018-11-23 13:07:14,671 INFO L273 TraceCheckUtils]: 93: Hoare triple {21757#(<= main_~i~0 43)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21758#(<= main_~i~0 44)} is VALID [2018-11-23 13:07:14,672 INFO L273 TraceCheckUtils]: 94: Hoare triple {21758#(<= main_~i~0 44)} assume !(~i~0 < 1024); {21713#false} is VALID [2018-11-23 13:07:14,672 INFO L273 TraceCheckUtils]: 95: Hoare triple {21713#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {21713#false} is VALID [2018-11-23 13:07:14,672 INFO L256 TraceCheckUtils]: 96: Hoare triple {21713#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {21713#false} is VALID [2018-11-23 13:07:14,672 INFO L273 TraceCheckUtils]: 97: Hoare triple {21713#false} ~cond := #in~cond; {21713#false} is VALID [2018-11-23 13:07:14,672 INFO L273 TraceCheckUtils]: 98: Hoare triple {21713#false} assume 0 == ~cond; {21713#false} is VALID [2018-11-23 13:07:14,673 INFO L273 TraceCheckUtils]: 99: Hoare triple {21713#false} assume !false; {21713#false} is VALID [2018-11-23 13:07:14,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:14,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:14,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2018-11-23 13:07:14,700 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 100 [2018-11-23 13:07:14,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:14,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 13:07:14,797 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:14,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 13:07:14,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 13:07:14,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 13:07:14,799 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 48 states. [2018-11-23 13:07:15,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:15,747 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-11-23 13:07:15,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-23 13:07:15,747 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 100 [2018-11-23 13:07:15,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:15,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 13:07:15,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 110 transitions. [2018-11-23 13:07:15,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 13:07:15,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 110 transitions. [2018-11-23 13:07:15,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 110 transitions. [2018-11-23 13:07:15,899 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:15,901 INFO L225 Difference]: With dead ends: 110 [2018-11-23 13:07:15,901 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 13:07:15,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 13:07:15,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 13:07:15,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2018-11-23 13:07:15,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:15,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 103 states. [2018-11-23 13:07:15,939 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 103 states. [2018-11-23 13:07:15,939 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 103 states. [2018-11-23 13:07:15,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:15,940 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-11-23 13:07:15,940 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-11-23 13:07:15,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:15,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:15,941 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 104 states. [2018-11-23 13:07:15,941 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 104 states. [2018-11-23 13:07:15,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:15,942 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-11-23 13:07:15,942 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-11-23 13:07:15,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:15,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:15,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:15,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:15,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-23 13:07:15,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-11-23 13:07:15,944 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2018-11-23 13:07:15,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:15,944 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-11-23 13:07:15,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 13:07:15,944 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-11-23 13:07:15,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-23 13:07:15,944 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:15,944 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:15,945 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:15,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:15,945 INFO L82 PathProgramCache]: Analyzing trace with hash -450123625, now seen corresponding path program 45 times [2018-11-23 13:07:15,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:15,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:15,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:15,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:15,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:18,231 INFO L256 TraceCheckUtils]: 0: Hoare triple {22586#true} call ULTIMATE.init(); {22586#true} is VALID [2018-11-23 13:07:18,231 INFO L273 TraceCheckUtils]: 1: Hoare triple {22586#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22586#true} is VALID [2018-11-23 13:07:18,231 INFO L273 TraceCheckUtils]: 2: Hoare triple {22586#true} assume true; {22586#true} is VALID [2018-11-23 13:07:18,231 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22586#true} {22586#true} #35#return; {22586#true} is VALID [2018-11-23 13:07:18,232 INFO L256 TraceCheckUtils]: 4: Hoare triple {22586#true} call #t~ret2 := main(); {22586#true} is VALID [2018-11-23 13:07:18,233 INFO L273 TraceCheckUtils]: 5: Hoare triple {22586#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {22588#(= main_~i~0 0)} is VALID [2018-11-23 13:07:18,233 INFO L273 TraceCheckUtils]: 6: Hoare triple {22588#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22588#(= main_~i~0 0)} is VALID [2018-11-23 13:07:18,235 INFO L273 TraceCheckUtils]: 7: Hoare triple {22588#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22589#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:18,235 INFO L273 TraceCheckUtils]: 8: Hoare triple {22589#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22589#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:18,237 INFO L273 TraceCheckUtils]: 9: Hoare triple {22589#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22590#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:18,237 INFO L273 TraceCheckUtils]: 10: Hoare triple {22590#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22590#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:18,239 INFO L273 TraceCheckUtils]: 11: Hoare triple {22590#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22591#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:18,239 INFO L273 TraceCheckUtils]: 12: Hoare triple {22591#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22591#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:18,241 INFO L273 TraceCheckUtils]: 13: Hoare triple {22591#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22592#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:18,241 INFO L273 TraceCheckUtils]: 14: Hoare triple {22592#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22592#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:18,243 INFO L273 TraceCheckUtils]: 15: Hoare triple {22592#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22593#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:18,243 INFO L273 TraceCheckUtils]: 16: Hoare triple {22593#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22593#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:18,245 INFO L273 TraceCheckUtils]: 17: Hoare triple {22593#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22594#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:18,245 INFO L273 TraceCheckUtils]: 18: Hoare triple {22594#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22594#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:18,247 INFO L273 TraceCheckUtils]: 19: Hoare triple {22594#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22595#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:18,247 INFO L273 TraceCheckUtils]: 20: Hoare triple {22595#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22595#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:18,249 INFO L273 TraceCheckUtils]: 21: Hoare triple {22595#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22596#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:18,249 INFO L273 TraceCheckUtils]: 22: Hoare triple {22596#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22596#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:18,252 INFO L273 TraceCheckUtils]: 23: Hoare triple {22596#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22597#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:18,252 INFO L273 TraceCheckUtils]: 24: Hoare triple {22597#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22597#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:18,254 INFO L273 TraceCheckUtils]: 25: Hoare triple {22597#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22598#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:18,254 INFO L273 TraceCheckUtils]: 26: Hoare triple {22598#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22598#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:18,256 INFO L273 TraceCheckUtils]: 27: Hoare triple {22598#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22599#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:18,256 INFO L273 TraceCheckUtils]: 28: Hoare triple {22599#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22599#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:18,256 INFO L273 TraceCheckUtils]: 29: Hoare triple {22599#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22600#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:18,257 INFO L273 TraceCheckUtils]: 30: Hoare triple {22600#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22600#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:18,257 INFO L273 TraceCheckUtils]: 31: Hoare triple {22600#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22601#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:18,257 INFO L273 TraceCheckUtils]: 32: Hoare triple {22601#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22601#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:18,258 INFO L273 TraceCheckUtils]: 33: Hoare triple {22601#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22602#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:18,258 INFO L273 TraceCheckUtils]: 34: Hoare triple {22602#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22602#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:18,259 INFO L273 TraceCheckUtils]: 35: Hoare triple {22602#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22603#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:18,259 INFO L273 TraceCheckUtils]: 36: Hoare triple {22603#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22603#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:18,259 INFO L273 TraceCheckUtils]: 37: Hoare triple {22603#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22604#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:18,260 INFO L273 TraceCheckUtils]: 38: Hoare triple {22604#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22604#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:18,260 INFO L273 TraceCheckUtils]: 39: Hoare triple {22604#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22605#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:18,261 INFO L273 TraceCheckUtils]: 40: Hoare triple {22605#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22605#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:18,261 INFO L273 TraceCheckUtils]: 41: Hoare triple {22605#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22606#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:18,262 INFO L273 TraceCheckUtils]: 42: Hoare triple {22606#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22606#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:18,263 INFO L273 TraceCheckUtils]: 43: Hoare triple {22606#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22607#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:18,263 INFO L273 TraceCheckUtils]: 44: Hoare triple {22607#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22607#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:18,264 INFO L273 TraceCheckUtils]: 45: Hoare triple {22607#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22608#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:18,264 INFO L273 TraceCheckUtils]: 46: Hoare triple {22608#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22608#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:18,265 INFO L273 TraceCheckUtils]: 47: Hoare triple {22608#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22609#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:18,265 INFO L273 TraceCheckUtils]: 48: Hoare triple {22609#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22609#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:18,266 INFO L273 TraceCheckUtils]: 49: Hoare triple {22609#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22610#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:18,267 INFO L273 TraceCheckUtils]: 50: Hoare triple {22610#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22610#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:18,267 INFO L273 TraceCheckUtils]: 51: Hoare triple {22610#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22611#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:18,268 INFO L273 TraceCheckUtils]: 52: Hoare triple {22611#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22611#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:18,269 INFO L273 TraceCheckUtils]: 53: Hoare triple {22611#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22612#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:18,269 INFO L273 TraceCheckUtils]: 54: Hoare triple {22612#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22612#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:18,270 INFO L273 TraceCheckUtils]: 55: Hoare triple {22612#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22613#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:18,270 INFO L273 TraceCheckUtils]: 56: Hoare triple {22613#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22613#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:18,271 INFO L273 TraceCheckUtils]: 57: Hoare triple {22613#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22614#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:18,272 INFO L273 TraceCheckUtils]: 58: Hoare triple {22614#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22614#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:18,272 INFO L273 TraceCheckUtils]: 59: Hoare triple {22614#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22615#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:18,273 INFO L273 TraceCheckUtils]: 60: Hoare triple {22615#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22615#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:18,274 INFO L273 TraceCheckUtils]: 61: Hoare triple {22615#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22616#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:18,274 INFO L273 TraceCheckUtils]: 62: Hoare triple {22616#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22616#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:18,275 INFO L273 TraceCheckUtils]: 63: Hoare triple {22616#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22617#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:18,275 INFO L273 TraceCheckUtils]: 64: Hoare triple {22617#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22617#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:18,276 INFO L273 TraceCheckUtils]: 65: Hoare triple {22617#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22618#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:18,276 INFO L273 TraceCheckUtils]: 66: Hoare triple {22618#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22618#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:18,277 INFO L273 TraceCheckUtils]: 67: Hoare triple {22618#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22619#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:18,278 INFO L273 TraceCheckUtils]: 68: Hoare triple {22619#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22619#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:18,278 INFO L273 TraceCheckUtils]: 69: Hoare triple {22619#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22620#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:18,279 INFO L273 TraceCheckUtils]: 70: Hoare triple {22620#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22620#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:18,280 INFO L273 TraceCheckUtils]: 71: Hoare triple {22620#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22621#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:18,280 INFO L273 TraceCheckUtils]: 72: Hoare triple {22621#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22621#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:18,281 INFO L273 TraceCheckUtils]: 73: Hoare triple {22621#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22622#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:18,281 INFO L273 TraceCheckUtils]: 74: Hoare triple {22622#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22622#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:18,282 INFO L273 TraceCheckUtils]: 75: Hoare triple {22622#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22623#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:18,283 INFO L273 TraceCheckUtils]: 76: Hoare triple {22623#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22623#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:18,283 INFO L273 TraceCheckUtils]: 77: Hoare triple {22623#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22624#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:18,284 INFO L273 TraceCheckUtils]: 78: Hoare triple {22624#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22624#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:18,285 INFO L273 TraceCheckUtils]: 79: Hoare triple {22624#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22625#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:18,285 INFO L273 TraceCheckUtils]: 80: Hoare triple {22625#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22625#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:18,286 INFO L273 TraceCheckUtils]: 81: Hoare triple {22625#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22626#(<= main_~i~0 38)} is VALID [2018-11-23 13:07:18,286 INFO L273 TraceCheckUtils]: 82: Hoare triple {22626#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22626#(<= main_~i~0 38)} is VALID [2018-11-23 13:07:18,287 INFO L273 TraceCheckUtils]: 83: Hoare triple {22626#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22627#(<= main_~i~0 39)} is VALID [2018-11-23 13:07:18,288 INFO L273 TraceCheckUtils]: 84: Hoare triple {22627#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22627#(<= main_~i~0 39)} is VALID [2018-11-23 13:07:18,288 INFO L273 TraceCheckUtils]: 85: Hoare triple {22627#(<= main_~i~0 39)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22628#(<= main_~i~0 40)} is VALID [2018-11-23 13:07:18,289 INFO L273 TraceCheckUtils]: 86: Hoare triple {22628#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22628#(<= main_~i~0 40)} is VALID [2018-11-23 13:07:18,290 INFO L273 TraceCheckUtils]: 87: Hoare triple {22628#(<= main_~i~0 40)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22629#(<= main_~i~0 41)} is VALID [2018-11-23 13:07:18,290 INFO L273 TraceCheckUtils]: 88: Hoare triple {22629#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22629#(<= main_~i~0 41)} is VALID [2018-11-23 13:07:18,291 INFO L273 TraceCheckUtils]: 89: Hoare triple {22629#(<= main_~i~0 41)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22630#(<= main_~i~0 42)} is VALID [2018-11-23 13:07:18,291 INFO L273 TraceCheckUtils]: 90: Hoare triple {22630#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22630#(<= main_~i~0 42)} is VALID [2018-11-23 13:07:18,292 INFO L273 TraceCheckUtils]: 91: Hoare triple {22630#(<= main_~i~0 42)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22631#(<= main_~i~0 43)} is VALID [2018-11-23 13:07:18,292 INFO L273 TraceCheckUtils]: 92: Hoare triple {22631#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22631#(<= main_~i~0 43)} is VALID [2018-11-23 13:07:18,293 INFO L273 TraceCheckUtils]: 93: Hoare triple {22631#(<= main_~i~0 43)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22632#(<= main_~i~0 44)} is VALID [2018-11-23 13:07:18,294 INFO L273 TraceCheckUtils]: 94: Hoare triple {22632#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22632#(<= main_~i~0 44)} is VALID [2018-11-23 13:07:18,294 INFO L273 TraceCheckUtils]: 95: Hoare triple {22632#(<= main_~i~0 44)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22633#(<= main_~i~0 45)} is VALID [2018-11-23 13:07:18,295 INFO L273 TraceCheckUtils]: 96: Hoare triple {22633#(<= main_~i~0 45)} assume !(~i~0 < 1024); {22587#false} is VALID [2018-11-23 13:07:18,295 INFO L273 TraceCheckUtils]: 97: Hoare triple {22587#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {22587#false} is VALID [2018-11-23 13:07:18,295 INFO L256 TraceCheckUtils]: 98: Hoare triple {22587#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {22587#false} is VALID [2018-11-23 13:07:18,296 INFO L273 TraceCheckUtils]: 99: Hoare triple {22587#false} ~cond := #in~cond; {22587#false} is VALID [2018-11-23 13:07:18,296 INFO L273 TraceCheckUtils]: 100: Hoare triple {22587#false} assume 0 == ~cond; {22587#false} is VALID [2018-11-23 13:07:18,296 INFO L273 TraceCheckUtils]: 101: Hoare triple {22587#false} assume !false; {22587#false} is VALID [2018-11-23 13:07:18,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:18,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:18,305 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:18,314 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:07:42,252 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-11-23 13:07:42,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:42,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:42,606 INFO L256 TraceCheckUtils]: 0: Hoare triple {22586#true} call ULTIMATE.init(); {22586#true} is VALID [2018-11-23 13:07:42,607 INFO L273 TraceCheckUtils]: 1: Hoare triple {22586#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22586#true} is VALID [2018-11-23 13:07:42,607 INFO L273 TraceCheckUtils]: 2: Hoare triple {22586#true} assume true; {22586#true} is VALID [2018-11-23 13:07:42,607 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22586#true} {22586#true} #35#return; {22586#true} is VALID [2018-11-23 13:07:42,607 INFO L256 TraceCheckUtils]: 4: Hoare triple {22586#true} call #t~ret2 := main(); {22586#true} is VALID [2018-11-23 13:07:42,608 INFO L273 TraceCheckUtils]: 5: Hoare triple {22586#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {22652#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:42,608 INFO L273 TraceCheckUtils]: 6: Hoare triple {22652#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22652#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:42,609 INFO L273 TraceCheckUtils]: 7: Hoare triple {22652#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22589#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:42,610 INFO L273 TraceCheckUtils]: 8: Hoare triple {22589#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22589#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:42,610 INFO L273 TraceCheckUtils]: 9: Hoare triple {22589#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22590#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:42,611 INFO L273 TraceCheckUtils]: 10: Hoare triple {22590#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22590#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:42,611 INFO L273 TraceCheckUtils]: 11: Hoare triple {22590#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22591#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:42,612 INFO L273 TraceCheckUtils]: 12: Hoare triple {22591#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22591#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:42,612 INFO L273 TraceCheckUtils]: 13: Hoare triple {22591#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22592#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:42,613 INFO L273 TraceCheckUtils]: 14: Hoare triple {22592#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22592#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:42,614 INFO L273 TraceCheckUtils]: 15: Hoare triple {22592#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22593#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:42,614 INFO L273 TraceCheckUtils]: 16: Hoare triple {22593#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22593#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:42,615 INFO L273 TraceCheckUtils]: 17: Hoare triple {22593#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22594#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:42,615 INFO L273 TraceCheckUtils]: 18: Hoare triple {22594#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22594#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:42,616 INFO L273 TraceCheckUtils]: 19: Hoare triple {22594#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22595#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:42,616 INFO L273 TraceCheckUtils]: 20: Hoare triple {22595#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22595#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:42,617 INFO L273 TraceCheckUtils]: 21: Hoare triple {22595#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22596#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:42,618 INFO L273 TraceCheckUtils]: 22: Hoare triple {22596#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22596#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:42,618 INFO L273 TraceCheckUtils]: 23: Hoare triple {22596#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22597#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:42,619 INFO L273 TraceCheckUtils]: 24: Hoare triple {22597#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22597#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:42,619 INFO L273 TraceCheckUtils]: 25: Hoare triple {22597#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22598#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:42,620 INFO L273 TraceCheckUtils]: 26: Hoare triple {22598#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22598#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:42,620 INFO L273 TraceCheckUtils]: 27: Hoare triple {22598#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22599#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:42,621 INFO L273 TraceCheckUtils]: 28: Hoare triple {22599#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22599#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:42,622 INFO L273 TraceCheckUtils]: 29: Hoare triple {22599#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22600#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:42,622 INFO L273 TraceCheckUtils]: 30: Hoare triple {22600#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22600#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:42,623 INFO L273 TraceCheckUtils]: 31: Hoare triple {22600#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22601#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:42,623 INFO L273 TraceCheckUtils]: 32: Hoare triple {22601#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22601#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:42,624 INFO L273 TraceCheckUtils]: 33: Hoare triple {22601#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22602#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:42,624 INFO L273 TraceCheckUtils]: 34: Hoare triple {22602#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22602#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:42,625 INFO L273 TraceCheckUtils]: 35: Hoare triple {22602#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22603#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:42,626 INFO L273 TraceCheckUtils]: 36: Hoare triple {22603#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22603#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:42,626 INFO L273 TraceCheckUtils]: 37: Hoare triple {22603#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22604#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:42,627 INFO L273 TraceCheckUtils]: 38: Hoare triple {22604#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22604#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:42,627 INFO L273 TraceCheckUtils]: 39: Hoare triple {22604#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22605#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:42,628 INFO L273 TraceCheckUtils]: 40: Hoare triple {22605#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22605#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:42,628 INFO L273 TraceCheckUtils]: 41: Hoare triple {22605#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22606#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:42,629 INFO L273 TraceCheckUtils]: 42: Hoare triple {22606#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22606#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:42,630 INFO L273 TraceCheckUtils]: 43: Hoare triple {22606#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22607#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:42,630 INFO L273 TraceCheckUtils]: 44: Hoare triple {22607#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22607#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:42,631 INFO L273 TraceCheckUtils]: 45: Hoare triple {22607#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22608#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:42,631 INFO L273 TraceCheckUtils]: 46: Hoare triple {22608#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22608#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:42,632 INFO L273 TraceCheckUtils]: 47: Hoare triple {22608#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22609#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:42,632 INFO L273 TraceCheckUtils]: 48: Hoare triple {22609#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22609#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:42,633 INFO L273 TraceCheckUtils]: 49: Hoare triple {22609#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22610#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:42,634 INFO L273 TraceCheckUtils]: 50: Hoare triple {22610#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22610#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:42,634 INFO L273 TraceCheckUtils]: 51: Hoare triple {22610#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22611#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:42,635 INFO L273 TraceCheckUtils]: 52: Hoare triple {22611#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22611#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:42,635 INFO L273 TraceCheckUtils]: 53: Hoare triple {22611#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22612#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:42,636 INFO L273 TraceCheckUtils]: 54: Hoare triple {22612#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22612#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:42,636 INFO L273 TraceCheckUtils]: 55: Hoare triple {22612#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22613#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:42,637 INFO L273 TraceCheckUtils]: 56: Hoare triple {22613#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22613#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:42,638 INFO L273 TraceCheckUtils]: 57: Hoare triple {22613#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22614#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:42,638 INFO L273 TraceCheckUtils]: 58: Hoare triple {22614#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22614#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:42,639 INFO L273 TraceCheckUtils]: 59: Hoare triple {22614#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22615#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:42,639 INFO L273 TraceCheckUtils]: 60: Hoare triple {22615#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22615#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:42,640 INFO L273 TraceCheckUtils]: 61: Hoare triple {22615#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22616#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:42,640 INFO L273 TraceCheckUtils]: 62: Hoare triple {22616#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22616#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:42,641 INFO L273 TraceCheckUtils]: 63: Hoare triple {22616#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22617#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:42,642 INFO L273 TraceCheckUtils]: 64: Hoare triple {22617#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22617#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:42,642 INFO L273 TraceCheckUtils]: 65: Hoare triple {22617#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22618#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:42,643 INFO L273 TraceCheckUtils]: 66: Hoare triple {22618#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22618#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:42,643 INFO L273 TraceCheckUtils]: 67: Hoare triple {22618#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22619#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:42,644 INFO L273 TraceCheckUtils]: 68: Hoare triple {22619#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22619#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:42,644 INFO L273 TraceCheckUtils]: 69: Hoare triple {22619#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22620#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:42,645 INFO L273 TraceCheckUtils]: 70: Hoare triple {22620#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22620#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:42,646 INFO L273 TraceCheckUtils]: 71: Hoare triple {22620#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22621#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:42,646 INFO L273 TraceCheckUtils]: 72: Hoare triple {22621#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22621#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:42,647 INFO L273 TraceCheckUtils]: 73: Hoare triple {22621#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22622#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:42,647 INFO L273 TraceCheckUtils]: 74: Hoare triple {22622#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22622#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:42,648 INFO L273 TraceCheckUtils]: 75: Hoare triple {22622#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22623#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:42,649 INFO L273 TraceCheckUtils]: 76: Hoare triple {22623#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22623#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:42,649 INFO L273 TraceCheckUtils]: 77: Hoare triple {22623#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22624#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:42,650 INFO L273 TraceCheckUtils]: 78: Hoare triple {22624#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22624#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:42,650 INFO L273 TraceCheckUtils]: 79: Hoare triple {22624#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22625#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:42,651 INFO L273 TraceCheckUtils]: 80: Hoare triple {22625#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22625#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:42,652 INFO L273 TraceCheckUtils]: 81: Hoare triple {22625#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22626#(<= main_~i~0 38)} is VALID [2018-11-23 13:07:42,652 INFO L273 TraceCheckUtils]: 82: Hoare triple {22626#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22626#(<= main_~i~0 38)} is VALID [2018-11-23 13:07:42,653 INFO L273 TraceCheckUtils]: 83: Hoare triple {22626#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22627#(<= main_~i~0 39)} is VALID [2018-11-23 13:07:42,653 INFO L273 TraceCheckUtils]: 84: Hoare triple {22627#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22627#(<= main_~i~0 39)} is VALID [2018-11-23 13:07:42,654 INFO L273 TraceCheckUtils]: 85: Hoare triple {22627#(<= main_~i~0 39)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22628#(<= main_~i~0 40)} is VALID [2018-11-23 13:07:42,654 INFO L273 TraceCheckUtils]: 86: Hoare triple {22628#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22628#(<= main_~i~0 40)} is VALID [2018-11-23 13:07:42,655 INFO L273 TraceCheckUtils]: 87: Hoare triple {22628#(<= main_~i~0 40)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22629#(<= main_~i~0 41)} is VALID [2018-11-23 13:07:42,656 INFO L273 TraceCheckUtils]: 88: Hoare triple {22629#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22629#(<= main_~i~0 41)} is VALID [2018-11-23 13:07:42,656 INFO L273 TraceCheckUtils]: 89: Hoare triple {22629#(<= main_~i~0 41)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22630#(<= main_~i~0 42)} is VALID [2018-11-23 13:07:42,657 INFO L273 TraceCheckUtils]: 90: Hoare triple {22630#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22630#(<= main_~i~0 42)} is VALID [2018-11-23 13:07:42,657 INFO L273 TraceCheckUtils]: 91: Hoare triple {22630#(<= main_~i~0 42)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22631#(<= main_~i~0 43)} is VALID [2018-11-23 13:07:42,658 INFO L273 TraceCheckUtils]: 92: Hoare triple {22631#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22631#(<= main_~i~0 43)} is VALID [2018-11-23 13:07:42,658 INFO L273 TraceCheckUtils]: 93: Hoare triple {22631#(<= main_~i~0 43)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22632#(<= main_~i~0 44)} is VALID [2018-11-23 13:07:42,659 INFO L273 TraceCheckUtils]: 94: Hoare triple {22632#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22632#(<= main_~i~0 44)} is VALID [2018-11-23 13:07:42,660 INFO L273 TraceCheckUtils]: 95: Hoare triple {22632#(<= main_~i~0 44)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22633#(<= main_~i~0 45)} is VALID [2018-11-23 13:07:42,660 INFO L273 TraceCheckUtils]: 96: Hoare triple {22633#(<= main_~i~0 45)} assume !(~i~0 < 1024); {22587#false} is VALID [2018-11-23 13:07:42,660 INFO L273 TraceCheckUtils]: 97: Hoare triple {22587#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {22587#false} is VALID [2018-11-23 13:07:42,661 INFO L256 TraceCheckUtils]: 98: Hoare triple {22587#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {22587#false} is VALID [2018-11-23 13:07:42,661 INFO L273 TraceCheckUtils]: 99: Hoare triple {22587#false} ~cond := #in~cond; {22587#false} is VALID [2018-11-23 13:07:42,661 INFO L273 TraceCheckUtils]: 100: Hoare triple {22587#false} assume 0 == ~cond; {22587#false} is VALID [2018-11-23 13:07:42,661 INFO L273 TraceCheckUtils]: 101: Hoare triple {22587#false} assume !false; {22587#false} is VALID [2018-11-23 13:07:42,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:42,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:42,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2018-11-23 13:07:42,699 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 102 [2018-11-23 13:07:42,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:42,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states. [2018-11-23 13:07:42,800 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 13:07:42,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-23 13:07:42,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-23 13:07:42,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 13:07:42,801 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 49 states. [2018-11-23 13:07:43,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:43,690 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-11-23 13:07:43,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 13:07:43,690 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 102 [2018-11-23 13:07:43,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:43,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 13:07:43,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 112 transitions. [2018-11-23 13:07:43,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 13:07:43,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 112 transitions. [2018-11-23 13:07:43,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 112 transitions. [2018-11-23 13:07:43,792 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:43,794 INFO L225 Difference]: With dead ends: 112 [2018-11-23 13:07:43,795 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 13:07:43,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 13:07:43,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 13:07:43,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-11-23 13:07:43,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:43,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 105 states. [2018-11-23 13:07:43,931 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 105 states. [2018-11-23 13:07:43,931 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 105 states. [2018-11-23 13:07:43,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:43,933 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-11-23 13:07:43,933 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-11-23 13:07:43,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:43,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:43,934 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 106 states. [2018-11-23 13:07:43,934 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 106 states. [2018-11-23 13:07:43,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:43,935 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-11-23 13:07:43,935 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-11-23 13:07:43,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:43,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:43,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:43,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:43,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 13:07:43,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-11-23 13:07:43,937 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2018-11-23 13:07:43,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:43,937 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-11-23 13:07:43,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-23 13:07:43,937 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-11-23 13:07:43,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-23 13:07:43,938 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:43,938 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:43,938 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:43,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:43,938 INFO L82 PathProgramCache]: Analyzing trace with hash 382171577, now seen corresponding path program 46 times [2018-11-23 13:07:43,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:43,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:43,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:43,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:43,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:46,160 INFO L256 TraceCheckUtils]: 0: Hoare triple {23477#true} call ULTIMATE.init(); {23477#true} is VALID [2018-11-23 13:07:46,161 INFO L273 TraceCheckUtils]: 1: Hoare triple {23477#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23477#true} is VALID [2018-11-23 13:07:46,161 INFO L273 TraceCheckUtils]: 2: Hoare triple {23477#true} assume true; {23477#true} is VALID [2018-11-23 13:07:46,161 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23477#true} {23477#true} #35#return; {23477#true} is VALID [2018-11-23 13:07:46,161 INFO L256 TraceCheckUtils]: 4: Hoare triple {23477#true} call #t~ret2 := main(); {23477#true} is VALID [2018-11-23 13:07:46,161 INFO L273 TraceCheckUtils]: 5: Hoare triple {23477#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {23479#(= main_~i~0 0)} is VALID [2018-11-23 13:07:46,161 INFO L273 TraceCheckUtils]: 6: Hoare triple {23479#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23479#(= main_~i~0 0)} is VALID [2018-11-23 13:07:46,162 INFO L273 TraceCheckUtils]: 7: Hoare triple {23479#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23480#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:46,162 INFO L273 TraceCheckUtils]: 8: Hoare triple {23480#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23480#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:46,163 INFO L273 TraceCheckUtils]: 9: Hoare triple {23480#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23481#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:46,163 INFO L273 TraceCheckUtils]: 10: Hoare triple {23481#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23481#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:46,164 INFO L273 TraceCheckUtils]: 11: Hoare triple {23481#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23482#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:46,164 INFO L273 TraceCheckUtils]: 12: Hoare triple {23482#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23482#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:46,165 INFO L273 TraceCheckUtils]: 13: Hoare triple {23482#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23483#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:46,165 INFO L273 TraceCheckUtils]: 14: Hoare triple {23483#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23483#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:46,165 INFO L273 TraceCheckUtils]: 15: Hoare triple {23483#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23484#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:46,166 INFO L273 TraceCheckUtils]: 16: Hoare triple {23484#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23484#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:46,167 INFO L273 TraceCheckUtils]: 17: Hoare triple {23484#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23485#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:46,167 INFO L273 TraceCheckUtils]: 18: Hoare triple {23485#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23485#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:46,168 INFO L273 TraceCheckUtils]: 19: Hoare triple {23485#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23486#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:46,168 INFO L273 TraceCheckUtils]: 20: Hoare triple {23486#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23486#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:46,169 INFO L273 TraceCheckUtils]: 21: Hoare triple {23486#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23487#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:46,170 INFO L273 TraceCheckUtils]: 22: Hoare triple {23487#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23487#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:46,170 INFO L273 TraceCheckUtils]: 23: Hoare triple {23487#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23488#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:46,171 INFO L273 TraceCheckUtils]: 24: Hoare triple {23488#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23488#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:46,172 INFO L273 TraceCheckUtils]: 25: Hoare triple {23488#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23489#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:46,172 INFO L273 TraceCheckUtils]: 26: Hoare triple {23489#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23489#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:46,173 INFO L273 TraceCheckUtils]: 27: Hoare triple {23489#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23490#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:46,173 INFO L273 TraceCheckUtils]: 28: Hoare triple {23490#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23490#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:46,174 INFO L273 TraceCheckUtils]: 29: Hoare triple {23490#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23491#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:46,174 INFO L273 TraceCheckUtils]: 30: Hoare triple {23491#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23491#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:46,175 INFO L273 TraceCheckUtils]: 31: Hoare triple {23491#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23492#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:46,176 INFO L273 TraceCheckUtils]: 32: Hoare triple {23492#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23492#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:46,176 INFO L273 TraceCheckUtils]: 33: Hoare triple {23492#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23493#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:46,177 INFO L273 TraceCheckUtils]: 34: Hoare triple {23493#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23493#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:46,178 INFO L273 TraceCheckUtils]: 35: Hoare triple {23493#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23494#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:46,178 INFO L273 TraceCheckUtils]: 36: Hoare triple {23494#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23494#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:46,179 INFO L273 TraceCheckUtils]: 37: Hoare triple {23494#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23495#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:46,179 INFO L273 TraceCheckUtils]: 38: Hoare triple {23495#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23495#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:46,180 INFO L273 TraceCheckUtils]: 39: Hoare triple {23495#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23496#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:46,181 INFO L273 TraceCheckUtils]: 40: Hoare triple {23496#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23496#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:46,181 INFO L273 TraceCheckUtils]: 41: Hoare triple {23496#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23497#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:46,182 INFO L273 TraceCheckUtils]: 42: Hoare triple {23497#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23497#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:46,182 INFO L273 TraceCheckUtils]: 43: Hoare triple {23497#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23498#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:46,183 INFO L273 TraceCheckUtils]: 44: Hoare triple {23498#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23498#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:46,184 INFO L273 TraceCheckUtils]: 45: Hoare triple {23498#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23499#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:46,184 INFO L273 TraceCheckUtils]: 46: Hoare triple {23499#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23499#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:46,185 INFO L273 TraceCheckUtils]: 47: Hoare triple {23499#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23500#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:46,185 INFO L273 TraceCheckUtils]: 48: Hoare triple {23500#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23500#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:46,186 INFO L273 TraceCheckUtils]: 49: Hoare triple {23500#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23501#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:46,187 INFO L273 TraceCheckUtils]: 50: Hoare triple {23501#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23501#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:46,187 INFO L273 TraceCheckUtils]: 51: Hoare triple {23501#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23502#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:46,188 INFO L273 TraceCheckUtils]: 52: Hoare triple {23502#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23502#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:46,189 INFO L273 TraceCheckUtils]: 53: Hoare triple {23502#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23503#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:46,189 INFO L273 TraceCheckUtils]: 54: Hoare triple {23503#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23503#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:46,190 INFO L273 TraceCheckUtils]: 55: Hoare triple {23503#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23504#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:46,190 INFO L273 TraceCheckUtils]: 56: Hoare triple {23504#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23504#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:46,191 INFO L273 TraceCheckUtils]: 57: Hoare triple {23504#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23505#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:46,192 INFO L273 TraceCheckUtils]: 58: Hoare triple {23505#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23505#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:46,192 INFO L273 TraceCheckUtils]: 59: Hoare triple {23505#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23506#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:46,193 INFO L273 TraceCheckUtils]: 60: Hoare triple {23506#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23506#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:46,193 INFO L273 TraceCheckUtils]: 61: Hoare triple {23506#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23507#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:46,194 INFO L273 TraceCheckUtils]: 62: Hoare triple {23507#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23507#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:46,195 INFO L273 TraceCheckUtils]: 63: Hoare triple {23507#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23508#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:46,195 INFO L273 TraceCheckUtils]: 64: Hoare triple {23508#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23508#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:46,196 INFO L273 TraceCheckUtils]: 65: Hoare triple {23508#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23509#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:46,196 INFO L273 TraceCheckUtils]: 66: Hoare triple {23509#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23509#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:46,199 INFO L273 TraceCheckUtils]: 67: Hoare triple {23509#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23510#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:46,199 INFO L273 TraceCheckUtils]: 68: Hoare triple {23510#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23510#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:46,200 INFO L273 TraceCheckUtils]: 69: Hoare triple {23510#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23511#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:46,200 INFO L273 TraceCheckUtils]: 70: Hoare triple {23511#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23511#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:46,200 INFO L273 TraceCheckUtils]: 71: Hoare triple {23511#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23512#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:46,201 INFO L273 TraceCheckUtils]: 72: Hoare triple {23512#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23512#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:46,201 INFO L273 TraceCheckUtils]: 73: Hoare triple {23512#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23513#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:46,202 INFO L273 TraceCheckUtils]: 74: Hoare triple {23513#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23513#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:46,202 INFO L273 TraceCheckUtils]: 75: Hoare triple {23513#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23514#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:46,203 INFO L273 TraceCheckUtils]: 76: Hoare triple {23514#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23514#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:46,204 INFO L273 TraceCheckUtils]: 77: Hoare triple {23514#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23515#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:46,204 INFO L273 TraceCheckUtils]: 78: Hoare triple {23515#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23515#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:46,205 INFO L273 TraceCheckUtils]: 79: Hoare triple {23515#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23516#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:46,205 INFO L273 TraceCheckUtils]: 80: Hoare triple {23516#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23516#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:46,206 INFO L273 TraceCheckUtils]: 81: Hoare triple {23516#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23517#(<= main_~i~0 38)} is VALID [2018-11-23 13:07:46,206 INFO L273 TraceCheckUtils]: 82: Hoare triple {23517#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23517#(<= main_~i~0 38)} is VALID [2018-11-23 13:07:46,207 INFO L273 TraceCheckUtils]: 83: Hoare triple {23517#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23518#(<= main_~i~0 39)} is VALID [2018-11-23 13:07:46,208 INFO L273 TraceCheckUtils]: 84: Hoare triple {23518#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23518#(<= main_~i~0 39)} is VALID [2018-11-23 13:07:46,208 INFO L273 TraceCheckUtils]: 85: Hoare triple {23518#(<= main_~i~0 39)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23519#(<= main_~i~0 40)} is VALID [2018-11-23 13:07:46,209 INFO L273 TraceCheckUtils]: 86: Hoare triple {23519#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23519#(<= main_~i~0 40)} is VALID [2018-11-23 13:07:46,210 INFO L273 TraceCheckUtils]: 87: Hoare triple {23519#(<= main_~i~0 40)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23520#(<= main_~i~0 41)} is VALID [2018-11-23 13:07:46,210 INFO L273 TraceCheckUtils]: 88: Hoare triple {23520#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23520#(<= main_~i~0 41)} is VALID [2018-11-23 13:07:46,211 INFO L273 TraceCheckUtils]: 89: Hoare triple {23520#(<= main_~i~0 41)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23521#(<= main_~i~0 42)} is VALID [2018-11-23 13:07:46,211 INFO L273 TraceCheckUtils]: 90: Hoare triple {23521#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23521#(<= main_~i~0 42)} is VALID [2018-11-23 13:07:46,212 INFO L273 TraceCheckUtils]: 91: Hoare triple {23521#(<= main_~i~0 42)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23522#(<= main_~i~0 43)} is VALID [2018-11-23 13:07:46,213 INFO L273 TraceCheckUtils]: 92: Hoare triple {23522#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23522#(<= main_~i~0 43)} is VALID [2018-11-23 13:07:46,213 INFO L273 TraceCheckUtils]: 93: Hoare triple {23522#(<= main_~i~0 43)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23523#(<= main_~i~0 44)} is VALID [2018-11-23 13:07:46,214 INFO L273 TraceCheckUtils]: 94: Hoare triple {23523#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23523#(<= main_~i~0 44)} is VALID [2018-11-23 13:07:46,214 INFO L273 TraceCheckUtils]: 95: Hoare triple {23523#(<= main_~i~0 44)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23524#(<= main_~i~0 45)} is VALID [2018-11-23 13:07:46,215 INFO L273 TraceCheckUtils]: 96: Hoare triple {23524#(<= main_~i~0 45)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23524#(<= main_~i~0 45)} is VALID [2018-11-23 13:07:46,216 INFO L273 TraceCheckUtils]: 97: Hoare triple {23524#(<= main_~i~0 45)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23525#(<= main_~i~0 46)} is VALID [2018-11-23 13:07:46,216 INFO L273 TraceCheckUtils]: 98: Hoare triple {23525#(<= main_~i~0 46)} assume !(~i~0 < 1024); {23478#false} is VALID [2018-11-23 13:07:46,217 INFO L273 TraceCheckUtils]: 99: Hoare triple {23478#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {23478#false} is VALID [2018-11-23 13:07:46,217 INFO L256 TraceCheckUtils]: 100: Hoare triple {23478#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {23478#false} is VALID [2018-11-23 13:07:46,217 INFO L273 TraceCheckUtils]: 101: Hoare triple {23478#false} ~cond := #in~cond; {23478#false} is VALID [2018-11-23 13:07:46,217 INFO L273 TraceCheckUtils]: 102: Hoare triple {23478#false} assume 0 == ~cond; {23478#false} is VALID [2018-11-23 13:07:46,217 INFO L273 TraceCheckUtils]: 103: Hoare triple {23478#false} assume !false; {23478#false} is VALID [2018-11-23 13:07:46,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:46,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:46,226 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:46,236 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:07:46,276 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:07:46,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:46,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:46,632 INFO L256 TraceCheckUtils]: 0: Hoare triple {23477#true} call ULTIMATE.init(); {23477#true} is VALID [2018-11-23 13:07:46,632 INFO L273 TraceCheckUtils]: 1: Hoare triple {23477#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23477#true} is VALID [2018-11-23 13:07:46,632 INFO L273 TraceCheckUtils]: 2: Hoare triple {23477#true} assume true; {23477#true} is VALID [2018-11-23 13:07:46,633 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23477#true} {23477#true} #35#return; {23477#true} is VALID [2018-11-23 13:07:46,633 INFO L256 TraceCheckUtils]: 4: Hoare triple {23477#true} call #t~ret2 := main(); {23477#true} is VALID [2018-11-23 13:07:46,633 INFO L273 TraceCheckUtils]: 5: Hoare triple {23477#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {23544#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:46,634 INFO L273 TraceCheckUtils]: 6: Hoare triple {23544#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23544#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:46,635 INFO L273 TraceCheckUtils]: 7: Hoare triple {23544#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23480#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:46,635 INFO L273 TraceCheckUtils]: 8: Hoare triple {23480#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23480#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:46,635 INFO L273 TraceCheckUtils]: 9: Hoare triple {23480#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23481#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:46,636 INFO L273 TraceCheckUtils]: 10: Hoare triple {23481#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23481#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:46,636 INFO L273 TraceCheckUtils]: 11: Hoare triple {23481#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23482#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:46,636 INFO L273 TraceCheckUtils]: 12: Hoare triple {23482#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23482#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:46,637 INFO L273 TraceCheckUtils]: 13: Hoare triple {23482#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23483#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:46,637 INFO L273 TraceCheckUtils]: 14: Hoare triple {23483#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23483#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:46,638 INFO L273 TraceCheckUtils]: 15: Hoare triple {23483#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23484#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:46,638 INFO L273 TraceCheckUtils]: 16: Hoare triple {23484#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23484#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:46,639 INFO L273 TraceCheckUtils]: 17: Hoare triple {23484#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23485#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:46,639 INFO L273 TraceCheckUtils]: 18: Hoare triple {23485#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23485#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:46,640 INFO L273 TraceCheckUtils]: 19: Hoare triple {23485#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23486#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:46,641 INFO L273 TraceCheckUtils]: 20: Hoare triple {23486#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23486#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:46,641 INFO L273 TraceCheckUtils]: 21: Hoare triple {23486#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23487#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:46,642 INFO L273 TraceCheckUtils]: 22: Hoare triple {23487#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23487#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:46,642 INFO L273 TraceCheckUtils]: 23: Hoare triple {23487#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23488#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:46,643 INFO L273 TraceCheckUtils]: 24: Hoare triple {23488#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23488#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:46,644 INFO L273 TraceCheckUtils]: 25: Hoare triple {23488#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23489#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:46,644 INFO L273 TraceCheckUtils]: 26: Hoare triple {23489#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23489#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:46,645 INFO L273 TraceCheckUtils]: 27: Hoare triple {23489#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23490#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:46,645 INFO L273 TraceCheckUtils]: 28: Hoare triple {23490#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23490#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:46,646 INFO L273 TraceCheckUtils]: 29: Hoare triple {23490#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23491#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:46,647 INFO L273 TraceCheckUtils]: 30: Hoare triple {23491#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23491#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:46,647 INFO L273 TraceCheckUtils]: 31: Hoare triple {23491#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23492#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:46,648 INFO L273 TraceCheckUtils]: 32: Hoare triple {23492#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23492#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:46,649 INFO L273 TraceCheckUtils]: 33: Hoare triple {23492#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23493#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:46,649 INFO L273 TraceCheckUtils]: 34: Hoare triple {23493#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23493#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:46,650 INFO L273 TraceCheckUtils]: 35: Hoare triple {23493#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23494#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:46,650 INFO L273 TraceCheckUtils]: 36: Hoare triple {23494#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23494#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:46,651 INFO L273 TraceCheckUtils]: 37: Hoare triple {23494#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23495#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:46,651 INFO L273 TraceCheckUtils]: 38: Hoare triple {23495#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23495#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:46,652 INFO L273 TraceCheckUtils]: 39: Hoare triple {23495#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23496#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:46,653 INFO L273 TraceCheckUtils]: 40: Hoare triple {23496#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23496#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:46,653 INFO L273 TraceCheckUtils]: 41: Hoare triple {23496#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23497#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:46,654 INFO L273 TraceCheckUtils]: 42: Hoare triple {23497#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23497#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:46,655 INFO L273 TraceCheckUtils]: 43: Hoare triple {23497#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23498#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:46,655 INFO L273 TraceCheckUtils]: 44: Hoare triple {23498#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23498#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:46,656 INFO L273 TraceCheckUtils]: 45: Hoare triple {23498#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23499#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:46,656 INFO L273 TraceCheckUtils]: 46: Hoare triple {23499#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23499#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:46,657 INFO L273 TraceCheckUtils]: 47: Hoare triple {23499#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23500#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:46,657 INFO L273 TraceCheckUtils]: 48: Hoare triple {23500#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23500#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:46,658 INFO L273 TraceCheckUtils]: 49: Hoare triple {23500#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23501#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:46,659 INFO L273 TraceCheckUtils]: 50: Hoare triple {23501#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23501#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:46,659 INFO L273 TraceCheckUtils]: 51: Hoare triple {23501#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23502#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:46,660 INFO L273 TraceCheckUtils]: 52: Hoare triple {23502#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23502#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:46,660 INFO L273 TraceCheckUtils]: 53: Hoare triple {23502#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23503#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:46,661 INFO L273 TraceCheckUtils]: 54: Hoare triple {23503#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23503#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:46,662 INFO L273 TraceCheckUtils]: 55: Hoare triple {23503#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23504#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:46,662 INFO L273 TraceCheckUtils]: 56: Hoare triple {23504#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23504#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:46,663 INFO L273 TraceCheckUtils]: 57: Hoare triple {23504#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23505#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:46,663 INFO L273 TraceCheckUtils]: 58: Hoare triple {23505#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23505#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:46,664 INFO L273 TraceCheckUtils]: 59: Hoare triple {23505#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23506#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:46,664 INFO L273 TraceCheckUtils]: 60: Hoare triple {23506#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23506#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:46,665 INFO L273 TraceCheckUtils]: 61: Hoare triple {23506#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23507#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:46,666 INFO L273 TraceCheckUtils]: 62: Hoare triple {23507#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23507#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:46,666 INFO L273 TraceCheckUtils]: 63: Hoare triple {23507#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23508#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:46,667 INFO L273 TraceCheckUtils]: 64: Hoare triple {23508#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23508#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:46,668 INFO L273 TraceCheckUtils]: 65: Hoare triple {23508#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23509#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:46,668 INFO L273 TraceCheckUtils]: 66: Hoare triple {23509#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23509#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:46,669 INFO L273 TraceCheckUtils]: 67: Hoare triple {23509#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23510#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:46,669 INFO L273 TraceCheckUtils]: 68: Hoare triple {23510#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23510#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:46,670 INFO L273 TraceCheckUtils]: 69: Hoare triple {23510#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23511#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:46,670 INFO L273 TraceCheckUtils]: 70: Hoare triple {23511#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23511#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:46,671 INFO L273 TraceCheckUtils]: 71: Hoare triple {23511#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23512#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:46,672 INFO L273 TraceCheckUtils]: 72: Hoare triple {23512#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23512#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:46,672 INFO L273 TraceCheckUtils]: 73: Hoare triple {23512#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23513#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:46,673 INFO L273 TraceCheckUtils]: 74: Hoare triple {23513#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23513#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:46,674 INFO L273 TraceCheckUtils]: 75: Hoare triple {23513#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23514#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:46,674 INFO L273 TraceCheckUtils]: 76: Hoare triple {23514#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23514#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:46,675 INFO L273 TraceCheckUtils]: 77: Hoare triple {23514#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23515#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:46,675 INFO L273 TraceCheckUtils]: 78: Hoare triple {23515#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23515#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:46,676 INFO L273 TraceCheckUtils]: 79: Hoare triple {23515#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23516#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:46,676 INFO L273 TraceCheckUtils]: 80: Hoare triple {23516#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23516#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:46,677 INFO L273 TraceCheckUtils]: 81: Hoare triple {23516#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23517#(<= main_~i~0 38)} is VALID [2018-11-23 13:07:46,677 INFO L273 TraceCheckUtils]: 82: Hoare triple {23517#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23517#(<= main_~i~0 38)} is VALID [2018-11-23 13:07:46,678 INFO L273 TraceCheckUtils]: 83: Hoare triple {23517#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23518#(<= main_~i~0 39)} is VALID [2018-11-23 13:07:46,679 INFO L273 TraceCheckUtils]: 84: Hoare triple {23518#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23518#(<= main_~i~0 39)} is VALID [2018-11-23 13:07:46,679 INFO L273 TraceCheckUtils]: 85: Hoare triple {23518#(<= main_~i~0 39)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23519#(<= main_~i~0 40)} is VALID [2018-11-23 13:07:46,680 INFO L273 TraceCheckUtils]: 86: Hoare triple {23519#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23519#(<= main_~i~0 40)} is VALID [2018-11-23 13:07:46,681 INFO L273 TraceCheckUtils]: 87: Hoare triple {23519#(<= main_~i~0 40)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23520#(<= main_~i~0 41)} is VALID [2018-11-23 13:07:46,681 INFO L273 TraceCheckUtils]: 88: Hoare triple {23520#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23520#(<= main_~i~0 41)} is VALID [2018-11-23 13:07:46,682 INFO L273 TraceCheckUtils]: 89: Hoare triple {23520#(<= main_~i~0 41)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23521#(<= main_~i~0 42)} is VALID [2018-11-23 13:07:46,682 INFO L273 TraceCheckUtils]: 90: Hoare triple {23521#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23521#(<= main_~i~0 42)} is VALID [2018-11-23 13:07:46,683 INFO L273 TraceCheckUtils]: 91: Hoare triple {23521#(<= main_~i~0 42)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23522#(<= main_~i~0 43)} is VALID [2018-11-23 13:07:46,684 INFO L273 TraceCheckUtils]: 92: Hoare triple {23522#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23522#(<= main_~i~0 43)} is VALID [2018-11-23 13:07:46,684 INFO L273 TraceCheckUtils]: 93: Hoare triple {23522#(<= main_~i~0 43)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23523#(<= main_~i~0 44)} is VALID [2018-11-23 13:07:46,685 INFO L273 TraceCheckUtils]: 94: Hoare triple {23523#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23523#(<= main_~i~0 44)} is VALID [2018-11-23 13:07:46,685 INFO L273 TraceCheckUtils]: 95: Hoare triple {23523#(<= main_~i~0 44)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23524#(<= main_~i~0 45)} is VALID [2018-11-23 13:07:46,686 INFO L273 TraceCheckUtils]: 96: Hoare triple {23524#(<= main_~i~0 45)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23524#(<= main_~i~0 45)} is VALID [2018-11-23 13:07:46,687 INFO L273 TraceCheckUtils]: 97: Hoare triple {23524#(<= main_~i~0 45)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23525#(<= main_~i~0 46)} is VALID [2018-11-23 13:07:46,687 INFO L273 TraceCheckUtils]: 98: Hoare triple {23525#(<= main_~i~0 46)} assume !(~i~0 < 1024); {23478#false} is VALID [2018-11-23 13:07:46,688 INFO L273 TraceCheckUtils]: 99: Hoare triple {23478#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {23478#false} is VALID [2018-11-23 13:07:46,688 INFO L256 TraceCheckUtils]: 100: Hoare triple {23478#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {23478#false} is VALID [2018-11-23 13:07:46,688 INFO L273 TraceCheckUtils]: 101: Hoare triple {23478#false} ~cond := #in~cond; {23478#false} is VALID [2018-11-23 13:07:46,688 INFO L273 TraceCheckUtils]: 102: Hoare triple {23478#false} assume 0 == ~cond; {23478#false} is VALID [2018-11-23 13:07:46,688 INFO L273 TraceCheckUtils]: 103: Hoare triple {23478#false} assume !false; {23478#false} is VALID [2018-11-23 13:07:46,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:46,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:46,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2018-11-23 13:07:46,716 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 104 [2018-11-23 13:07:46,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:46,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2018-11-23 13:07:46,979 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:46,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-23 13:07:46,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-23 13:07:46,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 13:07:46,980 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 50 states. [2018-11-23 13:07:47,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:47,510 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-11-23 13:07:47,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-23 13:07:47,510 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 104 [2018-11-23 13:07:47,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:47,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 13:07:47,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 114 transitions. [2018-11-23 13:07:47,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 13:07:47,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 114 transitions. [2018-11-23 13:07:47,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 114 transitions. [2018-11-23 13:07:47,617 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 13:07:47,619 INFO L225 Difference]: With dead ends: 114 [2018-11-23 13:07:47,619 INFO L226 Difference]: Without dead ends: 108 [2018-11-23 13:07:47,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 13:07:47,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-23 13:07:48,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-11-23 13:07:48,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:48,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 107 states. [2018-11-23 13:07:48,022 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 107 states. [2018-11-23 13:07:48,022 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 107 states. [2018-11-23 13:07:48,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:48,023 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-11-23 13:07:48,024 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-11-23 13:07:48,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:48,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:48,024 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 108 states. [2018-11-23 13:07:48,024 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 108 states. [2018-11-23 13:07:48,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:48,026 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-11-23 13:07:48,026 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-11-23 13:07:48,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:48,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:48,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:48,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:48,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-23 13:07:48,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-11-23 13:07:48,028 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2018-11-23 13:07:48,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:48,028 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-11-23 13:07:48,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-23 13:07:48,028 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-11-23 13:07:48,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-23 13:07:48,029 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:48,029 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:48,029 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:48,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:48,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1353943643, now seen corresponding path program 47 times [2018-11-23 13:07:48,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:48,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:48,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:48,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:48,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:49,356 INFO L256 TraceCheckUtils]: 0: Hoare triple {24385#true} call ULTIMATE.init(); {24385#true} is VALID [2018-11-23 13:07:49,356 INFO L273 TraceCheckUtils]: 1: Hoare triple {24385#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24385#true} is VALID [2018-11-23 13:07:49,356 INFO L273 TraceCheckUtils]: 2: Hoare triple {24385#true} assume true; {24385#true} is VALID [2018-11-23 13:07:49,356 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24385#true} {24385#true} #35#return; {24385#true} is VALID [2018-11-23 13:07:49,356 INFO L256 TraceCheckUtils]: 4: Hoare triple {24385#true} call #t~ret2 := main(); {24385#true} is VALID [2018-11-23 13:07:49,357 INFO L273 TraceCheckUtils]: 5: Hoare triple {24385#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {24387#(= main_~i~0 0)} is VALID [2018-11-23 13:07:49,357 INFO L273 TraceCheckUtils]: 6: Hoare triple {24387#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24387#(= main_~i~0 0)} is VALID [2018-11-23 13:07:49,358 INFO L273 TraceCheckUtils]: 7: Hoare triple {24387#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24388#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:49,358 INFO L273 TraceCheckUtils]: 8: Hoare triple {24388#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24388#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:49,359 INFO L273 TraceCheckUtils]: 9: Hoare triple {24388#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24389#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:49,360 INFO L273 TraceCheckUtils]: 10: Hoare triple {24389#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24389#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:49,360 INFO L273 TraceCheckUtils]: 11: Hoare triple {24389#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24390#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:49,361 INFO L273 TraceCheckUtils]: 12: Hoare triple {24390#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24390#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:49,361 INFO L273 TraceCheckUtils]: 13: Hoare triple {24390#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24391#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:49,362 INFO L273 TraceCheckUtils]: 14: Hoare triple {24391#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24391#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:49,363 INFO L273 TraceCheckUtils]: 15: Hoare triple {24391#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24392#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:49,363 INFO L273 TraceCheckUtils]: 16: Hoare triple {24392#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24392#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:49,364 INFO L273 TraceCheckUtils]: 17: Hoare triple {24392#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24393#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:49,364 INFO L273 TraceCheckUtils]: 18: Hoare triple {24393#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24393#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:49,365 INFO L273 TraceCheckUtils]: 19: Hoare triple {24393#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24394#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:49,365 INFO L273 TraceCheckUtils]: 20: Hoare triple {24394#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24394#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:49,366 INFO L273 TraceCheckUtils]: 21: Hoare triple {24394#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24395#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:49,367 INFO L273 TraceCheckUtils]: 22: Hoare triple {24395#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24395#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:49,367 INFO L273 TraceCheckUtils]: 23: Hoare triple {24395#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24396#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:49,368 INFO L273 TraceCheckUtils]: 24: Hoare triple {24396#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24396#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:49,368 INFO L273 TraceCheckUtils]: 25: Hoare triple {24396#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24397#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:49,369 INFO L273 TraceCheckUtils]: 26: Hoare triple {24397#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24397#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:49,370 INFO L273 TraceCheckUtils]: 27: Hoare triple {24397#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24398#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:49,370 INFO L273 TraceCheckUtils]: 28: Hoare triple {24398#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24398#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:49,371 INFO L273 TraceCheckUtils]: 29: Hoare triple {24398#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24399#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:49,371 INFO L273 TraceCheckUtils]: 30: Hoare triple {24399#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24399#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:49,372 INFO L273 TraceCheckUtils]: 31: Hoare triple {24399#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24400#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:49,372 INFO L273 TraceCheckUtils]: 32: Hoare triple {24400#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24400#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:49,373 INFO L273 TraceCheckUtils]: 33: Hoare triple {24400#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24401#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:49,374 INFO L273 TraceCheckUtils]: 34: Hoare triple {24401#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24401#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:49,374 INFO L273 TraceCheckUtils]: 35: Hoare triple {24401#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24402#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:49,375 INFO L273 TraceCheckUtils]: 36: Hoare triple {24402#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24402#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:49,375 INFO L273 TraceCheckUtils]: 37: Hoare triple {24402#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:49,376 INFO L273 TraceCheckUtils]: 38: Hoare triple {24403#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24403#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:49,376 INFO L273 TraceCheckUtils]: 39: Hoare triple {24403#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24404#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:49,377 INFO L273 TraceCheckUtils]: 40: Hoare triple {24404#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24404#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:49,378 INFO L273 TraceCheckUtils]: 41: Hoare triple {24404#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24405#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:49,378 INFO L273 TraceCheckUtils]: 42: Hoare triple {24405#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24405#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:49,379 INFO L273 TraceCheckUtils]: 43: Hoare triple {24405#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24406#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:49,379 INFO L273 TraceCheckUtils]: 44: Hoare triple {24406#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24406#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:49,380 INFO L273 TraceCheckUtils]: 45: Hoare triple {24406#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24407#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:49,380 INFO L273 TraceCheckUtils]: 46: Hoare triple {24407#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24407#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:49,381 INFO L273 TraceCheckUtils]: 47: Hoare triple {24407#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24408#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:49,381 INFO L273 TraceCheckUtils]: 48: Hoare triple {24408#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24408#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:49,382 INFO L273 TraceCheckUtils]: 49: Hoare triple {24408#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24409#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:49,383 INFO L273 TraceCheckUtils]: 50: Hoare triple {24409#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24409#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:49,404 INFO L273 TraceCheckUtils]: 51: Hoare triple {24409#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24410#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:49,417 INFO L273 TraceCheckUtils]: 52: Hoare triple {24410#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24410#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:49,425 INFO L273 TraceCheckUtils]: 53: Hoare triple {24410#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24411#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:49,430 INFO L273 TraceCheckUtils]: 54: Hoare triple {24411#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24411#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:49,431 INFO L273 TraceCheckUtils]: 55: Hoare triple {24411#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24412#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:49,431 INFO L273 TraceCheckUtils]: 56: Hoare triple {24412#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24412#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:49,432 INFO L273 TraceCheckUtils]: 57: Hoare triple {24412#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24413#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:49,432 INFO L273 TraceCheckUtils]: 58: Hoare triple {24413#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24413#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:49,432 INFO L273 TraceCheckUtils]: 59: Hoare triple {24413#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24414#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:49,433 INFO L273 TraceCheckUtils]: 60: Hoare triple {24414#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24414#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:49,433 INFO L273 TraceCheckUtils]: 61: Hoare triple {24414#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24415#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:49,433 INFO L273 TraceCheckUtils]: 62: Hoare triple {24415#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24415#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:49,434 INFO L273 TraceCheckUtils]: 63: Hoare triple {24415#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24416#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:49,434 INFO L273 TraceCheckUtils]: 64: Hoare triple {24416#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24416#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:49,435 INFO L273 TraceCheckUtils]: 65: Hoare triple {24416#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24417#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:49,436 INFO L273 TraceCheckUtils]: 66: Hoare triple {24417#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24417#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:49,436 INFO L273 TraceCheckUtils]: 67: Hoare triple {24417#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24418#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:49,437 INFO L273 TraceCheckUtils]: 68: Hoare triple {24418#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24418#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:49,437 INFO L273 TraceCheckUtils]: 69: Hoare triple {24418#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24419#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:49,438 INFO L273 TraceCheckUtils]: 70: Hoare triple {24419#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24419#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:49,439 INFO L273 TraceCheckUtils]: 71: Hoare triple {24419#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24420#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:49,439 INFO L273 TraceCheckUtils]: 72: Hoare triple {24420#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24420#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:49,440 INFO L273 TraceCheckUtils]: 73: Hoare triple {24420#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24421#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:49,440 INFO L273 TraceCheckUtils]: 74: Hoare triple {24421#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24421#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:49,441 INFO L273 TraceCheckUtils]: 75: Hoare triple {24421#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24422#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:49,441 INFO L273 TraceCheckUtils]: 76: Hoare triple {24422#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24422#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:49,442 INFO L273 TraceCheckUtils]: 77: Hoare triple {24422#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24423#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:49,442 INFO L273 TraceCheckUtils]: 78: Hoare triple {24423#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24423#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:49,443 INFO L273 TraceCheckUtils]: 79: Hoare triple {24423#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24424#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:49,444 INFO L273 TraceCheckUtils]: 80: Hoare triple {24424#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24424#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:49,444 INFO L273 TraceCheckUtils]: 81: Hoare triple {24424#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24425#(<= main_~i~0 38)} is VALID [2018-11-23 13:07:49,445 INFO L273 TraceCheckUtils]: 82: Hoare triple {24425#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24425#(<= main_~i~0 38)} is VALID [2018-11-23 13:07:49,445 INFO L273 TraceCheckUtils]: 83: Hoare triple {24425#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24426#(<= main_~i~0 39)} is VALID [2018-11-23 13:07:49,446 INFO L273 TraceCheckUtils]: 84: Hoare triple {24426#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24426#(<= main_~i~0 39)} is VALID [2018-11-23 13:07:49,447 INFO L273 TraceCheckUtils]: 85: Hoare triple {24426#(<= main_~i~0 39)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24427#(<= main_~i~0 40)} is VALID [2018-11-23 13:07:49,447 INFO L273 TraceCheckUtils]: 86: Hoare triple {24427#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24427#(<= main_~i~0 40)} is VALID [2018-11-23 13:07:49,448 INFO L273 TraceCheckUtils]: 87: Hoare triple {24427#(<= main_~i~0 40)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24428#(<= main_~i~0 41)} is VALID [2018-11-23 13:07:49,448 INFO L273 TraceCheckUtils]: 88: Hoare triple {24428#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24428#(<= main_~i~0 41)} is VALID [2018-11-23 13:07:49,449 INFO L273 TraceCheckUtils]: 89: Hoare triple {24428#(<= main_~i~0 41)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24429#(<= main_~i~0 42)} is VALID [2018-11-23 13:07:49,449 INFO L273 TraceCheckUtils]: 90: Hoare triple {24429#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24429#(<= main_~i~0 42)} is VALID [2018-11-23 13:07:49,450 INFO L273 TraceCheckUtils]: 91: Hoare triple {24429#(<= main_~i~0 42)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24430#(<= main_~i~0 43)} is VALID [2018-11-23 13:07:49,450 INFO L273 TraceCheckUtils]: 92: Hoare triple {24430#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24430#(<= main_~i~0 43)} is VALID [2018-11-23 13:07:49,451 INFO L273 TraceCheckUtils]: 93: Hoare triple {24430#(<= main_~i~0 43)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24431#(<= main_~i~0 44)} is VALID [2018-11-23 13:07:49,452 INFO L273 TraceCheckUtils]: 94: Hoare triple {24431#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24431#(<= main_~i~0 44)} is VALID [2018-11-23 13:07:49,452 INFO L273 TraceCheckUtils]: 95: Hoare triple {24431#(<= main_~i~0 44)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24432#(<= main_~i~0 45)} is VALID [2018-11-23 13:07:49,453 INFO L273 TraceCheckUtils]: 96: Hoare triple {24432#(<= main_~i~0 45)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24432#(<= main_~i~0 45)} is VALID [2018-11-23 13:07:49,453 INFO L273 TraceCheckUtils]: 97: Hoare triple {24432#(<= main_~i~0 45)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24433#(<= main_~i~0 46)} is VALID [2018-11-23 13:07:49,454 INFO L273 TraceCheckUtils]: 98: Hoare triple {24433#(<= main_~i~0 46)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24433#(<= main_~i~0 46)} is VALID [2018-11-23 13:07:49,454 INFO L273 TraceCheckUtils]: 99: Hoare triple {24433#(<= main_~i~0 46)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24434#(<= main_~i~0 47)} is VALID [2018-11-23 13:07:49,455 INFO L273 TraceCheckUtils]: 100: Hoare triple {24434#(<= main_~i~0 47)} assume !(~i~0 < 1024); {24386#false} is VALID [2018-11-23 13:07:49,455 INFO L273 TraceCheckUtils]: 101: Hoare triple {24386#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {24386#false} is VALID [2018-11-23 13:07:49,456 INFO L256 TraceCheckUtils]: 102: Hoare triple {24386#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {24386#false} is VALID [2018-11-23 13:07:49,456 INFO L273 TraceCheckUtils]: 103: Hoare triple {24386#false} ~cond := #in~cond; {24386#false} is VALID [2018-11-23 13:07:49,456 INFO L273 TraceCheckUtils]: 104: Hoare triple {24386#false} assume 0 == ~cond; {24386#false} is VALID [2018-11-23 13:07:49,456 INFO L273 TraceCheckUtils]: 105: Hoare triple {24386#false} assume !false; {24386#false} is VALID [2018-11-23 13:07:49,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:49,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:49,465 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:49,474 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:07:52,835 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-11-23 13:07:52,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:52,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:53,244 INFO L256 TraceCheckUtils]: 0: Hoare triple {24385#true} call ULTIMATE.init(); {24385#true} is VALID [2018-11-23 13:07:53,245 INFO L273 TraceCheckUtils]: 1: Hoare triple {24385#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24385#true} is VALID [2018-11-23 13:07:53,245 INFO L273 TraceCheckUtils]: 2: Hoare triple {24385#true} assume true; {24385#true} is VALID [2018-11-23 13:07:53,245 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24385#true} {24385#true} #35#return; {24385#true} is VALID [2018-11-23 13:07:53,245 INFO L256 TraceCheckUtils]: 4: Hoare triple {24385#true} call #t~ret2 := main(); {24385#true} is VALID [2018-11-23 13:07:53,246 INFO L273 TraceCheckUtils]: 5: Hoare triple {24385#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {24453#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:53,247 INFO L273 TraceCheckUtils]: 6: Hoare triple {24453#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24453#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:53,247 INFO L273 TraceCheckUtils]: 7: Hoare triple {24453#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24388#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:53,247 INFO L273 TraceCheckUtils]: 8: Hoare triple {24388#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24388#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:53,248 INFO L273 TraceCheckUtils]: 9: Hoare triple {24388#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24389#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:53,248 INFO L273 TraceCheckUtils]: 10: Hoare triple {24389#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24389#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:53,249 INFO L273 TraceCheckUtils]: 11: Hoare triple {24389#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24390#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:53,249 INFO L273 TraceCheckUtils]: 12: Hoare triple {24390#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24390#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:53,250 INFO L273 TraceCheckUtils]: 13: Hoare triple {24390#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24391#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:53,250 INFO L273 TraceCheckUtils]: 14: Hoare triple {24391#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24391#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:53,251 INFO L273 TraceCheckUtils]: 15: Hoare triple {24391#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24392#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:53,251 INFO L273 TraceCheckUtils]: 16: Hoare triple {24392#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24392#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:53,252 INFO L273 TraceCheckUtils]: 17: Hoare triple {24392#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24393#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:53,253 INFO L273 TraceCheckUtils]: 18: Hoare triple {24393#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24393#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:53,253 INFO L273 TraceCheckUtils]: 19: Hoare triple {24393#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24394#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:53,254 INFO L273 TraceCheckUtils]: 20: Hoare triple {24394#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24394#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:53,254 INFO L273 TraceCheckUtils]: 21: Hoare triple {24394#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24395#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:53,255 INFO L273 TraceCheckUtils]: 22: Hoare triple {24395#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24395#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:53,256 INFO L273 TraceCheckUtils]: 23: Hoare triple {24395#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24396#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:53,256 INFO L273 TraceCheckUtils]: 24: Hoare triple {24396#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24396#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:53,257 INFO L273 TraceCheckUtils]: 25: Hoare triple {24396#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24397#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:53,257 INFO L273 TraceCheckUtils]: 26: Hoare triple {24397#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24397#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:53,258 INFO L273 TraceCheckUtils]: 27: Hoare triple {24397#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24398#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:53,259 INFO L273 TraceCheckUtils]: 28: Hoare triple {24398#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24398#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:53,259 INFO L273 TraceCheckUtils]: 29: Hoare triple {24398#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24399#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:53,260 INFO L273 TraceCheckUtils]: 30: Hoare triple {24399#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24399#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:53,261 INFO L273 TraceCheckUtils]: 31: Hoare triple {24399#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24400#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:53,261 INFO L273 TraceCheckUtils]: 32: Hoare triple {24400#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24400#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:53,262 INFO L273 TraceCheckUtils]: 33: Hoare triple {24400#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24401#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:53,262 INFO L273 TraceCheckUtils]: 34: Hoare triple {24401#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24401#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:53,263 INFO L273 TraceCheckUtils]: 35: Hoare triple {24401#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24402#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:53,263 INFO L273 TraceCheckUtils]: 36: Hoare triple {24402#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24402#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:53,264 INFO L273 TraceCheckUtils]: 37: Hoare triple {24402#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:53,265 INFO L273 TraceCheckUtils]: 38: Hoare triple {24403#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24403#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:53,265 INFO L273 TraceCheckUtils]: 39: Hoare triple {24403#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24404#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:53,266 INFO L273 TraceCheckUtils]: 40: Hoare triple {24404#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24404#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:53,267 INFO L273 TraceCheckUtils]: 41: Hoare triple {24404#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24405#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:53,267 INFO L273 TraceCheckUtils]: 42: Hoare triple {24405#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24405#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:53,268 INFO L273 TraceCheckUtils]: 43: Hoare triple {24405#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24406#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:53,268 INFO L273 TraceCheckUtils]: 44: Hoare triple {24406#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24406#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:53,269 INFO L273 TraceCheckUtils]: 45: Hoare triple {24406#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24407#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:53,270 INFO L273 TraceCheckUtils]: 46: Hoare triple {24407#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24407#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:53,270 INFO L273 TraceCheckUtils]: 47: Hoare triple {24407#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24408#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:53,271 INFO L273 TraceCheckUtils]: 48: Hoare triple {24408#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24408#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:53,271 INFO L273 TraceCheckUtils]: 49: Hoare triple {24408#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24409#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:53,272 INFO L273 TraceCheckUtils]: 50: Hoare triple {24409#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24409#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:53,273 INFO L273 TraceCheckUtils]: 51: Hoare triple {24409#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24410#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:53,273 INFO L273 TraceCheckUtils]: 52: Hoare triple {24410#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24410#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:53,274 INFO L273 TraceCheckUtils]: 53: Hoare triple {24410#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24411#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:53,274 INFO L273 TraceCheckUtils]: 54: Hoare triple {24411#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24411#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:53,275 INFO L273 TraceCheckUtils]: 55: Hoare triple {24411#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24412#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:53,276 INFO L273 TraceCheckUtils]: 56: Hoare triple {24412#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24412#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:53,276 INFO L273 TraceCheckUtils]: 57: Hoare triple {24412#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24413#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:53,277 INFO L273 TraceCheckUtils]: 58: Hoare triple {24413#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24413#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:53,278 INFO L273 TraceCheckUtils]: 59: Hoare triple {24413#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24414#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:53,278 INFO L273 TraceCheckUtils]: 60: Hoare triple {24414#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24414#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:53,279 INFO L273 TraceCheckUtils]: 61: Hoare triple {24414#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24415#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:53,279 INFO L273 TraceCheckUtils]: 62: Hoare triple {24415#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24415#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:53,280 INFO L273 TraceCheckUtils]: 63: Hoare triple {24415#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24416#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:53,280 INFO L273 TraceCheckUtils]: 64: Hoare triple {24416#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24416#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:53,281 INFO L273 TraceCheckUtils]: 65: Hoare triple {24416#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24417#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:53,282 INFO L273 TraceCheckUtils]: 66: Hoare triple {24417#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24417#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:53,282 INFO L273 TraceCheckUtils]: 67: Hoare triple {24417#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24418#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:53,283 INFO L273 TraceCheckUtils]: 68: Hoare triple {24418#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24418#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:53,284 INFO L273 TraceCheckUtils]: 69: Hoare triple {24418#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24419#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:53,284 INFO L273 TraceCheckUtils]: 70: Hoare triple {24419#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24419#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:53,285 INFO L273 TraceCheckUtils]: 71: Hoare triple {24419#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24420#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:53,285 INFO L273 TraceCheckUtils]: 72: Hoare triple {24420#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24420#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:53,286 INFO L273 TraceCheckUtils]: 73: Hoare triple {24420#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24421#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:53,304 INFO L273 TraceCheckUtils]: 74: Hoare triple {24421#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24421#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:53,319 INFO L273 TraceCheckUtils]: 75: Hoare triple {24421#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24422#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:53,328 INFO L273 TraceCheckUtils]: 76: Hoare triple {24422#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24422#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:53,339 INFO L273 TraceCheckUtils]: 77: Hoare triple {24422#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24423#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:53,340 INFO L273 TraceCheckUtils]: 78: Hoare triple {24423#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24423#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:53,340 INFO L273 TraceCheckUtils]: 79: Hoare triple {24423#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24424#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:53,341 INFO L273 TraceCheckUtils]: 80: Hoare triple {24424#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24424#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:53,341 INFO L273 TraceCheckUtils]: 81: Hoare triple {24424#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24425#(<= main_~i~0 38)} is VALID [2018-11-23 13:07:53,341 INFO L273 TraceCheckUtils]: 82: Hoare triple {24425#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24425#(<= main_~i~0 38)} is VALID [2018-11-23 13:07:53,342 INFO L273 TraceCheckUtils]: 83: Hoare triple {24425#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24426#(<= main_~i~0 39)} is VALID [2018-11-23 13:07:53,342 INFO L273 TraceCheckUtils]: 84: Hoare triple {24426#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24426#(<= main_~i~0 39)} is VALID [2018-11-23 13:07:53,342 INFO L273 TraceCheckUtils]: 85: Hoare triple {24426#(<= main_~i~0 39)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24427#(<= main_~i~0 40)} is VALID [2018-11-23 13:07:53,343 INFO L273 TraceCheckUtils]: 86: Hoare triple {24427#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24427#(<= main_~i~0 40)} is VALID [2018-11-23 13:07:53,343 INFO L273 TraceCheckUtils]: 87: Hoare triple {24427#(<= main_~i~0 40)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24428#(<= main_~i~0 41)} is VALID [2018-11-23 13:07:53,344 INFO L273 TraceCheckUtils]: 88: Hoare triple {24428#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24428#(<= main_~i~0 41)} is VALID [2018-11-23 13:07:53,344 INFO L273 TraceCheckUtils]: 89: Hoare triple {24428#(<= main_~i~0 41)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24429#(<= main_~i~0 42)} is VALID [2018-11-23 13:07:53,345 INFO L273 TraceCheckUtils]: 90: Hoare triple {24429#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24429#(<= main_~i~0 42)} is VALID [2018-11-23 13:07:53,345 INFO L273 TraceCheckUtils]: 91: Hoare triple {24429#(<= main_~i~0 42)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24430#(<= main_~i~0 43)} is VALID [2018-11-23 13:07:53,346 INFO L273 TraceCheckUtils]: 92: Hoare triple {24430#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24430#(<= main_~i~0 43)} is VALID [2018-11-23 13:07:53,347 INFO L273 TraceCheckUtils]: 93: Hoare triple {24430#(<= main_~i~0 43)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24431#(<= main_~i~0 44)} is VALID [2018-11-23 13:07:53,347 INFO L273 TraceCheckUtils]: 94: Hoare triple {24431#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24431#(<= main_~i~0 44)} is VALID [2018-11-23 13:07:53,348 INFO L273 TraceCheckUtils]: 95: Hoare triple {24431#(<= main_~i~0 44)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24432#(<= main_~i~0 45)} is VALID [2018-11-23 13:07:53,348 INFO L273 TraceCheckUtils]: 96: Hoare triple {24432#(<= main_~i~0 45)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24432#(<= main_~i~0 45)} is VALID [2018-11-23 13:07:53,349 INFO L273 TraceCheckUtils]: 97: Hoare triple {24432#(<= main_~i~0 45)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24433#(<= main_~i~0 46)} is VALID [2018-11-23 13:07:53,349 INFO L273 TraceCheckUtils]: 98: Hoare triple {24433#(<= main_~i~0 46)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {24433#(<= main_~i~0 46)} is VALID [2018-11-23 13:07:53,350 INFO L273 TraceCheckUtils]: 99: Hoare triple {24433#(<= main_~i~0 46)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24434#(<= main_~i~0 47)} is VALID [2018-11-23 13:07:53,351 INFO L273 TraceCheckUtils]: 100: Hoare triple {24434#(<= main_~i~0 47)} assume !(~i~0 < 1024); {24386#false} is VALID [2018-11-23 13:07:53,351 INFO L273 TraceCheckUtils]: 101: Hoare triple {24386#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {24386#false} is VALID [2018-11-23 13:07:53,351 INFO L256 TraceCheckUtils]: 102: Hoare triple {24386#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {24386#false} is VALID [2018-11-23 13:07:53,351 INFO L273 TraceCheckUtils]: 103: Hoare triple {24386#false} ~cond := #in~cond; {24386#false} is VALID [2018-11-23 13:07:53,352 INFO L273 TraceCheckUtils]: 104: Hoare triple {24386#false} assume 0 == ~cond; {24386#false} is VALID [2018-11-23 13:07:53,352 INFO L273 TraceCheckUtils]: 105: Hoare triple {24386#false} assume !false; {24386#false} is VALID [2018-11-23 13:07:53,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:53,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:53,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2018-11-23 13:07:53,382 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 106 [2018-11-23 13:07:53,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:53,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states. [2018-11-23 13:07:53,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:53,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-23 13:07:53,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-23 13:07:53,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 13:07:53,483 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 51 states. [2018-11-23 13:07:54,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:54,080 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-11-23 13:07:54,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-23 13:07:54,080 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 106 [2018-11-23 13:07:54,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:54,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 13:07:54,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 116 transitions. [2018-11-23 13:07:54,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 13:07:54,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 116 transitions. [2018-11-23 13:07:54,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 116 transitions. [2018-11-23 13:07:54,192 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:54,194 INFO L225 Difference]: With dead ends: 116 [2018-11-23 13:07:54,195 INFO L226 Difference]: Without dead ends: 110 [2018-11-23 13:07:54,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 13:07:54,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-23 13:07:54,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-11-23 13:07:54,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:54,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 109 states. [2018-11-23 13:07:54,244 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 109 states. [2018-11-23 13:07:54,244 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 109 states. [2018-11-23 13:07:54,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:54,246 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-11-23 13:07:54,246 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-11-23 13:07:54,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:54,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:54,246 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 110 states. [2018-11-23 13:07:54,247 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 110 states. [2018-11-23 13:07:54,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:54,248 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-11-23 13:07:54,248 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-11-23 13:07:54,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:54,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:54,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:54,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:54,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-23 13:07:54,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-11-23 13:07:54,250 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2018-11-23 13:07:54,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:54,250 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-11-23 13:07:54,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-23 13:07:54,250 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-11-23 13:07:54,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-23 13:07:54,251 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:54,251 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:54,251 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:54,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:54,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1075971459, now seen corresponding path program 48 times [2018-11-23 13:07:54,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:54,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:54,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:54,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:54,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:56,633 INFO L256 TraceCheckUtils]: 0: Hoare triple {25310#true} call ULTIMATE.init(); {25310#true} is VALID [2018-11-23 13:07:56,633 INFO L273 TraceCheckUtils]: 1: Hoare triple {25310#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25310#true} is VALID [2018-11-23 13:07:56,633 INFO L273 TraceCheckUtils]: 2: Hoare triple {25310#true} assume true; {25310#true} is VALID [2018-11-23 13:07:56,634 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25310#true} {25310#true} #35#return; {25310#true} is VALID [2018-11-23 13:07:56,634 INFO L256 TraceCheckUtils]: 4: Hoare triple {25310#true} call #t~ret2 := main(); {25310#true} is VALID [2018-11-23 13:07:56,634 INFO L273 TraceCheckUtils]: 5: Hoare triple {25310#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {25312#(= main_~i~0 0)} is VALID [2018-11-23 13:07:56,635 INFO L273 TraceCheckUtils]: 6: Hoare triple {25312#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25312#(= main_~i~0 0)} is VALID [2018-11-23 13:07:56,635 INFO L273 TraceCheckUtils]: 7: Hoare triple {25312#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25313#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:56,636 INFO L273 TraceCheckUtils]: 8: Hoare triple {25313#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25313#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:56,636 INFO L273 TraceCheckUtils]: 9: Hoare triple {25313#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25314#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:56,636 INFO L273 TraceCheckUtils]: 10: Hoare triple {25314#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25314#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:56,637 INFO L273 TraceCheckUtils]: 11: Hoare triple {25314#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25315#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:56,637 INFO L273 TraceCheckUtils]: 12: Hoare triple {25315#(<= main_~i~0 3)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25315#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:56,638 INFO L273 TraceCheckUtils]: 13: Hoare triple {25315#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25316#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:56,638 INFO L273 TraceCheckUtils]: 14: Hoare triple {25316#(<= main_~i~0 4)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25316#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:56,639 INFO L273 TraceCheckUtils]: 15: Hoare triple {25316#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25317#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:56,640 INFO L273 TraceCheckUtils]: 16: Hoare triple {25317#(<= main_~i~0 5)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25317#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:56,640 INFO L273 TraceCheckUtils]: 17: Hoare triple {25317#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25318#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:56,641 INFO L273 TraceCheckUtils]: 18: Hoare triple {25318#(<= main_~i~0 6)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25318#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:56,641 INFO L273 TraceCheckUtils]: 19: Hoare triple {25318#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25319#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:56,642 INFO L273 TraceCheckUtils]: 20: Hoare triple {25319#(<= main_~i~0 7)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25319#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:56,643 INFO L273 TraceCheckUtils]: 21: Hoare triple {25319#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25320#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:56,643 INFO L273 TraceCheckUtils]: 22: Hoare triple {25320#(<= main_~i~0 8)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25320#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:56,644 INFO L273 TraceCheckUtils]: 23: Hoare triple {25320#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25321#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:56,644 INFO L273 TraceCheckUtils]: 24: Hoare triple {25321#(<= main_~i~0 9)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25321#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:56,645 INFO L273 TraceCheckUtils]: 25: Hoare triple {25321#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25322#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:56,646 INFO L273 TraceCheckUtils]: 26: Hoare triple {25322#(<= main_~i~0 10)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25322#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:56,646 INFO L273 TraceCheckUtils]: 27: Hoare triple {25322#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25323#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:56,647 INFO L273 TraceCheckUtils]: 28: Hoare triple {25323#(<= main_~i~0 11)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25323#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:56,648 INFO L273 TraceCheckUtils]: 29: Hoare triple {25323#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25324#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:56,648 INFO L273 TraceCheckUtils]: 30: Hoare triple {25324#(<= main_~i~0 12)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25324#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:56,649 INFO L273 TraceCheckUtils]: 31: Hoare triple {25324#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25325#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:56,649 INFO L273 TraceCheckUtils]: 32: Hoare triple {25325#(<= main_~i~0 13)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25325#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:56,650 INFO L273 TraceCheckUtils]: 33: Hoare triple {25325#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25326#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:56,650 INFO L273 TraceCheckUtils]: 34: Hoare triple {25326#(<= main_~i~0 14)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25326#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:56,651 INFO L273 TraceCheckUtils]: 35: Hoare triple {25326#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25327#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:56,652 INFO L273 TraceCheckUtils]: 36: Hoare triple {25327#(<= main_~i~0 15)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25327#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:56,652 INFO L273 TraceCheckUtils]: 37: Hoare triple {25327#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25328#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:56,653 INFO L273 TraceCheckUtils]: 38: Hoare triple {25328#(<= main_~i~0 16)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25328#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:56,654 INFO L273 TraceCheckUtils]: 39: Hoare triple {25328#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25329#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:56,654 INFO L273 TraceCheckUtils]: 40: Hoare triple {25329#(<= main_~i~0 17)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25329#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:56,655 INFO L273 TraceCheckUtils]: 41: Hoare triple {25329#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25330#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:56,655 INFO L273 TraceCheckUtils]: 42: Hoare triple {25330#(<= main_~i~0 18)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25330#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:56,656 INFO L273 TraceCheckUtils]: 43: Hoare triple {25330#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25331#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:56,657 INFO L273 TraceCheckUtils]: 44: Hoare triple {25331#(<= main_~i~0 19)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25331#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:56,657 INFO L273 TraceCheckUtils]: 45: Hoare triple {25331#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25332#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:56,658 INFO L273 TraceCheckUtils]: 46: Hoare triple {25332#(<= main_~i~0 20)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25332#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:56,658 INFO L273 TraceCheckUtils]: 47: Hoare triple {25332#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25333#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:56,659 INFO L273 TraceCheckUtils]: 48: Hoare triple {25333#(<= main_~i~0 21)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25333#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:56,660 INFO L273 TraceCheckUtils]: 49: Hoare triple {25333#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25334#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:56,660 INFO L273 TraceCheckUtils]: 50: Hoare triple {25334#(<= main_~i~0 22)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25334#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:56,661 INFO L273 TraceCheckUtils]: 51: Hoare triple {25334#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25335#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:56,661 INFO L273 TraceCheckUtils]: 52: Hoare triple {25335#(<= main_~i~0 23)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25335#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:56,662 INFO L273 TraceCheckUtils]: 53: Hoare triple {25335#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25336#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:56,663 INFO L273 TraceCheckUtils]: 54: Hoare triple {25336#(<= main_~i~0 24)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25336#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:56,663 INFO L273 TraceCheckUtils]: 55: Hoare triple {25336#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25337#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:56,664 INFO L273 TraceCheckUtils]: 56: Hoare triple {25337#(<= main_~i~0 25)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25337#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:56,665 INFO L273 TraceCheckUtils]: 57: Hoare triple {25337#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25338#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:56,665 INFO L273 TraceCheckUtils]: 58: Hoare triple {25338#(<= main_~i~0 26)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25338#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:56,666 INFO L273 TraceCheckUtils]: 59: Hoare triple {25338#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25339#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:56,666 INFO L273 TraceCheckUtils]: 60: Hoare triple {25339#(<= main_~i~0 27)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25339#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:56,667 INFO L273 TraceCheckUtils]: 61: Hoare triple {25339#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25340#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:56,667 INFO L273 TraceCheckUtils]: 62: Hoare triple {25340#(<= main_~i~0 28)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25340#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:56,668 INFO L273 TraceCheckUtils]: 63: Hoare triple {25340#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25341#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:56,669 INFO L273 TraceCheckUtils]: 64: Hoare triple {25341#(<= main_~i~0 29)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25341#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:56,669 INFO L273 TraceCheckUtils]: 65: Hoare triple {25341#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25342#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:56,670 INFO L273 TraceCheckUtils]: 66: Hoare triple {25342#(<= main_~i~0 30)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25342#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:56,671 INFO L273 TraceCheckUtils]: 67: Hoare triple {25342#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25343#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:56,671 INFO L273 TraceCheckUtils]: 68: Hoare triple {25343#(<= main_~i~0 31)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25343#(<= main_~i~0 31)} is VALID [2018-11-23 13:07:56,672 INFO L273 TraceCheckUtils]: 69: Hoare triple {25343#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25344#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:56,672 INFO L273 TraceCheckUtils]: 70: Hoare triple {25344#(<= main_~i~0 32)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25344#(<= main_~i~0 32)} is VALID [2018-11-23 13:07:56,673 INFO L273 TraceCheckUtils]: 71: Hoare triple {25344#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25345#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:56,674 INFO L273 TraceCheckUtils]: 72: Hoare triple {25345#(<= main_~i~0 33)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25345#(<= main_~i~0 33)} is VALID [2018-11-23 13:07:56,674 INFO L273 TraceCheckUtils]: 73: Hoare triple {25345#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25346#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:56,675 INFO L273 TraceCheckUtils]: 74: Hoare triple {25346#(<= main_~i~0 34)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25346#(<= main_~i~0 34)} is VALID [2018-11-23 13:07:56,675 INFO L273 TraceCheckUtils]: 75: Hoare triple {25346#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25347#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:56,676 INFO L273 TraceCheckUtils]: 76: Hoare triple {25347#(<= main_~i~0 35)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25347#(<= main_~i~0 35)} is VALID [2018-11-23 13:07:56,677 INFO L273 TraceCheckUtils]: 77: Hoare triple {25347#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25348#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:56,677 INFO L273 TraceCheckUtils]: 78: Hoare triple {25348#(<= main_~i~0 36)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25348#(<= main_~i~0 36)} is VALID [2018-11-23 13:07:56,678 INFO L273 TraceCheckUtils]: 79: Hoare triple {25348#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25349#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:56,678 INFO L273 TraceCheckUtils]: 80: Hoare triple {25349#(<= main_~i~0 37)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25349#(<= main_~i~0 37)} is VALID [2018-11-23 13:07:56,679 INFO L273 TraceCheckUtils]: 81: Hoare triple {25349#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25350#(<= main_~i~0 38)} is VALID [2018-11-23 13:07:56,680 INFO L273 TraceCheckUtils]: 82: Hoare triple {25350#(<= main_~i~0 38)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25350#(<= main_~i~0 38)} is VALID [2018-11-23 13:07:56,680 INFO L273 TraceCheckUtils]: 83: Hoare triple {25350#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25351#(<= main_~i~0 39)} is VALID [2018-11-23 13:07:56,681 INFO L273 TraceCheckUtils]: 84: Hoare triple {25351#(<= main_~i~0 39)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25351#(<= main_~i~0 39)} is VALID [2018-11-23 13:07:56,682 INFO L273 TraceCheckUtils]: 85: Hoare triple {25351#(<= main_~i~0 39)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25352#(<= main_~i~0 40)} is VALID [2018-11-23 13:07:56,682 INFO L273 TraceCheckUtils]: 86: Hoare triple {25352#(<= main_~i~0 40)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25352#(<= main_~i~0 40)} is VALID [2018-11-23 13:07:56,683 INFO L273 TraceCheckUtils]: 87: Hoare triple {25352#(<= main_~i~0 40)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25353#(<= main_~i~0 41)} is VALID [2018-11-23 13:07:56,683 INFO L273 TraceCheckUtils]: 88: Hoare triple {25353#(<= main_~i~0 41)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25353#(<= main_~i~0 41)} is VALID [2018-11-23 13:07:56,684 INFO L273 TraceCheckUtils]: 89: Hoare triple {25353#(<= main_~i~0 41)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25354#(<= main_~i~0 42)} is VALID [2018-11-23 13:07:56,684 INFO L273 TraceCheckUtils]: 90: Hoare triple {25354#(<= main_~i~0 42)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25354#(<= main_~i~0 42)} is VALID [2018-11-23 13:07:56,685 INFO L273 TraceCheckUtils]: 91: Hoare triple {25354#(<= main_~i~0 42)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25355#(<= main_~i~0 43)} is VALID [2018-11-23 13:07:56,686 INFO L273 TraceCheckUtils]: 92: Hoare triple {25355#(<= main_~i~0 43)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25355#(<= main_~i~0 43)} is VALID [2018-11-23 13:07:56,686 INFO L273 TraceCheckUtils]: 93: Hoare triple {25355#(<= main_~i~0 43)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25356#(<= main_~i~0 44)} is VALID [2018-11-23 13:07:56,687 INFO L273 TraceCheckUtils]: 94: Hoare triple {25356#(<= main_~i~0 44)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25356#(<= main_~i~0 44)} is VALID [2018-11-23 13:07:56,688 INFO L273 TraceCheckUtils]: 95: Hoare triple {25356#(<= main_~i~0 44)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25357#(<= main_~i~0 45)} is VALID [2018-11-23 13:07:56,688 INFO L273 TraceCheckUtils]: 96: Hoare triple {25357#(<= main_~i~0 45)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25357#(<= main_~i~0 45)} is VALID [2018-11-23 13:07:56,689 INFO L273 TraceCheckUtils]: 97: Hoare triple {25357#(<= main_~i~0 45)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25358#(<= main_~i~0 46)} is VALID [2018-11-23 13:07:56,689 INFO L273 TraceCheckUtils]: 98: Hoare triple {25358#(<= main_~i~0 46)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25358#(<= main_~i~0 46)} is VALID [2018-11-23 13:07:56,691 INFO L273 TraceCheckUtils]: 99: Hoare triple {25358#(<= main_~i~0 46)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25359#(<= main_~i~0 47)} is VALID [2018-11-23 13:07:56,692 INFO L273 TraceCheckUtils]: 100: Hoare triple {25359#(<= main_~i~0 47)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25359#(<= main_~i~0 47)} is VALID [2018-11-23 13:07:56,692 INFO L273 TraceCheckUtils]: 101: Hoare triple {25359#(<= main_~i~0 47)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25360#(<= main_~i~0 48)} is VALID [2018-11-23 13:07:56,693 INFO L273 TraceCheckUtils]: 102: Hoare triple {25360#(<= main_~i~0 48)} assume !(~i~0 < 1024); {25311#false} is VALID [2018-11-23 13:07:56,693 INFO L273 TraceCheckUtils]: 103: Hoare triple {25311#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {25311#false} is VALID [2018-11-23 13:07:56,693 INFO L256 TraceCheckUtils]: 104: Hoare triple {25311#false} call __VERIFIER_assert((if 1023 != #t~mem1 then 1 else 0)); {25311#false} is VALID [2018-11-23 13:07:56,694 INFO L273 TraceCheckUtils]: 105: Hoare triple {25311#false} ~cond := #in~cond; {25311#false} is VALID [2018-11-23 13:07:56,694 INFO L273 TraceCheckUtils]: 106: Hoare triple {25311#false} assume 0 == ~cond; {25311#false} is VALID [2018-11-23 13:07:56,694 INFO L273 TraceCheckUtils]: 107: Hoare triple {25311#false} assume !false; {25311#false} is VALID [2018-11-23 13:07:56,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:56,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:56,703 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:56,711 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE