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/LargeConstant-ForwardSuccess.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 13:05:06,104 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 13:05:06,106 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 13:05:06,121 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 13:05:06,122 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 13:05:06,124 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 13:05:06,126 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 13:05:06,129 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 13:05:06,131 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 13:05:06,133 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 13:05:06,134 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 13:05:06,134 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 13:05:06,136 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 13:05:06,138 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 13:05:06,139 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 13:05:06,140 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 13:05:06,141 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 13:05:06,143 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 13:05:06,145 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 13:05:06,147 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 13:05:06,148 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 13:05:06,149 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 13:05:06,152 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 13:05:06,152 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 13:05:06,152 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 13:05:06,153 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 13:05:06,154 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 13:05:06,155 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 13:05:06,156 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 13:05:06,157 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 13:05:06,157 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 13:05:06,158 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 13:05:06,158 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 13:05:06,159 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 13:05:06,160 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 13:05:06,160 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 13:05:06,161 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-02-28 13:05:06,187 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 13:05:06,188 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 13:05:06,189 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 13:05:06,189 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 13:05:06,189 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 13:05:06,190 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 13:05:06,190 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 13:05:06,190 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 13:05:06,190 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-28 13:05:06,190 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 13:05:06,191 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-28 13:05:06,191 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-28 13:05:06,191 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 13:05:06,191 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 13:05:06,192 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 13:05:06,193 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 13:05:06,193 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 13:05:06,193 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 13:05:06,193 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 13:05:06,193 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 13:05:06,194 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 13:05:06,195 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 13:05:06,196 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 13:05:06,196 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 13:05:06,196 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 13:05:06,196 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 13:05:06,196 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 13:05:06,197 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 13:05:06,197 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 13:05:06,197 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 13:05:06,197 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 13:05:06,198 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:05:06,198 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 13:05:06,198 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 13:05:06,198 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 13:05:06,198 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 13:05:06,199 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 13:05:06,199 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 13:05:06,199 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 13:05:06,200 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 13:05:06,250 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 13:05:06,265 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 13:05:06,271 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 13:05:06,272 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 13:05:06,273 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 13:05:06,274 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl [2019-02-28 13:05:06,274 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl' [2019-02-28 13:05:06,322 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 13:05:06,324 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 13:05:06,324 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 13:05:06,324 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 13:05:06,325 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 13:05:06,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:05:06" (1/1) ... [2019-02-28 13:05:06,355 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:05:06" (1/1) ... [2019-02-28 13:05:06,361 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-28 13:05:06,362 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-28 13:05:06,362 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-28 13:05:06,364 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 13:05:06,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 13:05:06,366 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 13:05:06,366 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 13:05:06,378 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:05:06" (1/1) ... [2019-02-28 13:05:06,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:05:06" (1/1) ... [2019-02-28 13:05:06,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:05:06" (1/1) ... [2019-02-28 13:05:06,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:05:06" (1/1) ... [2019-02-28 13:05:06,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:05:06" (1/1) ... [2019-02-28 13:05:06,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:05:06" (1/1) ... [2019-02-28 13:05:06,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:05:06" (1/1) ... [2019-02-28 13:05:06,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 13:05:06,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 13:05:06,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 13:05:06,393 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 13:05:06,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:05:06" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:05:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure proc [2019-02-28 13:05:06,461 INFO L138 BoogieDeclarations]: Found implementation of procedure proc [2019-02-28 13:05:06,670 INFO L278 CfgBuilder]: Using library mode [2019-02-28 13:05:06,670 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-02-28 13:05:06,672 INFO L202 PluginConnector]: Adding new model LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:05:06 BoogieIcfgContainer [2019-02-28 13:05:06,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 13:05:06,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 13:05:06,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 13:05:06,676 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 13:05:06,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:05:06" (1/2) ... [2019-02-28 13:05:06,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@829ba5c and model type LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 01:05:06, skipping insertion in model container [2019-02-28 13:05:06,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:05:06" (2/2) ... [2019-02-28 13:05:06,681 INFO L112 eAbstractionObserver]: Analyzing ICFG LargeConstant-ForwardSuccess.bpl [2019-02-28 13:05:06,691 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 13:05:06,705 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-28 13:05:06,722 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-28 13:05:06,760 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 13:05:06,760 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 13:05:06,760 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 13:05:06,760 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 13:05:06,760 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 13:05:06,762 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 13:05:06,762 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 13:05:06,762 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 13:05:06,779 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2019-02-28 13:05:06,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-28 13:05:06,793 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:05:06,796 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-28 13:05:06,799 INFO L423 AbstractCegarLoop]: === Iteration 1 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:05:06,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:05:06,805 INFO L82 PathProgramCache]: Analyzing trace with hash 965, now seen corresponding path program 1 times [2019-02-28 13:05:06,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:05:06,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:06,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:05:06,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:06,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:05:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:07,031 INFO L273 TraceCheckUtils]: 0: Hoare triple {7#true} i := 0; {9#(<= proc_i 0)} is VALID [2019-02-28 13:05:07,055 INFO L273 TraceCheckUtils]: 1: Hoare triple {9#(<= proc_i 0)} assume !(i <= 1000); {8#false} is VALID [2019-02-28 13:05:07,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:05:07,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:05:07,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 13:05:07,063 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:05:07,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 13:05:07,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:05:07,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-28 13:05:07,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:07,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 13:05:07,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 13:05:07,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:05:07,093 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2019-02-28 13:05:07,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:07,207 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-02-28 13:05:07,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 13:05:07,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 13:05:07,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:05:07,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:05:07,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-02-28 13:05:07,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:05:07,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-02-28 13:05:07,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 7 transitions. [2019-02-28 13:05:07,253 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:07,262 INFO L225 Difference]: With dead ends: 7 [2019-02-28 13:05:07,262 INFO L226 Difference]: Without dead ends: 4 [2019-02-28 13:05:07,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-02-28 13:05:07,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2019-02-28 13:05:07,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2019-02-28 13:05:07,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:05:07,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4 states. Second operand 4 states. [2019-02-28 13:05:07,301 INFO L74 IsIncluded]: Start isIncluded. First operand 4 states. Second operand 4 states. [2019-02-28 13:05:07,301 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 4 states. [2019-02-28 13:05:07,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:07,303 INFO L93 Difference]: Finished difference Result 4 states and 4 transitions. [2019-02-28 13:05:07,303 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-02-28 13:05:07,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:07,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:07,304 INFO L74 IsIncluded]: Start isIncluded. First operand 4 states. Second operand 4 states. [2019-02-28 13:05:07,304 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 4 states. [2019-02-28 13:05:07,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:07,305 INFO L93 Difference]: Finished difference Result 4 states and 4 transitions. [2019-02-28 13:05:07,306 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-02-28 13:05:07,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:07,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:07,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:05:07,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:05:07,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:05:07,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-02-28 13:05:07,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2019-02-28 13:05:07,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:05:07,310 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2019-02-28 13:05:07,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 13:05:07,311 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-02-28 13:05:07,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 13:05:07,311 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:05:07,312 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 13:05:07,312 INFO L423 AbstractCegarLoop]: === Iteration 2 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:05:07,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:05:07,313 INFO L82 PathProgramCache]: Analyzing trace with hash 29950, now seen corresponding path program 1 times [2019-02-28 13:05:07,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:05:07,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:07,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:05:07,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:07,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:05:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:07,415 INFO L273 TraceCheckUtils]: 0: Hoare triple {35#true} i := 0; {37#(<= proc_i 0)} is VALID [2019-02-28 13:05:07,417 INFO L273 TraceCheckUtils]: 1: Hoare triple {37#(<= proc_i 0)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {38#(<= proc_i 4)} is VALID [2019-02-28 13:05:07,430 INFO L273 TraceCheckUtils]: 2: Hoare triple {38#(<= proc_i 4)} assume !(i <= 1000); {36#false} is VALID [2019-02-28 13:05:07,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:05:07,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:05:07,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:05:07,432 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 13:05:07,434 INFO L207 CegarAbsIntRunner]: [0], [4], [5] [2019-02-28 13:05:07,469 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 13:05:07,470 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:05:07,713 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 13:05:07,714 INFO L272 AbstractInterpreter]: Visited 3 different actions 9 times. Merged at 1 different actions 3 times. Never widened. Performed 95 root evaluator evaluations with a maximum evaluation depth of 2. Performed 95 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 13:05:07,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:05:07,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 13:05:07,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:05:07,723 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-02-28 13:05:07,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:05:07,748 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:05:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:07,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-28 13:05:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:07,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:05:08,014 INFO L273 TraceCheckUtils]: 0: Hoare triple {35#true} i := 0; {37#(<= proc_i 0)} is VALID [2019-02-28 13:05:08,028 INFO L273 TraceCheckUtils]: 1: Hoare triple {37#(<= proc_i 0)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {38#(<= proc_i 4)} is VALID [2019-02-28 13:05:08,044 INFO L273 TraceCheckUtils]: 2: Hoare triple {38#(<= proc_i 4)} assume !(i <= 1000); {36#false} is VALID [2019-02-28 13:05:08,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:05:08,045 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:05:08,526 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#(<= proc_i 1000)} assume !(i <= 1000); {36#false} is VALID [2019-02-28 13:05:08,536 INFO L273 TraceCheckUtils]: 1: Hoare triple {52#(< proc_i 997)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {48#(<= proc_i 1000)} is VALID [2019-02-28 13:05:08,551 INFO L273 TraceCheckUtils]: 0: Hoare triple {35#true} i := 0; {52#(< proc_i 997)} is VALID [2019-02-28 13:05:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:05:08,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 13:05:08,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2019-02-28 13:05:08,587 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 13:05:08,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-28 13:05:08,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:05:08,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-28 13:05:08,635 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:08,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 13:05:08,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 13:05:08,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-28 13:05:08,637 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2019-02-28 13:05:08,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:08,808 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-02-28 13:05:08,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 13:05:08,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-28 13:05:08,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:05:08,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:05:08,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-02-28 13:05:08,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:05:08,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-02-28 13:05:08,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 6 transitions. [2019-02-28 13:05:08,834 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:08,835 INFO L225 Difference]: With dead ends: 6 [2019-02-28 13:05:08,835 INFO L226 Difference]: Without dead ends: 5 [2019-02-28 13:05:08,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-28 13:05:08,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-02-28 13:05:08,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-02-28 13:05:08,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:05:08,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-02-28 13:05:08,861 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-02-28 13:05:08,862 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-02-28 13:05:08,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:08,863 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-02-28 13:05:08,863 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-28 13:05:08,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:08,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:08,864 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-02-28 13:05:08,864 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-02-28 13:05:08,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:08,865 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-02-28 13:05:08,865 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-28 13:05:08,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:08,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:08,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:05:08,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:05:08,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-28 13:05:08,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-02-28 13:05:08,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-02-28 13:05:08,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:05:08,868 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-02-28 13:05:08,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 13:05:08,868 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-28 13:05:08,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 13:05:08,868 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:05:08,868 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1] [2019-02-28 13:05:08,869 INFO L423 AbstractCegarLoop]: === Iteration 3 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:05:08,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:05:08,869 INFO L82 PathProgramCache]: Analyzing trace with hash 928485, now seen corresponding path program 2 times [2019-02-28 13:05:08,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:05:08,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:08,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:05:08,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:08,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:05:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:08,968 INFO L273 TraceCheckUtils]: 0: Hoare triple {82#true} i := 0; {84#(<= proc_i 0)} is VALID [2019-02-28 13:05:08,969 INFO L273 TraceCheckUtils]: 1: Hoare triple {84#(<= proc_i 0)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {85#(<= proc_i 4)} is VALID [2019-02-28 13:05:08,970 INFO L273 TraceCheckUtils]: 2: Hoare triple {85#(<= proc_i 4)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {86#(<= proc_i 8)} is VALID [2019-02-28 13:05:08,971 INFO L273 TraceCheckUtils]: 3: Hoare triple {86#(<= proc_i 8)} assume !(i <= 1000); {83#false} is VALID [2019-02-28 13:05:08,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:05:08,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:05:08,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:05:08,972 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 13:05:08,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 13:05:08,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:05:08,973 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-02-28 13:05:08,990 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 13:05:08,991 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 13:05:08,997 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-28 13:05:08,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 13:05:08,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-28 13:05:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:09,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:05:09,096 INFO L273 TraceCheckUtils]: 0: Hoare triple {82#true} i := 0; {84#(<= proc_i 0)} is VALID [2019-02-28 13:05:09,097 INFO L273 TraceCheckUtils]: 1: Hoare triple {84#(<= proc_i 0)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {85#(<= proc_i 4)} is VALID [2019-02-28 13:05:09,099 INFO L273 TraceCheckUtils]: 2: Hoare triple {85#(<= proc_i 4)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {86#(<= proc_i 8)} is VALID [2019-02-28 13:05:09,100 INFO L273 TraceCheckUtils]: 3: Hoare triple {86#(<= proc_i 8)} assume !(i <= 1000); {83#false} is VALID [2019-02-28 13:05:09,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:05:09,101 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:05:09,179 INFO L273 TraceCheckUtils]: 3: Hoare triple {99#(<= proc_i 1000)} assume !(i <= 1000); {83#false} is VALID [2019-02-28 13:05:09,180 INFO L273 TraceCheckUtils]: 2: Hoare triple {103#(< proc_i 997)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {99#(<= proc_i 1000)} is VALID [2019-02-28 13:05:09,182 INFO L273 TraceCheckUtils]: 1: Hoare triple {107#(< proc_i 993)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {103#(< proc_i 997)} is VALID [2019-02-28 13:05:09,183 INFO L273 TraceCheckUtils]: 0: Hoare triple {82#true} i := 0; {107#(< proc_i 993)} is VALID [2019-02-28 13:05:09,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:05:09,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 13:05:09,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2019-02-28 13:05:09,204 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 13:05:09,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-02-28 13:05:09,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:05:09,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2019-02-28 13:05:09,225 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:09,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-28 13:05:09,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-28 13:05:09,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-28 13:05:09,226 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2019-02-28 13:05:09,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:09,338 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-02-28 13:05:09,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 13:05:09,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-02-28 13:05:09,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:05:09,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-28 13:05:09,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2019-02-28 13:05:09,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-28 13:05:09,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2019-02-28 13:05:09,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 7 transitions. [2019-02-28 13:05:09,391 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:09,392 INFO L225 Difference]: With dead ends: 7 [2019-02-28 13:05:09,392 INFO L226 Difference]: Without dead ends: 6 [2019-02-28 13:05:09,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-28 13:05:09,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-02-28 13:05:09,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-02-28 13:05:09,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:05:09,434 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2019-02-28 13:05:09,434 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-02-28 13:05:09,434 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-02-28 13:05:09,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:09,435 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-02-28 13:05:09,436 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-28 13:05:09,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:09,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:09,436 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-02-28 13:05:09,436 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-02-28 13:05:09,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:09,438 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-02-28 13:05:09,438 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-28 13:05:09,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:09,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:09,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:05:09,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:05:09,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 13:05:09,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-02-28 13:05:09,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-02-28 13:05:09,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:05:09,440 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-02-28 13:05:09,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-28 13:05:09,440 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-28 13:05:09,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 13:05:09,441 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:05:09,441 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1] [2019-02-28 13:05:09,441 INFO L423 AbstractCegarLoop]: === Iteration 4 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:05:09,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:05:09,441 INFO L82 PathProgramCache]: Analyzing trace with hash 28783070, now seen corresponding path program 3 times [2019-02-28 13:05:09,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:05:09,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:09,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 13:05:09,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:09,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:05:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:09,752 INFO L273 TraceCheckUtils]: 0: Hoare triple {143#true} i := 0; {145#(<= proc_i 0)} is VALID [2019-02-28 13:05:09,770 INFO L273 TraceCheckUtils]: 1: Hoare triple {145#(<= proc_i 0)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {146#(<= proc_i 4)} is VALID [2019-02-28 13:05:09,780 INFO L273 TraceCheckUtils]: 2: Hoare triple {146#(<= proc_i 4)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {147#(<= proc_i 8)} is VALID [2019-02-28 13:05:09,793 INFO L273 TraceCheckUtils]: 3: Hoare triple {147#(<= proc_i 8)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {148#(<= proc_i 12)} is VALID [2019-02-28 13:05:09,806 INFO L273 TraceCheckUtils]: 4: Hoare triple {148#(<= proc_i 12)} assume !(i <= 1000); {144#false} is VALID [2019-02-28 13:05:09,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:05:09,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:05:09,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:05:09,807 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 13:05:09,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 13:05:09,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:05:09,807 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 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 [2019-02-28 13:05:09,826 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 13:05:09,827 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 13:05:09,845 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 13:05:09,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 13:05:09,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-28 13:05:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:09,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:05:09,904 INFO L273 TraceCheckUtils]: 0: Hoare triple {143#true} i := 0; {145#(<= proc_i 0)} is VALID [2019-02-28 13:05:09,905 INFO L273 TraceCheckUtils]: 1: Hoare triple {145#(<= proc_i 0)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {146#(<= proc_i 4)} is VALID [2019-02-28 13:05:09,906 INFO L273 TraceCheckUtils]: 2: Hoare triple {146#(<= proc_i 4)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {147#(<= proc_i 8)} is VALID [2019-02-28 13:05:09,908 INFO L273 TraceCheckUtils]: 3: Hoare triple {147#(<= proc_i 8)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {148#(<= proc_i 12)} is VALID [2019-02-28 13:05:09,909 INFO L273 TraceCheckUtils]: 4: Hoare triple {148#(<= proc_i 12)} assume !(i <= 1000); {144#false} is VALID [2019-02-28 13:05:09,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:05:09,910 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:05:10,110 INFO L273 TraceCheckUtils]: 4: Hoare triple {164#(<= proc_i 1000)} assume !(i <= 1000); {144#false} is VALID [2019-02-28 13:05:10,112 INFO L273 TraceCheckUtils]: 3: Hoare triple {168#(< proc_i 997)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {164#(<= proc_i 1000)} is VALID [2019-02-28 13:05:10,114 INFO L273 TraceCheckUtils]: 2: Hoare triple {172#(< proc_i 993)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {168#(< proc_i 997)} is VALID [2019-02-28 13:05:10,115 INFO L273 TraceCheckUtils]: 1: Hoare triple {176#(< proc_i 989)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {172#(< proc_i 993)} is VALID [2019-02-28 13:05:10,116 INFO L273 TraceCheckUtils]: 0: Hoare triple {143#true} i := 0; {176#(< proc_i 989)} is VALID [2019-02-28 13:05:10,117 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:05:10,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 13:05:10,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2019-02-28 13:05:10,137 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 13:05:10,137 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-02-28 13:05:10,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:05:10,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-02-28 13:05:10,146 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:10,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 13:05:10,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 13:05:10,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-28 13:05:10,147 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2019-02-28 13:05:10,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:10,205 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-28 13:05:10,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 13:05:10,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-02-28 13:05:10,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:05:10,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 13:05:10,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2019-02-28 13:05:10,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 13:05:10,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2019-02-28 13:05:10,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 8 transitions. [2019-02-28 13:05:10,226 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:10,227 INFO L225 Difference]: With dead ends: 8 [2019-02-28 13:05:10,227 INFO L226 Difference]: Without dead ends: 7 [2019-02-28 13:05:10,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-28 13:05:10,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-28 13:05:10,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-28 13:05:10,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:05:10,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-02-28 13:05:10,244 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-02-28 13:05:10,244 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-02-28 13:05:10,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:10,245 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-02-28 13:05:10,245 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-28 13:05:10,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:10,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:10,246 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-02-28 13:05:10,246 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-02-28 13:05:10,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:10,248 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-02-28 13:05:10,248 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-28 13:05:10,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:10,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:10,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:05:10,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:05:10,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-28 13:05:10,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-02-28 13:05:10,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-02-28 13:05:10,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:05:10,250 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-02-28 13:05:10,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 13:05:10,250 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-28 13:05:10,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 13:05:10,251 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:05:10,251 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1] [2019-02-28 13:05:10,251 INFO L423 AbstractCegarLoop]: === Iteration 5 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:05:10,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:05:10,252 INFO L82 PathProgramCache]: Analyzing trace with hash 892275205, now seen corresponding path program 4 times [2019-02-28 13:05:10,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:05:10,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:10,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 13:05:10,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:10,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:05:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:10,416 INFO L273 TraceCheckUtils]: 0: Hoare triple {218#true} i := 0; {220#(<= proc_i 0)} is VALID [2019-02-28 13:05:10,419 INFO L273 TraceCheckUtils]: 1: Hoare triple {220#(<= proc_i 0)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {221#(<= proc_i 4)} is VALID [2019-02-28 13:05:10,421 INFO L273 TraceCheckUtils]: 2: Hoare triple {221#(<= proc_i 4)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {222#(<= proc_i 8)} is VALID [2019-02-28 13:05:10,422 INFO L273 TraceCheckUtils]: 3: Hoare triple {222#(<= proc_i 8)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {223#(<= proc_i 12)} is VALID [2019-02-28 13:05:10,423 INFO L273 TraceCheckUtils]: 4: Hoare triple {223#(<= proc_i 12)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {224#(<= proc_i 16)} is VALID [2019-02-28 13:05:10,424 INFO L273 TraceCheckUtils]: 5: Hoare triple {224#(<= proc_i 16)} assume !(i <= 1000); {219#false} is VALID [2019-02-28 13:05:10,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:05:10,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:05:10,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:05:10,426 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 13:05:10,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 13:05:10,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:05:10,427 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 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 [2019-02-28 13:05:10,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:05:10,435 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:05:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:10,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 13:05:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:10,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:05:10,520 INFO L273 TraceCheckUtils]: 0: Hoare triple {218#true} i := 0; {220#(<= proc_i 0)} is VALID [2019-02-28 13:05:10,534 INFO L273 TraceCheckUtils]: 1: Hoare triple {220#(<= proc_i 0)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {221#(<= proc_i 4)} is VALID [2019-02-28 13:05:10,536 INFO L273 TraceCheckUtils]: 2: Hoare triple {221#(<= proc_i 4)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {222#(<= proc_i 8)} is VALID [2019-02-28 13:05:10,537 INFO L273 TraceCheckUtils]: 3: Hoare triple {222#(<= proc_i 8)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {223#(<= proc_i 12)} is VALID [2019-02-28 13:05:10,547 INFO L273 TraceCheckUtils]: 4: Hoare triple {223#(<= proc_i 12)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {224#(<= proc_i 16)} is VALID [2019-02-28 13:05:10,549 INFO L273 TraceCheckUtils]: 5: Hoare triple {224#(<= proc_i 16)} assume !(i <= 1000); {219#false} is VALID [2019-02-28 13:05:10,549 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:05:10,549 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:05:10,683 INFO L273 TraceCheckUtils]: 5: Hoare triple {243#(<= proc_i 1000)} assume !(i <= 1000); {219#false} is VALID [2019-02-28 13:05:10,684 INFO L273 TraceCheckUtils]: 4: Hoare triple {247#(< proc_i 997)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {243#(<= proc_i 1000)} is VALID [2019-02-28 13:05:10,688 INFO L273 TraceCheckUtils]: 3: Hoare triple {251#(< proc_i 993)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {247#(< proc_i 997)} is VALID [2019-02-28 13:05:10,689 INFO L273 TraceCheckUtils]: 2: Hoare triple {255#(< proc_i 989)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {251#(< proc_i 993)} is VALID [2019-02-28 13:05:10,697 INFO L273 TraceCheckUtils]: 1: Hoare triple {259#(< proc_i 985)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {255#(< proc_i 989)} is VALID [2019-02-28 13:05:10,698 INFO L273 TraceCheckUtils]: 0: Hoare triple {218#true} i := 0; {259#(< proc_i 985)} is VALID [2019-02-28 13:05:10,698 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:05:10,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 13:05:10,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2019-02-28 13:05:10,720 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 13:05:10,721 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-02-28 13:05:10,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:05:10,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2019-02-28 13:05:10,758 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:10,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-28 13:05:10,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-28 13:05:10,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-28 13:05:10,759 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2019-02-28 13:05:10,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:10,807 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-02-28 13:05:10,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 13:05:10,807 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-02-28 13:05:10,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:05:10,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-28 13:05:10,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-02-28 13:05:10,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-28 13:05:10,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-02-28 13:05:10,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 9 transitions. [2019-02-28 13:05:10,820 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:10,821 INFO L225 Difference]: With dead ends: 9 [2019-02-28 13:05:10,821 INFO L226 Difference]: Without dead ends: 8 [2019-02-28 13:05:10,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-28 13:05:10,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-28 13:05:10,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-02-28 13:05:10,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:05:10,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2019-02-28 13:05:10,828 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-02-28 13:05:10,828 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-02-28 13:05:10,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:10,829 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-28 13:05:10,829 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-28 13:05:10,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:10,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:10,830 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-02-28 13:05:10,830 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-02-28 13:05:10,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:10,831 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-28 13:05:10,831 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-28 13:05:10,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:10,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:10,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:05:10,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:05:10,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 13:05:10,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-02-28 13:05:10,833 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-02-28 13:05:10,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:05:10,833 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-02-28 13:05:10,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-28 13:05:10,833 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-28 13:05:10,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 13:05:10,834 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:05:10,834 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1] [2019-02-28 13:05:10,834 INFO L423 AbstractCegarLoop]: === Iteration 6 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:05:10,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:05:10,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1890727614, now seen corresponding path program 5 times [2019-02-28 13:05:10,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:05:10,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:10,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:05:10,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:10,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:05:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:10,964 INFO L273 TraceCheckUtils]: 0: Hoare triple {307#true} i := 0; {309#(<= proc_i 0)} is VALID [2019-02-28 13:05:10,966 INFO L273 TraceCheckUtils]: 1: Hoare triple {309#(<= proc_i 0)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {310#(<= proc_i 4)} is VALID [2019-02-28 13:05:10,967 INFO L273 TraceCheckUtils]: 2: Hoare triple {310#(<= proc_i 4)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {311#(<= proc_i 8)} is VALID [2019-02-28 13:05:10,967 INFO L273 TraceCheckUtils]: 3: Hoare triple {311#(<= proc_i 8)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {312#(<= proc_i 12)} is VALID [2019-02-28 13:05:10,968 INFO L273 TraceCheckUtils]: 4: Hoare triple {312#(<= proc_i 12)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {313#(<= proc_i 16)} is VALID [2019-02-28 13:05:10,969 INFO L273 TraceCheckUtils]: 5: Hoare triple {313#(<= proc_i 16)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {314#(<= proc_i 20)} is VALID [2019-02-28 13:05:10,970 INFO L273 TraceCheckUtils]: 6: Hoare triple {314#(<= proc_i 20)} assume !(i <= 1000); {308#false} is VALID [2019-02-28 13:05:10,971 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:05:10,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:05:10,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:05:10,971 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 13:05:10,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 13:05:10,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:05:10,972 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 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 [2019-02-28 13:05:10,981 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 13:05:10,981 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 13:05:10,990 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-28 13:05:10,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 13:05:10,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 13:05:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:10,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:05:11,183 INFO L169 IndexEqualityManager]: detected equality via solver [2019-02-28 13:05:11,191 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-02-28 13:05:11,227 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:05:11,237 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:05:11,238 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2019-02-28 13:05:11,254 INFO L273 TraceCheckUtils]: 0: Hoare triple {307#true} i := 0; {307#true} is VALID [2019-02-28 13:05:11,255 INFO L273 TraceCheckUtils]: 1: Hoare triple {307#true} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {321#(and (< 4 proc_j) (< proc_j 6) (<= (select proc_a 5) 1000))} is VALID [2019-02-28 13:05:11,256 INFO L273 TraceCheckUtils]: 2: Hoare triple {321#(and (< 4 proc_j) (< proc_j 6) (<= (select proc_a 5) 1000))} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {321#(and (< 4 proc_j) (< proc_j 6) (<= (select proc_a 5) 1000))} is VALID [2019-02-28 13:05:11,266 INFO L273 TraceCheckUtils]: 3: Hoare triple {321#(and (< 4 proc_j) (< proc_j 6) (<= (select proc_a 5) 1000))} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {321#(and (< 4 proc_j) (< proc_j 6) (<= (select proc_a 5) 1000))} is VALID [2019-02-28 13:05:11,267 INFO L273 TraceCheckUtils]: 4: Hoare triple {321#(and (< 4 proc_j) (< proc_j 6) (<= (select proc_a 5) 1000))} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {321#(and (< 4 proc_j) (< proc_j 6) (<= (select proc_a 5) 1000))} is VALID [2019-02-28 13:05:11,268 INFO L273 TraceCheckUtils]: 5: Hoare triple {321#(and (< 4 proc_j) (< proc_j 6) (<= (select proc_a 5) 1000))} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {334#(<= proc_i 999)} is VALID [2019-02-28 13:05:11,269 INFO L273 TraceCheckUtils]: 6: Hoare triple {334#(<= proc_i 999)} assume !(i <= 1000); {308#false} is VALID [2019-02-28 13:05:11,269 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-28 13:05:11,269 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:05:11,335 INFO L273 TraceCheckUtils]: 6: Hoare triple {338#(<= proc_i 1000)} assume !(i <= 1000); {308#false} is VALID [2019-02-28 13:05:11,336 INFO L273 TraceCheckUtils]: 5: Hoare triple {342#(< (select proc_a proc_j) 1002)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {338#(<= proc_i 1000)} is VALID [2019-02-28 13:05:11,337 INFO L273 TraceCheckUtils]: 4: Hoare triple {342#(< (select proc_a proc_j) 1002)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {342#(< (select proc_a proc_j) 1002)} is VALID [2019-02-28 13:05:11,337 INFO L273 TraceCheckUtils]: 3: Hoare triple {342#(< (select proc_a proc_j) 1002)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {342#(< (select proc_a proc_j) 1002)} is VALID [2019-02-28 13:05:11,338 INFO L273 TraceCheckUtils]: 2: Hoare triple {342#(< (select proc_a proc_j) 1002)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {342#(< (select proc_a proc_j) 1002)} is VALID [2019-02-28 13:05:11,339 INFO L273 TraceCheckUtils]: 1: Hoare triple {307#true} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {342#(< (select proc_a proc_j) 1002)} is VALID [2019-02-28 13:05:11,340 INFO L273 TraceCheckUtils]: 0: Hoare triple {307#true} i := 0; {307#true} is VALID [2019-02-28 13:05:11,340 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-28 13:05:11,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 13:05:11,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 11 [2019-02-28 13:05:11,362 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 13:05:11,362 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-28 13:05:11,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:05:11,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2019-02-28 13:05:11,374 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:11,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 13:05:11,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 13:05:11,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-02-28 13:05:11,376 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 10 states. [2019-02-28 13:05:11,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:11,584 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-02-28 13:05:11,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 13:05:11,584 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-28 13:05:11,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:05:11,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-28 13:05:11,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-02-28 13:05:11,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-28 13:05:11,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-02-28 13:05:11,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 10 transitions. [2019-02-28 13:05:11,611 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:11,611 INFO L225 Difference]: With dead ends: 9 [2019-02-28 13:05:11,611 INFO L226 Difference]: Without dead ends: 0 [2019-02-28 13:05:11,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=190, Unknown=0, NotChecked=0, Total=306 [2019-02-28 13:05:11,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-28 13:05:11,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-28 13:05:11,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:05:11,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-02-28 13:05:11,613 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-28 13:05:11,613 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-28 13:05:11,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:11,613 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-28 13:05:11,613 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 13:05:11,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:11,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:11,614 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-28 13:05:11,614 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-28 13:05:11,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:11,614 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-28 13:05:11,614 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 13:05:11,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:11,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:11,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:05:11,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:05:11,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-28 13:05:11,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-28 13:05:11,615 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2019-02-28 13:05:11,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:05:11,615 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-28 13:05:11,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 13:05:11,615 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 13:05:11,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:11,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-28 13:05:11,730 INFO L444 ceAbstractionStarter]: At program point L17-1(lines 12 25) the Hoare annotation is: (or (and (< 4 proc_j) (< proc_j 6) (<= proc_i 999) (<= (select proc_a 5) 1000)) (<= proc_i 0)) [2019-02-28 13:05:11,730 INFO L448 ceAbstractionStarter]: For program point procEXIT(lines 12 25) no Hoare annotation was computed. [2019-02-28 13:05:11,730 INFO L448 ceAbstractionStarter]: For program point procErr0ASSERT_VIOLATIONASSERT(line 18) no Hoare annotation was computed. [2019-02-28 13:05:11,730 INFO L448 ceAbstractionStarter]: For program point procENTRY(lines 12 25) no Hoare annotation was computed. [2019-02-28 13:05:11,732 WARN L170 areAnnotationChecker]: procENTRY has no Hoare annotation [2019-02-28 13:05:11,732 WARN L170 areAnnotationChecker]: procErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2019-02-28 13:05:11,733 WARN L170 areAnnotationChecker]: procEXIT has no Hoare annotation [2019-02-28 13:05:11,733 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-02-28 13:05:11,739 INFO L202 PluginConnector]: Adding new model LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.02 01:05:11 BoogieIcfgContainer [2019-02-28 13:05:11,739 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-28 13:05:11,741 INFO L168 Benchmark]: Toolchain (without parser) took 5418.01 ms. Allocated memory was 140.5 MB in the beginning and 255.9 MB in the end (delta: 115.3 MB). Free memory was 107.9 MB in the beginning and 181.3 MB in the end (delta: -73.4 MB). Peak memory consumption was 42.0 MB. Max. memory is 7.1 GB. [2019-02-28 13:05:11,742 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 140.5 MB. Free memory is still 109.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-28 13:05:11,743 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.73 ms. Allocated memory is still 140.5 MB. Free memory was 107.9 MB in the beginning and 106.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-02-28 13:05:11,743 INFO L168 Benchmark]: Boogie Preprocessor took 24.96 ms. Allocated memory is still 140.5 MB. Free memory was 106.0 MB in the beginning and 104.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-02-28 13:05:11,744 INFO L168 Benchmark]: RCFGBuilder took 279.02 ms. Allocated memory is still 140.5 MB. Free memory was 104.9 MB in the beginning and 95.7 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-02-28 13:05:11,745 INFO L168 Benchmark]: TraceAbstraction took 5066.46 ms. Allocated memory was 140.5 MB in the beginning and 255.9 MB in the end (delta: 115.3 MB). Free memory was 95.3 MB in the beginning and 181.3 MB in the end (delta: -86.0 MB). Peak memory consumption was 29.4 MB. Max. memory is 7.1 GB. [2019-02-28 13:05:11,749 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.21 ms. Allocated memory is still 140.5 MB. Free memory is still 109.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.73 ms. Allocated memory is still 140.5 MB. Free memory was 107.9 MB in the beginning and 106.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.96 ms. Allocated memory is still 140.5 MB. Free memory was 106.0 MB in the beginning and 104.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 279.02 ms. Allocated memory is still 140.5 MB. Free memory was 104.9 MB in the beginning and 95.7 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5066.46 ms. Allocated memory was 140.5 MB in the beginning and 255.9 MB in the end (delta: 115.3 MB). Free memory was 95.3 MB in the beginning and 181.3 MB in the end (delta: -86.0 MB). Peak memory consumption was 29.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: 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: 12]: Loop Invariant Derived loop invariant: (((4 < j && j < 6) && i <= 999) && a[5] <= 1000) || i <= 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 4 locations, 1 error locations. SAFE Result, 4.9s OverallTime, 6 OverallIterations, 5 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 12 SDtfs, 1 SDslu, 2 SDs, 0 SdLazy, 40 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 7 NumberOfFragments, 19 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 75 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 52 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 1053 SizeOfPredicates, 5 NumberOfNonLiveVariables, 121 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 16 InterpolantComputations, 1 PerfectInterpolantSequences, 22/105 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...