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_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1377b90 [2019-01-07 14:43:20,124 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 14:43:20,127 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 14:43:20,144 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 14:43:20,144 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 14:43:20,146 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 14:43:20,147 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 14:43:20,150 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 14:43:20,152 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 14:43:20,154 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 14:43:20,155 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 14:43:20,157 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 14:43:20,158 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 14:43:20,168 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 14:43:20,169 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 14:43:20,170 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 14:43:20,173 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 14:43:20,175 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 14:43:20,178 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 14:43:20,180 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 14:43:20,183 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 14:43:20,185 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 14:43:20,190 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 14:43:20,190 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 14:43:20,190 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 14:43:20,192 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 14:43:20,193 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 14:43:20,194 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 14:43:20,194 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 14:43:20,198 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 14:43:20,200 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 14:43:20,201 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 14:43:20,201 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 14:43:20,202 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 14:43:20,204 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 14:43:20,205 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 14:43:20,205 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-07 14:43:20,224 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 14:43:20,225 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 14:43:20,226 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 14:43:20,226 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 14:43:20,226 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 14:43:20,226 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 14:43:20,226 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 14:43:20,227 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 14:43:20,227 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 14:43:20,227 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-07 14:43:20,227 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-07 14:43:20,227 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 14:43:20,227 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 14:43:20,229 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 14:43:20,229 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 14:43:20,229 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 14:43:20,229 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 14:43:20,229 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 14:43:20,230 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 14:43:20,230 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 14:43:20,230 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 14:43:20,230 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 14:43:20,230 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 14:43:20,230 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 14:43:20,232 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 14:43:20,233 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 14:43:20,233 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 14:43:20,233 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 14:43:20,233 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 14:43:20,233 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 14:43:20,234 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 14:43:20,234 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 14:43:20,234 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 14:43:20,234 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 14:43:20,234 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 14:43:20,235 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 14:43:20,235 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 14:43:20,235 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 14:43:20,235 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 14:43:20,279 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 14:43:20,291 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 14:43:20,294 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 14:43:20,295 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 14:43:20,296 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 14:43:20,296 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-01-07 14:43:20,297 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl' [2019-01-07 14:43:20,334 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 14:43:20,336 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 14:43:20,337 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 14:43:20,337 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 14:43:20,337 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 14:43:20,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:20" (1/1) ... [2019-01-07 14:43:20,366 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:20" (1/1) ... [2019-01-07 14:43:20,372 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-07 14:43:20,372 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-07 14:43:20,373 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-07 14:43:20,374 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 14:43:20,375 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 14:43:20,375 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 14:43:20,375 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 14:43:20,388 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:20" (1/1) ... [2019-01-07 14:43:20,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:20" (1/1) ... [2019-01-07 14:43:20,389 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:20" (1/1) ... [2019-01-07 14:43:20,389 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:20" (1/1) ... [2019-01-07 14:43:20,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:20" (1/1) ... [2019-01-07 14:43:20,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:20" (1/1) ... [2019-01-07 14:43:20,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:20" (1/1) ... [2019-01-07 14:43:20,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 14:43:20,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 14:43:20,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 14:43:20,397 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 14:43:20,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 14:43:20,467 INFO L130 BoogieDeclarations]: Found specification of procedure proc [2019-01-07 14:43:20,468 INFO L138 BoogieDeclarations]: Found implementation of procedure proc [2019-01-07 14:43:20,788 INFO L278 CfgBuilder]: Using library mode [2019-01-07 14:43:20,788 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-07 14:43:20,790 INFO L202 PluginConnector]: Adding new model LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 02:43:20 BoogieIcfgContainer [2019-01-07 14:43:20,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 14:43:20,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 14:43:20,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 14:43:20,795 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 14:43:20,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:20" (1/2) ... [2019-01-07 14:43:20,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a332cf and model type LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 02:43:20, skipping insertion in model container [2019-01-07 14:43:20,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 02:43:20" (2/2) ... [2019-01-07 14:43:20,799 INFO L112 eAbstractionObserver]: Analyzing ICFG LargeConstant-ForwardSuccess.bpl [2019-01-07 14:43:20,810 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 14:43:20,820 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-07 14:43:20,840 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-07 14:43:20,878 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 14:43:20,878 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 14:43:20,878 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 14:43:20,878 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 14:43:20,879 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 14:43:20,879 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 14:43:20,879 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 14:43:20,879 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 14:43:20,898 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2019-01-07 14:43:20,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-07 14:43:20,911 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:43:20,915 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-07 14:43:20,919 INFO L423 AbstractCegarLoop]: === Iteration 1 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:43:20,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:43:20,928 INFO L82 PathProgramCache]: Analyzing trace with hash 965, now seen corresponding path program 1 times [2019-01-07 14:43:20,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:43:20,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:43:20,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:43:20,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:43:20,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:43:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:43:21,204 INFO L273 TraceCheckUtils]: 0: Hoare triple {7#true} i := 0; {9#(<= proc_i 0)} is VALID [2019-01-07 14:43:21,223 INFO L273 TraceCheckUtils]: 1: Hoare triple {9#(<= proc_i 0)} assume !(i <= 1000); {8#false} is VALID [2019-01-07 14:43:21,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:43:21,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 14:43:21,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-07 14:43:21,230 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 14:43:21,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-07 14:43:21,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:43:21,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-07 14:43:21,273 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:43:21,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 14:43:21,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 14:43:21,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 14:43:21,286 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2019-01-07 14:43:21,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:21,408 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-01-07 14:43:21,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 14:43:21,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-07 14:43:21,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:43:21,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 14:43:21,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-07 14:43:21,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 14:43:21,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-07 14:43:21,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 7 transitions. [2019-01-07 14:43:21,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:43:21,496 INFO L225 Difference]: With dead ends: 7 [2019-01-07 14:43:21,496 INFO L226 Difference]: Without dead ends: 4 [2019-01-07 14:43:21,499 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-01-07 14:43:21,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2019-01-07 14:43:21,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2019-01-07 14:43:21,565 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:43:21,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4 states. Second operand 4 states. [2019-01-07 14:43:21,566 INFO L74 IsIncluded]: Start isIncluded. First operand 4 states. Second operand 4 states. [2019-01-07 14:43:21,566 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 4 states. [2019-01-07 14:43:21,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:21,568 INFO L93 Difference]: Finished difference Result 4 states and 4 transitions. [2019-01-07 14:43:21,568 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-01-07 14:43:21,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:43:21,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:43:21,569 INFO L74 IsIncluded]: Start isIncluded. First operand 4 states. Second operand 4 states. [2019-01-07 14:43:21,569 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 4 states. [2019-01-07 14:43:21,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:21,570 INFO L93 Difference]: Finished difference Result 4 states and 4 transitions. [2019-01-07 14:43:21,571 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-01-07 14:43:21,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:43:21,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:43:21,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:43:21,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:43:21,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 14:43:21,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-01-07 14:43:21,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2019-01-07 14:43:21,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:43:21,575 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2019-01-07 14:43:21,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 14:43:21,575 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-01-07 14:43:21,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 14:43:21,576 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:43:21,576 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 14:43:21,576 INFO L423 AbstractCegarLoop]: === Iteration 2 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:43:21,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:43:21,577 INFO L82 PathProgramCache]: Analyzing trace with hash 29950, now seen corresponding path program 1 times [2019-01-07 14:43:21,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:43:21,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:43:21,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:43:21,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:43:21,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:43:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:43:21,879 INFO L273 TraceCheckUtils]: 0: Hoare triple {35#true} i := 0; {37#(<= proc_i 0)} is VALID [2019-01-07 14:43:21,880 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-01-07 14:43:21,881 INFO L273 TraceCheckUtils]: 2: Hoare triple {38#(<= proc_i 4)} assume !(i <= 1000); {36#false} is VALID [2019-01-07 14:43:21,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:43:21,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:43:21,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:43:21,884 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 14:43:21,887 INFO L207 CegarAbsIntRunner]: [0], [4], [5] [2019-01-07 14:43:21,950 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 14:43:21,950 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 14:43:36,096 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 14:43:36,098 INFO L272 AbstractInterpreter]: Visited 3 different actions 17 times. Merged at 1 different actions 7 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 14:43:36,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:43:36,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 14:43:36,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:43:36,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 14:43:36,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:43:36,198 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 14:43:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:43:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:43:36,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 14:43:36,309 INFO L273 TraceCheckUtils]: 0: Hoare triple {35#true} i := 0; {37#(<= proc_i 0)} is VALID [2019-01-07 14:43:36,323 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-01-07 14:43:36,335 INFO L273 TraceCheckUtils]: 2: Hoare triple {38#(<= proc_i 4)} assume !(i <= 1000); {36#false} is VALID [2019-01-07 14:43:36,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:43:36,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 14:43:36,495 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#(<= proc_i 1000)} assume !(i <= 1000); {36#false} is VALID [2019-01-07 14:43:36,497 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-01-07 14:43:36,498 INFO L273 TraceCheckUtils]: 0: Hoare triple {35#true} i := 0; {52#(< proc_i 997)} is VALID [2019-01-07 14:43:36,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:43:36,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 14:43:36,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2019-01-07 14:43:36,522 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 14:43:36,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-07 14:43:36,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:43:36,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-07 14:43:36,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:43:36,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 14:43:36,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 14:43:36,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-07 14:43:36,536 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2019-01-07 14:43:36,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:36,624 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-01-07 14:43:36,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 14:43:36,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-07 14:43:36,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:43:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 14:43:36,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-01-07 14:43:36,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 14:43:36,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-01-07 14:43:36,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 6 transitions. [2019-01-07 14:43:36,636 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:43:36,637 INFO L225 Difference]: With dead ends: 6 [2019-01-07 14:43:36,637 INFO L226 Difference]: Without dead ends: 5 [2019-01-07 14:43:36,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-07 14:43:36,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-07 14:43:36,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-07 14:43:36,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:43:36,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-01-07 14:43:36,645 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-07 14:43:36,645 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-07 14:43:36,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:36,646 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-07 14:43:36,646 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-07 14:43:36,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:43:36,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:43:36,647 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-07 14:43:36,647 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-07 14:43:36,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:36,649 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-07 14:43:36,649 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-07 14:43:36,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:43:36,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:43:36,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:43:36,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:43:36,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-07 14:43:36,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-07 14:43:36,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-07 14:43:36,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:43:36,652 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-07 14:43:36,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 14:43:36,653 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-07 14:43:36,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 14:43:36,653 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:43:36,653 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1] [2019-01-07 14:43:36,654 INFO L423 AbstractCegarLoop]: === Iteration 3 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:43:36,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:43:36,654 INFO L82 PathProgramCache]: Analyzing trace with hash 928485, now seen corresponding path program 2 times [2019-01-07 14:43:36,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:43:36,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:43:36,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:43:36,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:43:36,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:43:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:43:36,760 INFO L273 TraceCheckUtils]: 0: Hoare triple {82#true} i := 0; {84#(<= proc_i 0)} is VALID [2019-01-07 14:43:36,761 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-01-07 14:43:36,762 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-01-07 14:43:36,762 INFO L273 TraceCheckUtils]: 3: Hoare triple {86#(<= proc_i 8)} assume !(i <= 1000); {83#false} is VALID [2019-01-07 14:43:36,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:43:36,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:43:36,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:43:36,763 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 14:43:36,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 14:43:36,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:43:36,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 14:43:36,773 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 14:43:36,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 14:43:36,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-07 14:43:36,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 14:43:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:43:36,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 14:43:37,084 INFO L273 TraceCheckUtils]: 0: Hoare triple {82#true} i := 0; {84#(<= proc_i 0)} is VALID [2019-01-07 14:43:37,087 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-01-07 14:43:37,088 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-01-07 14:43:37,089 INFO L273 TraceCheckUtils]: 3: Hoare triple {86#(<= proc_i 8)} assume !(i <= 1000); {83#false} is VALID [2019-01-07 14:43:37,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:43:37,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 14:43:37,153 INFO L273 TraceCheckUtils]: 3: Hoare triple {99#(<= proc_i 1000)} assume !(i <= 1000); {83#false} is VALID [2019-01-07 14:43:37,168 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-01-07 14:43:37,177 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-01-07 14:43:37,192 INFO L273 TraceCheckUtils]: 0: Hoare triple {82#true} i := 0; {107#(< proc_i 993)} is VALID [2019-01-07 14:43:37,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:43:37,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 14:43:37,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2019-01-07 14:43:37,228 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 14:43:37,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-01-07 14:43:37,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:43:37,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2019-01-07 14:43:37,280 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:43:37,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-07 14:43:37,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-07 14:43:37,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-07 14:43:37,282 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2019-01-07 14:43:37,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:37,550 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-01-07 14:43:37,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 14:43:37,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-01-07 14:43:37,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:43:37,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-07 14:43:37,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2019-01-07 14:43:37,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-07 14:43:37,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2019-01-07 14:43:37,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 7 transitions. [2019-01-07 14:43:37,564 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:43:37,565 INFO L225 Difference]: With dead ends: 7 [2019-01-07 14:43:37,565 INFO L226 Difference]: Without dead ends: 6 [2019-01-07 14:43:37,565 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-01-07 14:43:37,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-07 14:43:37,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-07 14:43:37,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:43:37,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2019-01-07 14:43:37,578 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-01-07 14:43:37,578 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-01-07 14:43:37,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:37,579 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-01-07 14:43:37,580 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-07 14:43:37,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:43:37,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:43:37,580 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-01-07 14:43:37,580 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-01-07 14:43:37,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:37,581 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-01-07 14:43:37,583 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-07 14:43:37,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:43:37,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:43:37,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:43:37,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:43:37,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-07 14:43:37,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-07 14:43:37,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-01-07 14:43:37,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:43:37,585 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-07 14:43:37,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-07 14:43:37,585 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-07 14:43:37,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 14:43:37,586 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:43:37,586 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1] [2019-01-07 14:43:37,587 INFO L423 AbstractCegarLoop]: === Iteration 4 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:43:37,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:43:37,587 INFO L82 PathProgramCache]: Analyzing trace with hash 28783070, now seen corresponding path program 3 times [2019-01-07 14:43:37,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:43:37,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:43:37,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 14:43:37,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:43:37,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:43:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:43:37,702 INFO L273 TraceCheckUtils]: 0: Hoare triple {143#true} i := 0; {145#(<= proc_i 0)} is VALID [2019-01-07 14:43:37,709 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-01-07 14:43:37,710 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-01-07 14:43:37,711 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-01-07 14:43:37,711 INFO L273 TraceCheckUtils]: 4: Hoare triple {148#(<= proc_i 12)} assume !(i <= 1000); {144#false} is VALID [2019-01-07 14:43:37,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:43:37,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:43:37,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:43:37,712 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 14:43:37,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 14:43:37,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:43:37,713 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-01-07 14:43:37,723 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 14:43:37,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 14:43:37,733 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 14:43:37,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 14:43:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:43:37,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 14:43:37,766 INFO L273 TraceCheckUtils]: 0: Hoare triple {143#true} i := 0; {145#(<= proc_i 0)} is VALID [2019-01-07 14:43:37,767 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-01-07 14:43:37,768 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-01-07 14:43:37,769 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-01-07 14:43:37,770 INFO L273 TraceCheckUtils]: 4: Hoare triple {148#(<= proc_i 12)} assume !(i <= 1000); {144#false} is VALID [2019-01-07 14:43:37,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:43:37,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 14:43:37,836 INFO L273 TraceCheckUtils]: 4: Hoare triple {164#(<= proc_i 1000)} assume !(i <= 1000); {144#false} is VALID [2019-01-07 14:43:37,837 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-01-07 14:43:37,838 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-01-07 14:43:37,839 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-01-07 14:43:37,840 INFO L273 TraceCheckUtils]: 0: Hoare triple {143#true} i := 0; {176#(< proc_i 989)} is VALID [2019-01-07 14:43:37,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:43:37,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 14:43:37,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2019-01-07 14:43:37,861 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 14:43:37,861 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-01-07 14:43:37,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:43:37,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-01-07 14:43:37,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:43:37,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 14:43:37,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 14:43:37,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-07 14:43:37,873 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2019-01-07 14:43:37,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:37,911 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-07 14:43:37,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 14:43:37,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-01-07 14:43:37,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:43:37,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-07 14:43:37,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2019-01-07 14:43:37,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-07 14:43:37,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2019-01-07 14:43:37,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 8 transitions. [2019-01-07 14:43:37,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:43:37,932 INFO L225 Difference]: With dead ends: 8 [2019-01-07 14:43:37,932 INFO L226 Difference]: Without dead ends: 7 [2019-01-07 14:43:37,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-07 14:43:37,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-07 14:43:37,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-07 14:43:37,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:43:37,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-01-07 14:43:37,964 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-01-07 14:43:37,964 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-01-07 14:43:37,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:37,965 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-01-07 14:43:37,965 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-07 14:43:37,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:43:37,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:43:37,965 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-01-07 14:43:37,965 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-01-07 14:43:37,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:37,966 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-01-07 14:43:37,966 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-07 14:43:37,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:43:37,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:43:37,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:43:37,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:43:37,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-07 14:43:37,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-07 14:43:37,968 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-01-07 14:43:37,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:43:37,968 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-07 14:43:37,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 14:43:37,968 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-07 14:43:37,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 14:43:37,969 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:43:37,969 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1] [2019-01-07 14:43:37,969 INFO L423 AbstractCegarLoop]: === Iteration 5 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:43:37,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:43:37,970 INFO L82 PathProgramCache]: Analyzing trace with hash 892275205, now seen corresponding path program 4 times [2019-01-07 14:43:37,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:43:37,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:43:37,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 14:43:37,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:43:37,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:43:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:43:38,141 INFO L273 TraceCheckUtils]: 0: Hoare triple {218#true} i := 0; {220#(<= proc_i 0)} is VALID [2019-01-07 14:43:38,142 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-01-07 14:43:38,143 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-01-07 14:43:38,144 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-01-07 14:43:38,146 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-01-07 14:43:38,147 INFO L273 TraceCheckUtils]: 5: Hoare triple {224#(<= proc_i 16)} assume !(i <= 1000); {219#false} is VALID [2019-01-07 14:43:38,148 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:43:38,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:43:38,148 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:43:38,149 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 14:43:38,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 14:43:38,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:43:38,149 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-01-07 14:43:38,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:43:38,158 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 14:43:38,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:43:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:43:38,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 14:43:38,317 INFO L273 TraceCheckUtils]: 0: Hoare triple {218#true} i := 0; {220#(<= proc_i 0)} is VALID [2019-01-07 14:43:38,327 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-01-07 14:43:38,328 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-01-07 14:43:38,329 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-01-07 14:43:38,330 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-01-07 14:43:38,333 INFO L273 TraceCheckUtils]: 5: Hoare triple {224#(<= proc_i 16)} assume !(i <= 1000); {219#false} is VALID [2019-01-07 14:43:38,333 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:43:38,333 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 14:43:38,545 INFO L273 TraceCheckUtils]: 5: Hoare triple {243#(<= proc_i 1000)} assume !(i <= 1000); {219#false} is VALID [2019-01-07 14:43:38,546 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-01-07 14:43:38,550 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-01-07 14:43:38,551 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-01-07 14:43:38,556 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-01-07 14:43:38,556 INFO L273 TraceCheckUtils]: 0: Hoare triple {218#true} i := 0; {259#(< proc_i 985)} is VALID [2019-01-07 14:43:38,557 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:43:38,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 14:43:38,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2019-01-07 14:43:38,576 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 14:43:38,576 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-01-07 14:43:38,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:43:38,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2019-01-07 14:43:38,591 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:43:38,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-07 14:43:38,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-07 14:43:38,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-07 14:43:38,592 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2019-01-07 14:43:38,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:38,618 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-01-07 14:43:38,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 14:43:38,618 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-01-07 14:43:38,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:43:38,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-07 14:43:38,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-01-07 14:43:38,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-07 14:43:38,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-01-07 14:43:38,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 9 transitions. [2019-01-07 14:43:38,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:43:38,628 INFO L225 Difference]: With dead ends: 9 [2019-01-07 14:43:38,628 INFO L226 Difference]: Without dead ends: 8 [2019-01-07 14:43:38,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-07 14:43:38,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-07 14:43:38,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-07 14:43:38,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:43:38,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2019-01-07 14:43:38,633 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-01-07 14:43:38,633 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-01-07 14:43:38,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:38,634 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-07 14:43:38,634 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-07 14:43:38,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:43:38,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:43:38,635 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-01-07 14:43:38,635 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-01-07 14:43:38,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:38,636 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-07 14:43:38,636 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-07 14:43:38,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:43:38,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:43:38,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:43:38,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:43:38,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-07 14:43:38,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-07 14:43:38,638 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-01-07 14:43:38,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:43:38,638 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-07 14:43:38,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-07 14:43:38,638 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-07 14:43:38,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 14:43:38,639 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:43:38,639 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1] [2019-01-07 14:43:38,639 INFO L423 AbstractCegarLoop]: === Iteration 6 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:43:38,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:43:38,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1890727614, now seen corresponding path program 5 times [2019-01-07 14:43:38,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:43:38,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:43:38,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:43:38,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:43:38,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:43:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:43:38,917 INFO L273 TraceCheckUtils]: 0: Hoare triple {307#true} i := 0; {309#(<= proc_i 0)} is VALID [2019-01-07 14:43:38,919 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-01-07 14:43:38,919 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-01-07 14:43:38,921 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-01-07 14:43:38,922 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-01-07 14:43:38,927 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-01-07 14:43:38,929 INFO L273 TraceCheckUtils]: 6: Hoare triple {314#(<= proc_i 20)} assume !(i <= 1000); {308#false} is VALID [2019-01-07 14:43:38,929 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:43:38,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:43:38,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:43:38,930 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 14:43:38,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 14:43:38,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:43:38,930 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-01-07 14:43:38,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 14:43:38,939 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 14:43:38,947 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-07 14:43:38,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 14:43:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:43:38,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 14:43:39,140 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 14:43:39,145 INFO L478 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 12 [2019-01-07 14:43:39,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 14:43:39,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:43:39,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2019-01-07 14:43:39,261 INFO L273 TraceCheckUtils]: 0: Hoare triple {307#true} i := 0; {307#true} is VALID [2019-01-07 14:43:39,262 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-01-07 14:43:39,263 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-01-07 14:43:39,263 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-01-07 14:43:39,264 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-01-07 14:43:39,265 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-01-07 14:43:39,265 INFO L273 TraceCheckUtils]: 6: Hoare triple {334#(<= proc_i 999)} assume !(i <= 1000); {308#false} is VALID [2019-01-07 14:43:39,266 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-07 14:43:39,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 14:43:39,306 INFO L273 TraceCheckUtils]: 6: Hoare triple {338#(<= proc_i 1000)} assume !(i <= 1000); {308#false} is VALID [2019-01-07 14:43:39,308 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-01-07 14:43:39,308 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-01-07 14:43:39,309 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-01-07 14:43:39,310 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-01-07 14:43:39,311 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-01-07 14:43:39,311 INFO L273 TraceCheckUtils]: 0: Hoare triple {307#true} i := 0; {307#true} is VALID [2019-01-07 14:43:39,312 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-07 14:43:39,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 14:43:39,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 11 [2019-01-07 14:43:39,334 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 14:43:39,334 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-07 14:43:39,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:43:39,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2019-01-07 14:43:39,352 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:43:39,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 14:43:39,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 14:43:39,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-07 14:43:39,353 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 10 states. [2019-01-07 14:43:39,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:39,591 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-07 14:43:39,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 14:43:39,591 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-07 14:43:39,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:43:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-07 14:43:39,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-07 14:43:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-07 14:43:39,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-07 14:43:39,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 10 transitions. [2019-01-07 14:43:39,604 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:43:39,604 INFO L225 Difference]: With dead ends: 9 [2019-01-07 14:43:39,604 INFO L226 Difference]: Without dead ends: 0 [2019-01-07 14:43:39,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=190, Unknown=0, NotChecked=0, Total=306 [2019-01-07 14:43:39,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-07 14:43:39,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-07 14:43:39,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:43:39,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-01-07 14:43:39,606 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-07 14:43:39,606 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-07 14:43:39,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:39,607 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-07 14:43:39,607 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-07 14:43:39,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:43:39,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:43:39,608 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-07 14:43:39,608 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-07 14:43:39,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:39,608 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-07 14:43:39,608 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-07 14:43:39,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:43:39,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:43:39,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:43:39,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:43:39,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-07 14:43:39,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-07 14:43:39,609 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2019-01-07 14:43:39,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:43:39,609 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-07 14:43:39,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 14:43:39,609 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-07 14:43:39,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:43:39,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-07 14:43:39,699 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-01-07 14:43:39,699 INFO L448 ceAbstractionStarter]: For program point procEXIT(lines 12 25) no Hoare annotation was computed. [2019-01-07 14:43:39,699 INFO L448 ceAbstractionStarter]: For program point procErr0ASSERT_VIOLATIONASSERT(line 18) no Hoare annotation was computed. [2019-01-07 14:43:39,699 INFO L448 ceAbstractionStarter]: For program point procENTRY(lines 12 25) no Hoare annotation was computed. [2019-01-07 14:43:39,701 WARN L170 areAnnotationChecker]: procENTRY has no Hoare annotation [2019-01-07 14:43:39,701 WARN L170 areAnnotationChecker]: procErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2019-01-07 14:43:39,702 WARN L170 areAnnotationChecker]: procEXIT has no Hoare annotation [2019-01-07 14:43:39,702 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-01-07 14:43:39,708 INFO L202 PluginConnector]: Adding new model LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.01 02:43:39 BoogieIcfgContainer [2019-01-07 14:43:39,708 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-07 14:43:39,709 INFO L168 Benchmark]: Toolchain (without parser) took 19374.48 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 948.4 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -684.2 MB). Peak memory consumption was 264.3 MB. Max. memory is 7.1 GB. [2019-01-07 14:43:39,711 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 14:43:39,712 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 14:43:39,712 INFO L168 Benchmark]: Boogie Preprocessor took 21.49 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 14:43:39,713 INFO L168 Benchmark]: RCFGBuilder took 393.17 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-01-07 14:43:39,713 INFO L168 Benchmark]: TraceAbstraction took 18917.05 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 948.4 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -705.3 MB). Peak memory consumption was 243.1 MB. Max. memory is 7.1 GB. [2019-01-07 14:43:39,717 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.49 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 393.17 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18917.05 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 948.4 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -705.3 MB). Peak memory consumption was 243.1 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, 18.8s OverallTime, 6 OverallIterations, 5 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s 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.1s 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, 14.3s 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.6s 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...