java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/codeblockAssertOrder01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 14:31:16,124 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 14:31:16,126 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 14:31:16,144 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 14:31:16,144 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 14:31:16,145 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 14:31:16,146 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 14:31:16,148 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 14:31:16,150 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 14:31:16,151 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 14:31:16,152 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 14:31:16,153 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 14:31:16,154 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 14:31:16,155 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 14:31:16,159 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 14:31:16,161 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 14:31:16,162 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 14:31:16,167 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 14:31:16,175 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 14:31:16,177 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 14:31:16,178 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 14:31:16,182 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 14:31:16,184 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 14:31:16,185 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 14:31:16,185 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 14:31:16,186 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 14:31:16,187 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 14:31:16,187 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 14:31:16,188 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 14:31:16,189 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 14:31:16,189 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 14:31:16,190 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 14:31:16,190 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 14:31:16,190 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 14:31:16,191 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 14:31:16,192 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 14:31:16,192 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-31 14:31:16,215 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 14:31:16,215 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 14:31:16,216 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 14:31:16,216 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 14:31:16,216 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 14:31:16,217 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 14:31:16,217 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 14:31:16,217 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 14:31:16,217 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 14:31:16,217 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 14:31:16,218 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 14:31:16,218 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 14:31:16,218 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 14:31:16,218 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 14:31:16,220 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 14:31:16,220 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 14:31:16,220 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 14:31:16,220 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 14:31:16,220 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 14:31:16,221 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 14:31:16,221 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 14:31:16,221 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 14:31:16,221 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 14:31:16,221 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 14:31:16,221 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 14:31:16,223 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 14:31:16,224 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 14:31:16,224 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 14:31:16,224 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 14:31:16,224 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 14:31:16,224 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 14:31:16,225 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:31:16,225 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 14:31:16,225 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 14:31:16,225 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 14:31:16,226 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 14:31:16,226 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 14:31:16,226 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 14:31:16,226 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 14:31:16,226 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 14:31:16,264 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 14:31:16,276 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 14:31:16,279 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 14:31:16,281 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 14:31:16,281 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 14:31:16,282 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/codeblockAssertOrder01.bpl [2019-01-31 14:31:16,282 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/codeblockAssertOrder01.bpl' [2019-01-31 14:31:16,311 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 14:31:16,313 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 14:31:16,313 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 14:31:16,313 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 14:31:16,313 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 14:31:16,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:16" (1/1) ... [2019-01-31 14:31:16,341 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:16" (1/1) ... [2019-01-31 14:31:16,346 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-31 14:31:16,346 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-31 14:31:16,346 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-31 14:31:16,348 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 14:31:16,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 14:31:16,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 14:31:16,350 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 14:31:16,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:16" (1/1) ... [2019-01-31 14:31:16,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:16" (1/1) ... [2019-01-31 14:31:16,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:16" (1/1) ... [2019-01-31 14:31:16,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:16" (1/1) ... [2019-01-31 14:31:16,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:16" (1/1) ... [2019-01-31 14:31:16,369 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:16" (1/1) ... [2019-01-31 14:31:16,370 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:16" (1/1) ... [2019-01-31 14:31:16,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 14:31:16,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 14:31:16,371 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 14:31:16,372 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 14:31:16,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:16" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:31:16,431 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-31 14:31:16,432 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-31 14:31:16,788 INFO L278 CfgBuilder]: Using library mode [2019-01-31 14:31:16,788 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-31 14:31:16,789 INFO L202 PluginConnector]: Adding new model codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:31:16 BoogieIcfgContainer [2019-01-31 14:31:16,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 14:31:16,790 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 14:31:16,790 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 14:31:16,793 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 14:31:16,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:16" (1/2) ... [2019-01-31 14:31:16,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3929f970 and model type codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:31:16, skipping insertion in model container [2019-01-31 14:31:16,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:31:16" (2/2) ... [2019-01-31 14:31:16,796 INFO L112 eAbstractionObserver]: Analyzing ICFG codeblockAssertOrder01.bpl [2019-01-31 14:31:16,804 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 14:31:16,811 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-31 14:31:16,824 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-31 14:31:16,854 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 14:31:16,855 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 14:31:16,855 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 14:31:16,855 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 14:31:16,855 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 14:31:16,855 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 14:31:16,856 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 14:31:16,856 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 14:31:16,870 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-31 14:31:16,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 14:31:16,876 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:16,877 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 14:31:16,879 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:16,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:16,885 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-01-31 14:31:16,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:16,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:16,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:16,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:16,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:17,119 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} i := 0; {11#(<= main_i 0)} is VALID [2019-01-31 14:31:17,142 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(<= main_i 0)} assume !(i <= 1000);a := a[p := 5];assume p > 41 && p < 43;assume q > 41 && q < 43; {10#false} is VALID [2019-01-31 14:31:17,143 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#false} assume !(a[q] == 5); {10#false} is VALID [2019-01-31 14:31:17,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:17,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:31:17,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 14:31:17,149 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:31:17,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 14:31:17,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:17,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-31 14:31:17,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:17,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 14:31:17,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 14:31:17,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 14:31:17,200 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-31 14:31:17,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:17,310 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-31 14:31:17,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 14:31:17,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 14:31:17,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:17,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:31:17,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-01-31 14:31:17,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:31:17,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-01-31 14:31:17,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 11 transitions. [2019-01-31 14:31:17,367 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:17,377 INFO L225 Difference]: With dead ends: 11 [2019-01-31 14:31:17,377 INFO L226 Difference]: Without dead ends: 5 [2019-01-31 14:31:17,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 14:31:17,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-31 14:31:17,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-31 14:31:17,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:17,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-01-31 14:31:17,446 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-31 14:31:17,446 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-31 14:31:17,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:17,448 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-31 14:31:17,448 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-31 14:31:17,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:17,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:17,449 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-31 14:31:17,449 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-31 14:31:17,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:17,451 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-31 14:31:17,451 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-31 14:31:17,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:17,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:17,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:17,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:17,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-31 14:31:17,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-31 14:31:17,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-31 14:31:17,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:17,456 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-31 14:31:17,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 14:31:17,456 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-31 14:31:17,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 14:31:17,456 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:17,457 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 14:31:17,457 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:17,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:17,458 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-01-31 14:31:17,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:17,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:17,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:17,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:17,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:17,582 INFO L273 TraceCheckUtils]: 0: Hoare triple {44#true} i := 0; {46#(<= main_i 0)} is VALID [2019-01-31 14:31:17,584 INFO L273 TraceCheckUtils]: 1: Hoare triple {46#(<= main_i 0)} assume i <= 1000;i := i + 1; {47#(<= main_i 1)} is VALID [2019-01-31 14:31:17,591 INFO L273 TraceCheckUtils]: 2: Hoare triple {47#(<= main_i 1)} assume !(i <= 1000);a := a[p := 5];assume p > 41 && p < 43;assume q > 41 && q < 43; {45#false} is VALID [2019-01-31 14:31:17,591 INFO L273 TraceCheckUtils]: 3: Hoare triple {45#false} assume !(a[q] == 5); {45#false} is VALID [2019-01-31 14:31:17,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:17,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:17,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:31:17,594 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 14:31:17,596 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [7] [2019-01-31 14:31:17,632 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 14:31:17,633 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 14:31:17,916 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 14:31:17,920 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 1 different actions 3 times. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 3. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 14:31:17,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:17,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 14:31:17,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:17,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 [2019-01-31 14:31:17,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:17,954 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 14:31:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:18,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:31:18,320 INFO L273 TraceCheckUtils]: 0: Hoare triple {44#true} i := 0; {46#(<= main_i 0)} is VALID [2019-01-31 14:31:18,332 INFO L273 TraceCheckUtils]: 1: Hoare triple {46#(<= main_i 0)} assume i <= 1000;i := i + 1; {47#(<= main_i 1)} is VALID [2019-01-31 14:31:18,344 INFO L273 TraceCheckUtils]: 2: Hoare triple {47#(<= main_i 1)} assume !(i <= 1000);a := a[p := 5];assume p > 41 && p < 43;assume q > 41 && q < 43; {45#false} is VALID [2019-01-31 14:31:18,344 INFO L273 TraceCheckUtils]: 3: Hoare triple {45#false} assume !(a[q] == 5); {45#false} is VALID [2019-01-31 14:31:18,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:18,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:31:18,601 INFO L273 TraceCheckUtils]: 3: Hoare triple {45#false} assume !(a[q] == 5); {45#false} is VALID [2019-01-31 14:31:18,616 INFO L273 TraceCheckUtils]: 2: Hoare triple {63#(<= main_i 1000)} assume !(i <= 1000);a := a[p := 5];assume p > 41 && p < 43;assume q > 41 && q < 43; {45#false} is VALID [2019-01-31 14:31:18,634 INFO L273 TraceCheckUtils]: 1: Hoare triple {67#(< main_i 1000)} assume i <= 1000;i := i + 1; {63#(<= main_i 1000)} is VALID [2019-01-31 14:31:18,650 INFO L273 TraceCheckUtils]: 0: Hoare triple {44#true} i := 0; {67#(< main_i 1000)} is VALID [2019-01-31 14:31:18,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:18,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 14:31:18,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-31 14:31:18,683 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 14:31:18,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 14:31:18,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:18,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-31 14:31:18,737 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:18,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 14:31:18,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 14:31:18,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-31 14:31:18,739 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-01-31 14:31:18,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:18,860 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-31 14:31:18,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 14:31:18,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 14:31:18,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:18,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:18,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-01-31 14:31:18,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:18,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-01-31 14:31:18,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 8 transitions. [2019-01-31 14:31:18,876 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:18,876 INFO L225 Difference]: With dead ends: 8 [2019-01-31 14:31:18,877 INFO L226 Difference]: Without dead ends: 6 [2019-01-31 14:31:18,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-31 14:31:18,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-31 14:31:18,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-31 14:31:18,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:18,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2019-01-31 14:31:18,891 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-01-31 14:31:18,891 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-01-31 14:31:18,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:18,893 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-01-31 14:31:18,893 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-31 14:31:18,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:18,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:18,893 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-01-31 14:31:18,894 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-01-31 14:31:18,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:18,895 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-01-31 14:31:18,895 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-31 14:31:18,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:18,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:18,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:18,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:18,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 14:31:18,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-31 14:31:18,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-01-31 14:31:18,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:18,897 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-31 14:31:18,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 14:31:18,897 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-31 14:31:18,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 14:31:18,898 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:18,898 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-31 14:31:18,898 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:18,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:18,899 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2019-01-31 14:31:18,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:18,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:18,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:18,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:18,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:19,081 INFO L273 TraceCheckUtils]: 0: Hoare triple {102#true} i := 0; {104#(<= main_i 0)} is VALID [2019-01-31 14:31:19,082 INFO L273 TraceCheckUtils]: 1: Hoare triple {104#(<= main_i 0)} assume i <= 1000;i := i + 1; {105#(<= main_i 1)} is VALID [2019-01-31 14:31:19,083 INFO L273 TraceCheckUtils]: 2: Hoare triple {105#(<= main_i 1)} assume i <= 1000;i := i + 1; {106#(<= main_i 2)} is VALID [2019-01-31 14:31:19,084 INFO L273 TraceCheckUtils]: 3: Hoare triple {106#(<= main_i 2)} assume !(i <= 1000);a := a[p := 5];assume p > 41 && p < 43;assume q > 41 && q < 43; {103#false} is VALID [2019-01-31 14:31:19,085 INFO L273 TraceCheckUtils]: 4: Hoare triple {103#false} assume !(a[q] == 5); {103#false} is VALID [2019-01-31 14:31:19,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:19,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:19,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:31:19,086 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 14:31:19,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 14:31:19,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:19,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 [2019-01-31 14:31:19,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 14:31:19,097 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 14:31:19,102 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-01-31 14:31:19,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 14:31:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:19,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:31:19,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 14:31:19,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:19,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 14:31:19,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2019-01-31 14:31:19,207 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:31:19,207 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_main_a_6, main_p]. (and (< main_p 43) (< 41 main_q) (< 41 main_p) (= (store v_main_a_6 main_p 5) main_a) (< main_q 43)) [2019-01-31 14:31:19,207 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [main_p]. (and (< main_p 43) (< 41 main_q) (< 41 main_p) (= (select main_a main_p) 5) (< main_q 43)) [2019-01-31 14:31:19,269 INFO L273 TraceCheckUtils]: 0: Hoare triple {102#true} i := 0; {102#true} is VALID [2019-01-31 14:31:19,269 INFO L273 TraceCheckUtils]: 1: Hoare triple {102#true} assume i <= 1000;i := i + 1; {102#true} is VALID [2019-01-31 14:31:19,270 INFO L273 TraceCheckUtils]: 2: Hoare triple {102#true} assume i <= 1000;i := i + 1; {102#true} is VALID [2019-01-31 14:31:19,288 INFO L273 TraceCheckUtils]: 3: Hoare triple {102#true} assume !(i <= 1000);a := a[p := 5];assume p > 41 && p < 43;assume q > 41 && q < 43; {119#(and (< 41 main_q) (exists ((main_p Int)) (and (< main_p 43) (< 41 main_p) (= (select main_a main_p) 5))) (< main_q 43))} is VALID [2019-01-31 14:31:19,303 INFO L273 TraceCheckUtils]: 4: Hoare triple {119#(and (< 41 main_q) (exists ((main_p Int)) (and (< main_p 43) (< 41 main_p) (= (select main_a main_p) 5))) (< main_q 43))} assume !(a[q] == 5); {103#false} is VALID [2019-01-31 14:31:19,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 14:31:19,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:31:19,388 INFO L273 TraceCheckUtils]: 4: Hoare triple {123#(= (select main_a main_q) 5)} assume !(a[q] == 5); {103#false} is VALID [2019-01-31 14:31:19,398 INFO L273 TraceCheckUtils]: 3: Hoare triple {102#true} assume !(i <= 1000);a := a[p := 5];assume p > 41 && p < 43;assume q > 41 && q < 43; {123#(= (select main_a main_q) 5)} is VALID [2019-01-31 14:31:19,398 INFO L273 TraceCheckUtils]: 2: Hoare triple {102#true} assume i <= 1000;i := i + 1; {102#true} is VALID [2019-01-31 14:31:19,399 INFO L273 TraceCheckUtils]: 1: Hoare triple {102#true} assume i <= 1000;i := i + 1; {102#true} is VALID [2019-01-31 14:31:19,399 INFO L273 TraceCheckUtils]: 0: Hoare triple {102#true} i := 0; {102#true} is VALID [2019-01-31 14:31:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 14:31:19,418 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-01-31 14:31:19,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [4] total 7 [2019-01-31 14:31:19,419 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:31:19,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-31 14:31:19,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:19,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-31 14:31:19,431 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:19,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 14:31:19,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 14:31:19,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-31 14:31:19,432 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 3 states. [2019-01-31 14:31:19,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:19,442 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-01-31 14:31:19,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 14:31:19,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-31 14:31:19,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:19,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:31:19,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-31 14:31:19,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:31:19,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-31 14:31:19,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4 transitions. [2019-01-31 14:31:19,453 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:19,454 INFO L225 Difference]: With dead ends: 6 [2019-01-31 14:31:19,454 INFO L226 Difference]: Without dead ends: 0 [2019-01-31 14:31:19,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-31 14:31:19,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-31 14:31:19,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-31 14:31:19,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:19,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:19,455 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:19,455 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:19,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:19,456 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-31 14:31:19,456 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 14:31:19,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:19,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:19,457 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:19,457 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:19,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:19,457 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-31 14:31:19,457 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 14:31:19,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:19,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:19,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:19,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:19,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-31 14:31:19,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-31 14:31:19,458 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-01-31 14:31:19,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:19,459 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-31 14:31:19,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 14:31:19,459 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 14:31:19,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:19,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-31 14:31:19,551 INFO L451 ceAbstractionStarter]: At program point L15-1(lines 15 17) the Hoare annotation is: true [2019-01-31 14:31:19,552 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 10 22) no Hoare annotation was computed. [2019-01-31 14:31:19,552 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 22) no Hoare annotation was computed. [2019-01-31 14:31:19,552 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 21) no Hoare annotation was computed. [2019-01-31 14:31:19,552 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 22) no Hoare annotation was computed. [2019-01-31 14:31:19,552 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2019-01-31 14:31:19,553 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2019-01-31 14:31:19,554 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2019-01-31 14:31:19,554 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2019-01-31 14:31:19,554 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2019-01-31 14:31:19,554 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2019-01-31 14:31:19,554 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-01-31 14:31:19,557 INFO L202 PluginConnector]: Adding new model codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 02:31:19 BoogieIcfgContainer [2019-01-31 14:31:19,557 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-31 14:31:19,559 INFO L168 Benchmark]: Toolchain (without parser) took 3246.99 ms. Allocated memory was 139.5 MB in the beginning and 217.1 MB in the end (delta: 77.6 MB). Free memory was 107.1 MB in the beginning and 200.7 MB in the end (delta: -93.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 14:31:19,561 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 139.5 MB. Free memory is still 108.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 14:31:19,561 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.71 ms. Allocated memory is still 139.5 MB. Free memory was 107.1 MB in the beginning and 105.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:19,562 INFO L168 Benchmark]: Boogie Preprocessor took 21.78 ms. Allocated memory is still 139.5 MB. Free memory was 105.0 MB in the beginning and 103.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:19,563 INFO L168 Benchmark]: RCFGBuilder took 418.12 ms. Allocated memory is still 139.5 MB. Free memory was 103.8 MB in the beginning and 94.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:19,564 INFO L168 Benchmark]: TraceAbstraction took 2767.30 ms. Allocated memory was 139.5 MB in the beginning and 217.1 MB in the end (delta: 77.6 MB). Free memory was 93.7 MB in the beginning and 200.7 MB in the end (delta: -107.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 14:31:19,568 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 139.5 MB. Free memory is still 108.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.71 ms. Allocated memory is still 139.5 MB. Free memory was 107.1 MB in the beginning and 105.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.78 ms. Allocated memory is still 139.5 MB. Free memory was 105.0 MB in the beginning and 103.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 418.12 ms. Allocated memory is still 139.5 MB. Free memory was 103.8 MB in the beginning and 94.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2767.30 ms. Allocated memory was 139.5 MB in the beginning and 217.1 MB in the end (delta: 77.6 MB). Free memory was 93.7 MB in the beginning and 200.7 MB in the end (delta: -107.1 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 21]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: true - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 2.7s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11 SDtfs, 0 SDslu, 7 SDs, 0 SdLazy, 8 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 3 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 21 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 23 ConstructedInterpolants, 1 QuantifiedInterpolants, 235 SizeOfPredicates, 5 NumberOfNonLiveVariables, 25 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 6/12 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...