java -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/heapseparator/speedup-poc-dd-5-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-15 11:25:06,360 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 11:25:06,362 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 11:25:06,374 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 11:25:06,374 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 11:25:06,375 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 11:25:06,377 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 11:25:06,378 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 11:25:06,380 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 11:25:06,381 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 11:25:06,382 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 11:25:06,382 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 11:25:06,383 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 11:25:06,384 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 11:25:06,385 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 11:25:06,386 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 11:25:06,387 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 11:25:06,389 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 11:25:06,391 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 11:25:06,392 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 11:25:06,393 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 11:25:06,394 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 11:25:06,396 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 11:25:06,397 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 11:25:06,397 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 11:25:06,398 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 11:25:06,399 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 11:25:06,399 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 11:25:06,400 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 11:25:06,401 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 11:25:06,401 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 11:25:06,402 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 11:25:06,402 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 11:25:06,403 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 11:25:06,404 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 11:25:06,404 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 11:25:06,405 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-02-15 11:25:06,417 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 11:25:06,417 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 11:25:06,418 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 11:25:06,418 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 11:25:06,418 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 11:25:06,419 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 11:25:06,420 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 11:25:06,420 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 11:25:06,420 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 11:25:06,420 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-15 11:25:06,421 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-15 11:25:06,421 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 11:25:06,421 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 11:25:06,422 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 11:25:06,422 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 11:25:06,422 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 11:25:06,423 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 11:25:06,423 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 11:25:06,423 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 11:25:06,423 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 11:25:06,423 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 11:25:06,424 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 11:25:06,425 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 11:25:06,425 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 11:25:06,426 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 11:25:06,426 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 11:25:06,426 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 11:25:06,426 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 11:25:06,426 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 11:25:06,427 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 11:25:06,427 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 11:25:06,427 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 11:25:06,427 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 11:25:06,427 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 11:25:06,428 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 11:25:06,428 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 11:25:06,428 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 11:25:06,428 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 11:25:06,428 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 11:25:06,485 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 11:25:06,499 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 11:25:06,506 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 11:25:06,507 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 11:25:06,508 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 11:25:06,509 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl [2019-02-15 11:25:06,509 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl' [2019-02-15 11:25:06,567 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 11:25:06,569 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 11:25:06,570 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 11:25:06,570 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 11:25:06,570 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 11:25:06,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:06" (1/1) ... [2019-02-15 11:25:06,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:06" (1/1) ... [2019-02-15 11:25:06,634 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 11:25:06,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 11:25:06,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 11:25:06,635 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 11:25:06,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:06" (1/1) ... [2019-02-15 11:25:06,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:06" (1/1) ... [2019-02-15 11:25:06,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:06" (1/1) ... [2019-02-15 11:25:06,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:06" (1/1) ... [2019-02-15 11:25:06,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:06" (1/1) ... [2019-02-15 11:25:06,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:06" (1/1) ... [2019-02-15 11:25:06,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:06" (1/1) ... [2019-02-15 11:25:06,665 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 11:25:06,666 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 11:25:06,666 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 11:25:06,666 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 11:25:06,667 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory: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-02-15 11:25:06,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-15 11:25:06,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-15 11:25:07,115 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-15 11:25:07,115 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-02-15 11:25:07,117 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:25:07 BoogieIcfgContainer [2019-02-15 11:25:07,117 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 11:25:07,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 11:25:07,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 11:25:07,124 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 11:25:07,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:06" (1/2) ... [2019-02-15 11:25:07,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3afa8ac9 and model type speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:25:07, skipping insertion in model container [2019-02-15 11:25:07,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:25:07" (2/2) ... [2019-02-15 11:25:07,129 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-unlimited.bpl [2019-02-15 11:25:07,139 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 11:25:07,150 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-02-15 11:25:07,167 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-02-15 11:25:07,197 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 11:25:07,198 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 11:25:07,198 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 11:25:07,198 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 11:25:07,198 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 11:25:07,198 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 11:25:07,198 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 11:25:07,199 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 11:25:07,212 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-02-15 11:25:07,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-15 11:25:07,219 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:07,220 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-15 11:25:07,222 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:07,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:07,228 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-02-15 11:25:07,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:07,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:07,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:07,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:07,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:07,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:07,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:25:07,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 11:25:07,402 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:25:07,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 11:25:07,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 11:25:07,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:25:07,418 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-02-15 11:25:07,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:07,715 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-02-15 11:25:07,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:25:07,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-15 11:25:07,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:07,732 INFO L225 Difference]: With dead ends: 25 [2019-02-15 11:25:07,732 INFO L226 Difference]: Without dead ends: 20 [2019-02-15 11:25:07,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:25:07,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-15 11:25:07,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-02-15 11:25:07,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-15 11:25:07,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-02-15 11:25:07,773 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-02-15 11:25:07,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:07,775 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-02-15 11:25:07,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 11:25:07,775 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-02-15 11:25:07,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 11:25:07,776 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:07,776 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 11:25:07,776 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:07,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:07,777 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-02-15 11:25:07,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:07,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:07,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:07,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:07,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:07,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:07,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:07,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:07,930 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 11:25:07,932 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2019-02-15 11:25:07,998 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:07,998 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:09,018 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:09,094 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:25:09,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:09,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:09,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:09,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:09,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:09,124 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:09,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:09,328 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-02-15 11:25:09,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:09,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:09,519 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-02-15 11:25:09,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:09,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:09,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:09,738 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-02-15 11:25:09,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:09,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:09,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:09,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:09,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:09,754 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:09,809 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:09,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:09,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:25:09,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:25:10,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:25:10,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:25:10,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 11:25:10,077 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:10,106 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:10,125 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:10,173 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:10,183 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:10,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:10,234 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-15 11:25:10,426 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-02-15 11:25:10,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:10,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:25:10,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:10,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:10,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:10,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:10,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:10,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:10,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:10,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 11:25:10,853 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:10,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 11:25:10,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 11:25:10,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:25:10,856 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2019-02-15 11:25:11,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:11,202 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2019-02-15 11:25:11,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:25:11,203 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 11:25:11,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:11,204 INFO L225 Difference]: With dead ends: 39 [2019-02-15 11:25:11,205 INFO L226 Difference]: Without dead ends: 37 [2019-02-15 11:25:11,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 11:25:11,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-15 11:25:11,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2019-02-15 11:25:11,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-15 11:25:11,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2019-02-15 11:25:11,212 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2019-02-15 11:25:11,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:11,212 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2019-02-15 11:25:11,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 11:25:11,213 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2019-02-15 11:25:11,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 11:25:11,213 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:11,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 11:25:11,214 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:11,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:11,214 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-02-15 11:25:11,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:11,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:11,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:11,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:11,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:11,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:11,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:11,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:11,319 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 11:25:11,319 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2019-02-15 11:25:11,322 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:11,322 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:14,451 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:14,452 INFO L272 AbstractInterpreter]: Visited 3 different actions 11 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:25:14,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:14,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:14,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:14,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:14,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:14,472 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:14,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:14,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:14,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:14,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:14,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:14,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:14,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:14,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:14,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:14,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:14,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:14,673 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:14,685 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:14,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:14,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:25:14,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:25:14,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:25:14,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:25:14,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 11:25:14,852 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:14,887 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:14,919 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:14,931 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:14,941 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:15,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:15,003 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-15 11:25:15,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:15,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 11:25:15,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-15 11:25:15,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-02-15 11:25:15,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:199 [2019-02-15 11:25:15,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:15,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:15,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 11:25:15,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-15 11:25:15,437 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:25:15,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:25:15,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:25:15,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 11:25:15,438 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2019-02-15 11:25:15,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:15,500 INFO L93 Difference]: Finished difference Result 18 states and 39 transitions. [2019-02-15 11:25:15,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:25:15,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-15 11:25:15,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:15,505 INFO L225 Difference]: With dead ends: 18 [2019-02-15 11:25:15,505 INFO L226 Difference]: Without dead ends: 17 [2019-02-15 11:25:15,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 11:25:15,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-15 11:25:15,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-15 11:25:15,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-15 11:25:15,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. [2019-02-15 11:25:15,510 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 38 transitions. Word has length 3 [2019-02-15 11:25:15,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:15,510 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 38 transitions. [2019-02-15 11:25:15,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:25:15,510 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 38 transitions. [2019-02-15 11:25:15,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 11:25:15,511 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:15,511 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 11:25:15,511 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:15,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:15,512 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2019-02-15 11:25:15,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:15,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:15,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:15,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:15,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:15,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:15,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:25:15,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 11:25:15,543 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:25:15,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 11:25:15,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 11:25:15,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:25:15,544 INFO L87 Difference]: Start difference. First operand 17 states and 38 transitions. Second operand 3 states. [2019-02-15 11:25:15,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:15,596 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-02-15 11:25:15,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:25:15,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-15 11:25:15,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:15,599 INFO L225 Difference]: With dead ends: 21 [2019-02-15 11:25:15,599 INFO L226 Difference]: Without dead ends: 20 [2019-02-15 11:25:15,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:25:15,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-15 11:25:15,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-02-15 11:25:15,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-15 11:25:15,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2019-02-15 11:25:15,604 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2019-02-15 11:25:15,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:15,605 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2019-02-15 11:25:15,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 11:25:15,605 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2019-02-15 11:25:15,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 11:25:15,605 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:15,605 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 11:25:15,606 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:15,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:15,606 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-02-15 11:25:15,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:15,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:15,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:15,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:15,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:15,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:15,721 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:15,721 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 11:25:15,721 INFO L207 CegarAbsIntRunner]: [0], [10], [23] [2019-02-15 11:25:15,725 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:15,725 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:15,996 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:15,996 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:25:15,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:15,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:15,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:15,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:16,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:16,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:16,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:16,184 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-02-15 11:25:16,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:25:16,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:25:16,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:16,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:16,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:25:16,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:16,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:16,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:16,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:25:16,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 11:25:16,349 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:16,371 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:16,389 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:16,401 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:16,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:16,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:16,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:16,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:16,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:16,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:16,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:16,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:16,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:16,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:16,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:16,569 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:16,580 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:16,592 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:16,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:16,612 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-15 11:25:16,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:16,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 11:25:16,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:16,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:16,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:16,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:16,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:16,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:16,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:16,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 11:25:16,747 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:16,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 11:25:16,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 11:25:16,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:25:16,748 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 6 states. [2019-02-15 11:25:16,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:16,919 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2019-02-15 11:25:16,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:25:16,922 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 11:25:16,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:16,923 INFO L225 Difference]: With dead ends: 39 [2019-02-15 11:25:16,923 INFO L226 Difference]: Without dead ends: 38 [2019-02-15 11:25:16,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 11:25:16,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-15 11:25:16,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 18. [2019-02-15 11:25:16,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-15 11:25:16,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2019-02-15 11:25:16,928 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 3 [2019-02-15 11:25:16,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:16,929 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2019-02-15 11:25:16,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 11:25:16,929 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2019-02-15 11:25:16,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:16,929 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:16,929 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:16,930 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:16,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:16,930 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-02-15 11:25:16,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:16,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:16,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:16,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:16,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:17,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:17,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:17,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:17,011 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:25:17,011 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [23] [2019-02-15 11:25:17,013 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:17,014 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:17,421 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:17,421 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:17,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:17,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:17,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:17,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:17,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:17,435 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:17,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:17,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:25:17,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:25:17,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:17,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:17,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:25:17,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:17,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:17,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:17,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:25:17,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 11:25:17,560 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:17,587 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:17,603 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:17,616 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:17,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:17,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:17,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:17,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:17,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:17,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:17,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:17,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:17,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:17,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:17,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:17,843 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:17,851 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:17,861 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:17,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:17,881 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-15 11:25:17,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:17,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-02-15 11:25:17,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:25:18,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:25:18,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:74 [2019-02-15 11:25:18,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 80 [2019-02-15 11:25:18,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-15 11:25:18,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,387 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:18,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2019-02-15 11:25:18,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:18,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-02-15 11:25:18,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:96, output treesize:167 [2019-02-15 11:25:21,060 WARN L181 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 106 DAG size of output: 65 [2019-02-15 11:25:21,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:21,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:21,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:21,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:21,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:25:21,138 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:21,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:21,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:21,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:25:21,139 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 8 states. [2019-02-15 11:25:21,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:21,648 INFO L93 Difference]: Finished difference Result 59 states and 105 transitions. [2019-02-15 11:25:21,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:25:21,650 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:25:21,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:21,651 INFO L225 Difference]: With dead ends: 59 [2019-02-15 11:25:21,651 INFO L226 Difference]: Without dead ends: 55 [2019-02-15 11:25:21,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:25:21,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-15 11:25:21,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 20. [2019-02-15 11:25:21,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-15 11:25:21,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2019-02-15 11:25:21,658 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 59 transitions. Word has length 4 [2019-02-15 11:25:21,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:21,659 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 59 transitions. [2019-02-15 11:25:21,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:21,659 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 59 transitions. [2019-02-15 11:25:21,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:21,659 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:21,659 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:21,660 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:21,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:21,660 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2019-02-15 11:25:21,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:21,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:21,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:21,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:21,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:21,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:21,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:21,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:21,730 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:25:21,730 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [25] [2019-02-15 11:25:21,731 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:21,731 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:22,034 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:22,034 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:25:22,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:22,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:22,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:22,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:22,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:22,051 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:22,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:22,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:25:22,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:25:22,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:22,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:22,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:25:22,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:22,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:22,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:22,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:25:22,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-15 11:25:22,179 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:22,199 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:22,212 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:22,222 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:22,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:22,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-15 11:25:22,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:22,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:22,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-15 11:25:22,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:22,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:22,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:22,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:22,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 11:25:22,299 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:22,312 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:22,321 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:22,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:22,341 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-02-15 11:25:22,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:22,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2019-02-15 11:25:22,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:22,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:22,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2019-02-15 11:25:22,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:22,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:22,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:22,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 11:25:22,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-15 11:25:22,444 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:25:22,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:25:22,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:25:22,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:25:22,445 INFO L87 Difference]: Start difference. First operand 20 states and 59 transitions. Second operand 4 states. [2019-02-15 11:25:22,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:22,542 INFO L93 Difference]: Finished difference Result 25 states and 74 transitions. [2019-02-15 11:25:22,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:25:22,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-15 11:25:22,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:22,544 INFO L225 Difference]: With dead ends: 25 [2019-02-15 11:25:22,544 INFO L226 Difference]: Without dead ends: 24 [2019-02-15 11:25:22,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:25:22,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-15 11:25:22,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-02-15 11:25:22,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-15 11:25:22,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 73 transitions. [2019-02-15 11:25:22,552 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 73 transitions. Word has length 4 [2019-02-15 11:25:22,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:22,552 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 73 transitions. [2019-02-15 11:25:22,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:25:22,554 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 73 transitions. [2019-02-15 11:25:22,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:22,555 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:22,555 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:22,555 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:22,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:22,557 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2019-02-15 11:25:22,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:22,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:22,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:22,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:22,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:22,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:22,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:22,746 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:22,746 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:25:22,747 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [23] [2019-02-15 11:25:22,748 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:22,748 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:23,106 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:23,106 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:23,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:23,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:23,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:23,107 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:23,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:23,120 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:23,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:23,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:23,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:25:23,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:25:23,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:25:23,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:25:23,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 11:25:23,204 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:23,227 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:23,249 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:23,264 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:23,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:23,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:23,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:23,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:23,414 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:23,421 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:23,430 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:23,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:23,453 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-15 11:25:23,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:25:23,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:23,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:23,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:23,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,600 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:23,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-02-15 11:25:23,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:23,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:23,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:29 [2019-02-15 11:25:23,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:23,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:23,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:23,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:23,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:25:23,725 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:23,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:23,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:23,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:25:23,726 INFO L87 Difference]: Start difference. First operand 23 states and 73 transitions. Second operand 8 states. [2019-02-15 11:25:24,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:24,183 INFO L93 Difference]: Finished difference Result 56 states and 117 transitions. [2019-02-15 11:25:24,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:25:24,185 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:25:24,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:24,187 INFO L225 Difference]: With dead ends: 56 [2019-02-15 11:25:24,187 INFO L226 Difference]: Without dead ends: 55 [2019-02-15 11:25:24,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:25:24,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-15 11:25:24,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 24. [2019-02-15 11:25:24,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-15 11:25:24,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 79 transitions. [2019-02-15 11:25:24,196 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 79 transitions. Word has length 4 [2019-02-15 11:25:24,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:24,197 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 79 transitions. [2019-02-15 11:25:24,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:24,197 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 79 transitions. [2019-02-15 11:25:24,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:24,198 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:24,198 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:24,199 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:24,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:24,199 INFO L82 PathProgramCache]: Analyzing trace with hash 941276, now seen corresponding path program 1 times [2019-02-15 11:25:24,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:24,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:24,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:24,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:24,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:24,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:24,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:24,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:24,257 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:25:24,257 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [23] [2019-02-15 11:25:24,258 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:24,259 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:24,604 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:24,604 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:24,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:24,606 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:24,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:24,606 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:24,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:24,619 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:24,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:24,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:24,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:24,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:24,776 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:24,785 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:24,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:24,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:25:24,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:25:24,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:25:24,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:25:24,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 11:25:24,824 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:24,843 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:24,860 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:24,871 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:24,881 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:24,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:24,902 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-15 11:25:24,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:25:24,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:24,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:24,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:25,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 11:25:25,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:25,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:25,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-15 11:25:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:25,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:25,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:25,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:25,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:25:25,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:25,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:25,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:25,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:25:25,108 INFO L87 Difference]: Start difference. First operand 24 states and 79 transitions. Second operand 8 states. [2019-02-15 11:25:25,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:25,485 INFO L93 Difference]: Finished difference Result 52 states and 120 transitions. [2019-02-15 11:25:25,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:25:25,485 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:25:25,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:25,486 INFO L225 Difference]: With dead ends: 52 [2019-02-15 11:25:25,487 INFO L226 Difference]: Without dead ends: 48 [2019-02-15 11:25:25,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:25:25,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-02-15 11:25:25,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 26. [2019-02-15 11:25:25,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-15 11:25:25,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-02-15 11:25:25,495 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-02-15 11:25:25,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:25,496 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-02-15 11:25:25,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:25,496 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-02-15 11:25:25,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:25,497 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:25,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:25,497 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:25,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:25,497 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2019-02-15 11:25:25,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:25,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:25,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:25,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:25,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:25,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:25,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:25,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:25,567 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:25:25,567 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [25] [2019-02-15 11:25:25,568 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:25,568 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:27,315 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:27,316 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:25:27,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:27,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:27,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:27,316 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:27,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:27,325 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:27,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:27,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:25:27,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:25:27,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:25:27,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:25:27,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:25:27,386 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:27,463 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:27,477 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:27,488 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:27,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:27,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:25:27,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:25:27,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:25:27,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:25:27,619 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:27,633 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:27,647 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:27,663 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:27,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:27,692 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-15 11:25:27,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 11:25:27,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:27,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:27,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-02-15 11:25:27,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:27,818 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:27,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:27,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:27,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 11:25:27,850 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:27,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 11:25:27,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 11:25:27,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:25:27,851 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 6 states. [2019-02-15 11:25:28,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:28,010 INFO L93 Difference]: Finished difference Result 42 states and 110 transitions. [2019-02-15 11:25:28,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:25:28,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-15 11:25:28,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:28,012 INFO L225 Difference]: With dead ends: 42 [2019-02-15 11:25:28,012 INFO L226 Difference]: Without dead ends: 41 [2019-02-15 11:25:28,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 11:25:28,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-15 11:25:28,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2019-02-15 11:25:28,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-15 11:25:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-02-15 11:25:28,022 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-02-15 11:25:28,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:28,022 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-02-15 11:25:28,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 11:25:28,022 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-02-15 11:25:28,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:28,023 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:28,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:28,023 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:28,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:28,024 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2019-02-15 11:25:28,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:28,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:28,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:28,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:28,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:28,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:28,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:28,106 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:28,106 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:25:28,107 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [23] [2019-02-15 11:25:28,108 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:28,108 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:28,709 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:28,709 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:28,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:28,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:28,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:28,709 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:28,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:28,718 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:28,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:28,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:25:28,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:25:28,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:25:28,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:25:28,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 11:25:28,786 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:28,821 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:28,835 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:28,847 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:28,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:28,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 11:25:28,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:25:28,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:25:28,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:29,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:29,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:29,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:29,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:29,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:29,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:25:29,007 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:29,021 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:29,036 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:29,052 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:29,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:29,083 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-02-15 11:25:29,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:29,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:25:29,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:29,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:29,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 11:25:29,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:29,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:29,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:29,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:29,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:29,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:29,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:29,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 11:25:29,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:29,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:29,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-02-15 11:25:29,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:29,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:29,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:29,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:29,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:25:29,260 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:29,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:29,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:29,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:25:29,260 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 8 states. [2019-02-15 11:25:29,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:29,627 INFO L93 Difference]: Finished difference Result 54 states and 131 transitions. [2019-02-15 11:25:29,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:25:29,627 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:25:29,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:29,629 INFO L225 Difference]: With dead ends: 54 [2019-02-15 11:25:29,629 INFO L226 Difference]: Without dead ends: 53 [2019-02-15 11:25:29,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:25:29,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-15 11:25:29,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 27. [2019-02-15 11:25:29,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-15 11:25:29,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 96 transitions. [2019-02-15 11:25:29,640 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 96 transitions. Word has length 4 [2019-02-15 11:25:29,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:29,640 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 96 transitions. [2019-02-15 11:25:29,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:29,640 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 96 transitions. [2019-02-15 11:25:29,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:29,641 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:29,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:29,641 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:29,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:29,642 INFO L82 PathProgramCache]: Analyzing trace with hash 929868, now seen corresponding path program 1 times [2019-02-15 11:25:29,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:29,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:29,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:29,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:29,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:29,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:29,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:29,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:29,725 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:25:29,725 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [23] [2019-02-15 11:25:29,726 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:29,726 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:29,999 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:29,999 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:29,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:30,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:30,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:30,000 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:30,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:30,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:30,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:30,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:30,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:30,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:30,131 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:30,139 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:30,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:30,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:25:30,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:25:30,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:25:30,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:25:30,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 11:25:30,181 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:30,197 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:30,211 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:30,221 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:30,231 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:30,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:30,252 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-15 11:25:30,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 11:25:30,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:30,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:30,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:30,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:25:30,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:30,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:30,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-15 11:25:30,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:30,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:30,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:30,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:30,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 11:25:30,422 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:30,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:30,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:30,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:25:30,423 INFO L87 Difference]: Start difference. First operand 27 states and 96 transitions. Second operand 8 states. [2019-02-15 11:25:30,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:30,713 INFO L93 Difference]: Finished difference Result 63 states and 165 transitions. [2019-02-15 11:25:30,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:25:30,714 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:25:30,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:30,715 INFO L225 Difference]: With dead ends: 63 [2019-02-15 11:25:30,715 INFO L226 Difference]: Without dead ends: 61 [2019-02-15 11:25:30,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:25:30,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-15 11:25:30,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 32. [2019-02-15 11:25:30,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-15 11:25:30,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 113 transitions. [2019-02-15 11:25:30,728 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 113 transitions. Word has length 4 [2019-02-15 11:25:30,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:30,728 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 113 transitions. [2019-02-15 11:25:30,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:30,728 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 113 transitions. [2019-02-15 11:25:30,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:30,729 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:30,729 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:30,729 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:30,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:30,730 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2019-02-15 11:25:30,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:30,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:30,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:30,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:30,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:30,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:25:30,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:25:30,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-15 11:25:30,814 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:25:30,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:25:30,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:25:30,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-15 11:25:30,815 INFO L87 Difference]: Start difference. First operand 32 states and 113 transitions. Second operand 4 states. [2019-02-15 11:25:30,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:30,879 INFO L93 Difference]: Finished difference Result 41 states and 126 transitions. [2019-02-15 11:25:30,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:25:30,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-15 11:25:30,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:30,880 INFO L225 Difference]: With dead ends: 41 [2019-02-15 11:25:30,880 INFO L226 Difference]: Without dead ends: 40 [2019-02-15 11:25:30,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-15 11:25:30,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-15 11:25:30,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-02-15 11:25:30,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-15 11:25:30,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 118 transitions. [2019-02-15 11:25:30,891 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 118 transitions. Word has length 4 [2019-02-15 11:25:30,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:30,891 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 118 transitions. [2019-02-15 11:25:30,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:25:30,891 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 118 transitions. [2019-02-15 11:25:30,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:30,892 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:30,892 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:30,892 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:30,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:30,892 INFO L82 PathProgramCache]: Analyzing trace with hash 933712, now seen corresponding path program 2 times [2019-02-15 11:25:30,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:30,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:30,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:30,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:30,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:30,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:30,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:30,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:30,977 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:25:30,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:25:30,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:30,978 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:30,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:25:30,987 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:25:30,992 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-15 11:25:30,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:25:30,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:31,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:25:31,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:25:31,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,036 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:25:31,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:25:31,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 11:25:31,052 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:31,090 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:31,106 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:31,119 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:31,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:31,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 11:25:31,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:25:31,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:25:31,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:25:31,291 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:31,307 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:31,323 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:31,338 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:31,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:31,368 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-02-15 11:25:31,619 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-02-15 11:25:31,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:25:31,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:31,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:31,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 11:25:31,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,865 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:31,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 79 [2019-02-15 11:25:31,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:31,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:31,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:44 [2019-02-15 11:25:31,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:31,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:31,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:31,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:31,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:25:31,957 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:31,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:31,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:31,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:25:31,957 INFO L87 Difference]: Start difference. First operand 33 states and 118 transitions. Second operand 8 states. [2019-02-15 11:25:32,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:32,313 INFO L93 Difference]: Finished difference Result 57 states and 149 transitions. [2019-02-15 11:25:32,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:25:32,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:25:32,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:32,314 INFO L225 Difference]: With dead ends: 57 [2019-02-15 11:25:32,315 INFO L226 Difference]: Without dead ends: 55 [2019-02-15 11:25:32,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:25:32,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-15 11:25:32,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2019-02-15 11:25:32,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-15 11:25:32,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 117 transitions. [2019-02-15 11:25:32,325 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 117 transitions. Word has length 4 [2019-02-15 11:25:32,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:32,325 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 117 transitions. [2019-02-15 11:25:32,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:32,325 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 117 transitions. [2019-02-15 11:25:32,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:32,326 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:32,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:32,326 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:32,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:32,327 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2019-02-15 11:25:32,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:32,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:32,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:25:32,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:32,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:32,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:32,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:32,383 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:32,383 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:25:32,384 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [23] [2019-02-15 11:25:32,384 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:32,385 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:32,649 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:32,650 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:32,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:32,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:32,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:32,650 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:32,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:32,660 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:32,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:32,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:32,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:32,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:32,766 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:32,776 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:32,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:32,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:25:32,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:25:32,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:25:32,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:25:32,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 11:25:32,826 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:32,846 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:32,860 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:32,871 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:32,881 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:32,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:32,903 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-15 11:25:32,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 11:25:32,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:32,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:32,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:32,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 11:25:32,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:33,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:33,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-15 11:25:33,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:33,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:33,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:33,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:33,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 11:25:33,057 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:33,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:33,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:33,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:25:33,058 INFO L87 Difference]: Start difference. First operand 33 states and 117 transitions. Second operand 8 states. [2019-02-15 11:25:33,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:33,373 INFO L93 Difference]: Finished difference Result 61 states and 173 transitions. [2019-02-15 11:25:33,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:25:33,373 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:25:33,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:33,375 INFO L225 Difference]: With dead ends: 61 [2019-02-15 11:25:33,375 INFO L226 Difference]: Without dead ends: 60 [2019-02-15 11:25:33,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:25:33,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-02-15 11:25:33,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-02-15 11:25:33,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-15 11:25:33,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 135 transitions. [2019-02-15 11:25:33,388 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 135 transitions. Word has length 4 [2019-02-15 11:25:33,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:33,389 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 135 transitions. [2019-02-15 11:25:33,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:33,389 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 135 transitions. [2019-02-15 11:25:33,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:33,390 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:33,390 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:33,390 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:33,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:33,390 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2019-02-15 11:25:33,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:33,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:33,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:33,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:33,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:33,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:33,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:33,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:33,571 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:25:33,571 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [25] [2019-02-15 11:25:33,572 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:33,572 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:33,828 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:33,828 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:25:33,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:33,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:33,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:33,829 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:33,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:33,838 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:33,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:33,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:25:33,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:25:33,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:33,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:33,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:25:33,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:33,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:33,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:33,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:25:33,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:33,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:33,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:33,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:33,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:25:33,927 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:33,951 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:33,965 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:33,976 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:33,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:34,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:25:34,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:34,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:34,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:25:34,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:34,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:34,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:34,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:34,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:25:34,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:34,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:34,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:34,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:34,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:34,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:34,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:25:34,106 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:34,119 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:34,133 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:34,149 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:34,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:34,234 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-15 11:25:34,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:34,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 11:25:34,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:34,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:34,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-02-15 11:25:34,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:34,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:34,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:34,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:34,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 11:25:34,328 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:34,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 11:25:34,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 11:25:34,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:25:34,329 INFO L87 Difference]: Start difference. First operand 36 states and 135 transitions. Second operand 6 states. [2019-02-15 11:25:34,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:34,471 INFO L93 Difference]: Finished difference Result 53 states and 161 transitions. [2019-02-15 11:25:34,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:25:34,471 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-15 11:25:34,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:34,472 INFO L225 Difference]: With dead ends: 53 [2019-02-15 11:25:34,472 INFO L226 Difference]: Without dead ends: 52 [2019-02-15 11:25:34,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 11:25:34,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-15 11:25:34,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2019-02-15 11:25:34,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-15 11:25:34,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 141 transitions. [2019-02-15 11:25:34,484 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 141 transitions. Word has length 4 [2019-02-15 11:25:34,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:34,485 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 141 transitions. [2019-02-15 11:25:34,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 11:25:34,485 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 141 transitions. [2019-02-15 11:25:34,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:34,487 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:34,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:34,488 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:34,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:34,488 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2019-02-15 11:25:34,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:34,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:34,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:34,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:34,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:34,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:34,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:34,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:34,801 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:25:34,801 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [23] [2019-02-15 11:25:34,802 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:34,802 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:35,059 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:35,060 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:35,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:35,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:35,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:35,060 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:35,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:35,074 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:35,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:35,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:25:35,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:25:35,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:25:35,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:25:35,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 11:25:35,176 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:35,204 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:35,256 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:35,269 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:35,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:35,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 11:25:35,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:25:35,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:25:35,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:25:35,427 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:35,444 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:35,460 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:35,476 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:35,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:35,548 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-02-15 11:25:35,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:25:35,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:35,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:35,605 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 11:25:35,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 11:25:35,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:35,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:35,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-02-15 11:25:35,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:35,726 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:35,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:35,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:35,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:25:35,770 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:35,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:35,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:35,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:25:35,771 INFO L87 Difference]: Start difference. First operand 37 states and 141 transitions. Second operand 8 states. [2019-02-15 11:25:36,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:36,112 INFO L93 Difference]: Finished difference Result 69 states and 192 transitions. [2019-02-15 11:25:36,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:25:36,112 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:25:36,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:36,113 INFO L225 Difference]: With dead ends: 69 [2019-02-15 11:25:36,113 INFO L226 Difference]: Without dead ends: 68 [2019-02-15 11:25:36,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:25:36,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-15 11:25:36,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 39. [2019-02-15 11:25:36,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-15 11:25:36,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 153 transitions. [2019-02-15 11:25:36,125 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 153 transitions. Word has length 4 [2019-02-15 11:25:36,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:36,125 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 153 transitions. [2019-02-15 11:25:36,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:36,125 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 153 transitions. [2019-02-15 11:25:36,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:25:36,126 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:36,126 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-15 11:25:36,126 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:36,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:36,127 INFO L82 PathProgramCache]: Analyzing trace with hash 29182896, now seen corresponding path program 2 times [2019-02-15 11:25:36,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:36,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:36,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:36,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:36,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:36,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:36,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:25:36,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:36,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:36,242 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:25:36,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:25:36,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:36,243 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:36,252 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:25:36,252 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:25:36,258 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:25:36,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:25:36,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:36,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:25:36,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:25:36,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:25:36,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:25:36,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 11:25:36,365 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:36,640 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:36,655 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:36,666 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:36,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:36,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 11:25:36,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:25:36,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:25:36,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:25:36,846 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:36,863 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:36,878 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:36,893 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:36,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:36,922 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:69, output treesize:66 [2019-02-15 11:25:36,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 11:25:36,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:36,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:36,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 11:25:36,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 78 [2019-02-15 11:25:36,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:37,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:37,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:50 [2019-02-15 11:25:37,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:37,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:37,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:37,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:37,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:37,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:37,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:37,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-02-15 11:25:37,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:37,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:37,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-02-15 11:25:37,105 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:37,105 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:37,125 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:37,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:37,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-02-15 11:25:37,144 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:37,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 11:25:37,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 11:25:37,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-02-15 11:25:37,145 INFO L87 Difference]: Start difference. First operand 39 states and 153 transitions. Second operand 9 states. [2019-02-15 11:25:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:37,457 INFO L93 Difference]: Finished difference Result 73 states and 219 transitions. [2019-02-15 11:25:37,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:25:37,458 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-15 11:25:37,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:37,459 INFO L225 Difference]: With dead ends: 73 [2019-02-15 11:25:37,459 INFO L226 Difference]: Without dead ends: 71 [2019-02-15 11:25:37,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:25:37,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-15 11:25:37,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 42. [2019-02-15 11:25:37,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-02-15 11:25:37,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 171 transitions. [2019-02-15 11:25:37,471 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 171 transitions. Word has length 5 [2019-02-15 11:25:37,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:37,471 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 171 transitions. [2019-02-15 11:25:37,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 11:25:37,471 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 171 transitions. [2019-02-15 11:25:37,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:25:37,472 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:37,472 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:25:37,472 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:37,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:37,473 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2019-02-15 11:25:37,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:37,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:37,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:25:37,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:37,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:37,737 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-02-15 11:25:37,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:37,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:37,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:37,758 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:25:37,758 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [25] [2019-02-15 11:25:37,759 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:37,759 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:38,017 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:38,018 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:38,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:38,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:38,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:38,019 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:38,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:38,031 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:38,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:38,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:25:38,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:25:38,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:25:38,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:25:38,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:25:38,173 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:38,198 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:38,210 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:38,219 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:38,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:38,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:25:38,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:25:38,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:25:38,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:25:38,343 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:38,357 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:38,371 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:38,387 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:38,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:38,414 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 11:25:38,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-15 11:25:38,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:38,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:38,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 11:25:38,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2019-02-15 11:25:38,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:38,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:38,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:36 [2019-02-15 11:25:38,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:38,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:38,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:38,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:38,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 11:25:38,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:38,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:38,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:38,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:25:38,715 INFO L87 Difference]: Start difference. First operand 42 states and 171 transitions. Second operand 8 states. [2019-02-15 11:25:39,161 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-02-15 11:25:39,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:39,362 INFO L93 Difference]: Finished difference Result 84 states and 258 transitions. [2019-02-15 11:25:39,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:25:39,362 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:25:39,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:39,364 INFO L225 Difference]: With dead ends: 84 [2019-02-15 11:25:39,364 INFO L226 Difference]: Without dead ends: 78 [2019-02-15 11:25:39,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-15 11:25:39,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-02-15 11:25:39,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 48. [2019-02-15 11:25:39,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-15 11:25:39,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 218 transitions. [2019-02-15 11:25:39,380 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 218 transitions. Word has length 5 [2019-02-15 11:25:39,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:39,381 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 218 transitions. [2019-02-15 11:25:39,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:39,381 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 218 transitions. [2019-02-15 11:25:39,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:25:39,382 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:39,382 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:25:39,382 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:39,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:39,382 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2019-02-15 11:25:39,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:39,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:39,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:39,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:39,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:39,533 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:39,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:39,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:39,534 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:25:39,534 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [23] [2019-02-15 11:25:39,535 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:39,535 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:39,838 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:39,839 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:25:39,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:39,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:39,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:39,839 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:39,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:39,858 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:39,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:39,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:25:39,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:25:39,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:39,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:39,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:25:39,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:39,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:39,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:39,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:25:39,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 11:25:39,927 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:39,946 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:39,962 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:39,974 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:39,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:40,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:40,030 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:40,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:40,066 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:40,074 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:40,083 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:40,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:40,103 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-15 11:25:40,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-02-15 11:25:40,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:25:40,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-15 11:25:40,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:74 [2019-02-15 11:25:40,710 WARN L181 SmtUtils]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-02-15 11:25:40,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:41,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:41,036 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:41,037 INFO L303 Elim1Store]: Index analysis took 321 ms [2019-02-15 11:25:41,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 80 [2019-02-15 11:25:41,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-15 11:25:42,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,159 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:42,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2019-02-15 11:25:42,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:42,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-02-15 11:25:42,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:96, output treesize:167 [2019-02-15 11:25:42,439 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-02-15 11:25:42,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,485 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:42,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 86 [2019-02-15 11:25:42,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:42,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-15 11:25:42,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:42,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,660 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:42,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 82 [2019-02-15 11:25:42,661 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:42,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,750 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:42,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-02-15 11:25:42,752 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:42,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-02-15 11:25:42,818 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:121 [2019-02-15 11:25:42,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:42,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:42,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:42,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:42,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:25:42,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:42,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:25:42,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:25:42,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:25:42,983 INFO L87 Difference]: Start difference. First operand 48 states and 218 transitions. Second operand 10 states. [2019-02-15 11:25:43,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:43,850 INFO L93 Difference]: Finished difference Result 109 states and 322 transitions. [2019-02-15 11:25:43,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:25:43,851 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:25:43,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:43,852 INFO L225 Difference]: With dead ends: 109 [2019-02-15 11:25:43,852 INFO L226 Difference]: Without dead ends: 107 [2019-02-15 11:25:43,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-02-15 11:25:43,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-15 11:25:43,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 51. [2019-02-15 11:25:43,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-15 11:25:43,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 236 transitions. [2019-02-15 11:25:43,866 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 236 transitions. Word has length 5 [2019-02-15 11:25:43,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:43,866 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 236 transitions. [2019-02-15 11:25:43,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:25:43,866 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 236 transitions. [2019-02-15 11:25:43,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:25:43,867 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:43,867 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:25:43,868 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:43,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:43,868 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2019-02-15 11:25:43,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:43,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:43,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:43,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:43,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:44,126 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2019-02-15 11:25:44,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:25:44,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:44,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:44,143 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:25:44,143 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [25] [2019-02-15 11:25:44,144 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:44,144 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:44,389 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:44,389 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:44,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:44,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:44,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:44,390 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:44,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:44,398 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:44,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:44,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:25:44,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:25:44,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:44,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:44,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:25:44,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:44,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:44,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:44,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:25:44,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 11:25:44,461 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:44,494 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:44,519 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:44,529 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:44,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:44,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:44,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:44,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:44,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:44,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:44,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:44,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:44,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:44,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:44,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:44,621 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:44,631 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:44,640 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:44,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:44,661 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-15 11:25:44,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:44,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:25:44,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:44,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:44,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:44,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:44,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:44,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:44,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:44,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:44,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:44,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 11:25:44,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:44,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:44,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-15 11:25:45,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:45,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:45,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:45,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:45,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:25:45,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:45,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:45,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:45,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:25:45,046 INFO L87 Difference]: Start difference. First operand 51 states and 236 transitions. Second operand 8 states. [2019-02-15 11:25:45,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:45,401 INFO L93 Difference]: Finished difference Result 77 states and 292 transitions. [2019-02-15 11:25:45,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:25:45,402 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:25:45,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:45,403 INFO L225 Difference]: With dead ends: 77 [2019-02-15 11:25:45,403 INFO L226 Difference]: Without dead ends: 76 [2019-02-15 11:25:45,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:25:45,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-15 11:25:45,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-02-15 11:25:45,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-15 11:25:45,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 261 transitions. [2019-02-15 11:25:45,420 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 261 transitions. Word has length 5 [2019-02-15 11:25:45,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:45,421 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 261 transitions. [2019-02-15 11:25:45,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:45,421 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 261 transitions. [2019-02-15 11:25:45,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:25:45,422 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:45,422 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:25:45,422 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:45,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:45,422 INFO L82 PathProgramCache]: Analyzing trace with hash 29175642, now seen corresponding path program 2 times [2019-02-15 11:25:45,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:45,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:45,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:45,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:45,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:45,540 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:45,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:45,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:45,540 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:25:45,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:25:45,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:45,541 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:45,551 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:25:45,551 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:25:45,558 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:25:45,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:25:45,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:45,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 11:25:45,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:25:45,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:25:45,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:25:45,713 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,729 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,744 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:25:45,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:25:45,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:25:45,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:25:45,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 11:25:45,795 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,818 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,832 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,844 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,854 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:45,884 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-15 11:25:45,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 11:25:45,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:45,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-15 11:25:45,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,977 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:45,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-02-15 11:25:45,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:46,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:46,009 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:42 [2019-02-15 11:25:46,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,036 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,037 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2019-02-15 11:25:46,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:46,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:46,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-02-15 11:25:46,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:46,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:46,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:46,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:46,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:25:46,161 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:46,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:25:46,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:25:46,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:25:46,162 INFO L87 Difference]: Start difference. First operand 55 states and 261 transitions. Second operand 10 states. [2019-02-15 11:25:46,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:46,696 INFO L93 Difference]: Finished difference Result 88 states and 340 transitions. [2019-02-15 11:25:46,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:25:46,701 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:25:46,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:46,702 INFO L225 Difference]: With dead ends: 88 [2019-02-15 11:25:46,702 INFO L226 Difference]: Without dead ends: 83 [2019-02-15 11:25:46,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:25:46,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-15 11:25:46,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2019-02-15 11:25:46,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-15 11:25:46,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-02-15 11:25:46,722 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-02-15 11:25:46,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:46,722 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-02-15 11:25:46,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:25:46,722 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-02-15 11:25:46,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:25:46,723 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:46,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:25:46,723 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:46,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:46,724 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2019-02-15 11:25:46,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:46,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:46,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:25:46,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:46,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:46,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:46,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:46,791 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:46,791 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:25:46,792 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [25] [2019-02-15 11:25:46,793 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:46,793 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:47,004 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:47,004 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:47,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:47,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:47,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:47,005 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:47,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:47,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:47,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:47,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:25:47,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:25:47,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:25:47,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:25:47,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-15 11:25:47,295 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:47,313 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:47,327 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:47,337 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:47,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:47,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-15 11:25:47,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-15 11:25:47,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 11:25:47,417 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:47,425 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:47,434 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:47,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:47,453 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-02-15 11:25:47,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-15 11:25:47,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:47,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:47,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-15 11:25:47,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:25:47,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:47,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:47,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-02-15 11:25:47,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:47,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:47,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:47,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:47,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:25:47,590 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:47,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:47,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:47,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:25:47,591 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 8 states. [2019-02-15 11:25:47,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:47,870 INFO L93 Difference]: Finished difference Result 81 states and 298 transitions. [2019-02-15 11:25:47,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:25:47,871 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:25:47,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:47,873 INFO L225 Difference]: With dead ends: 81 [2019-02-15 11:25:47,873 INFO L226 Difference]: Without dead ends: 80 [2019-02-15 11:25:47,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:25:47,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-15 11:25:47,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 61. [2019-02-15 11:25:47,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-15 11:25:47,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-02-15 11:25:47,888 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-02-15 11:25:47,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:47,888 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-02-15 11:25:47,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:47,888 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-02-15 11:25:47,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:25:47,889 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:47,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:25:47,889 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:47,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:47,890 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2019-02-15 11:25:47,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:47,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:47,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:47,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:47,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:48,026 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:48,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:48,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:48,027 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:25:48,028 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [23] [2019-02-15 11:25:48,029 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:48,029 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:48,418 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:48,418 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:25:48,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:48,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:48,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:48,419 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:48,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:48,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:48,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:48,609 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-02-15 11:25:48,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:48,759 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-02-15 11:25:48,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:48,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:48,796 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:48,805 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:48,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:48,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:25:48,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:25:48,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:25:48,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:25:48,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 11:25:48,848 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:48,871 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:48,890 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:48,905 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:48,922 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:48,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:48,953 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-15 11:25:49,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:25:49,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:49,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:49,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:49,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 11:25:49,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:49,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:49,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 11:25:49,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,191 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:49,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-02-15 11:25:49,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:49,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:49,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-15 11:25:49,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:49,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:49,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:49,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:49,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:25:49,337 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:49,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:25:49,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:25:49,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:25:49,338 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 10 states. [2019-02-15 11:25:49,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:49,816 INFO L93 Difference]: Finished difference Result 113 states and 415 transitions. [2019-02-15 11:25:49,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:25:49,817 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:25:49,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:49,819 INFO L225 Difference]: With dead ends: 113 [2019-02-15 11:25:49,819 INFO L226 Difference]: Without dead ends: 112 [2019-02-15 11:25:49,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:25:49,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-02-15 11:25:49,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 60. [2019-02-15 11:25:49,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-02-15 11:25:49,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 267 transitions. [2019-02-15 11:25:49,839 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 267 transitions. Word has length 5 [2019-02-15 11:25:49,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:49,839 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 267 transitions. [2019-02-15 11:25:49,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:25:49,839 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 267 transitions. [2019-02-15 11:25:49,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:25:49,840 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:49,840 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:25:49,840 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:49,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:49,840 INFO L82 PathProgramCache]: Analyzing trace with hash 29242478, now seen corresponding path program 1 times [2019-02-15 11:25:49,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:49,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:49,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:49,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:49,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:49,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:49,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:49,935 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:49,935 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:25:49,935 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [23] [2019-02-15 11:25:49,936 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:49,936 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:50,271 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:50,271 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:25:50,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:50,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:50,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:50,272 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:50,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:50,280 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:50,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:50,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:25:50,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:25:50,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:25:50,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:25:50,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 11:25:50,380 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:50,403 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:50,418 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:50,428 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:50,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:50,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:50,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:50,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:50,528 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:50,538 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:50,547 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:50,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:50,568 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-15 11:25:50,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 11:25:50,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-15 11:25:50,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-02-15 11:25:50,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:199 [2019-02-15 11:25:50,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 65 [2019-02-15 11:25:50,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:51,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,016 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:51,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2019-02-15 11:25:51,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:51,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 73 [2019-02-15 11:25:51,082 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:51,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-02-15 11:25:51,142 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:138, output treesize:96 [2019-02-15 11:25:53,195 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 65 [2019-02-15 11:25:53,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,256 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:53,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-02-15 11:25:53,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:53,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2019-02-15 11:25:53,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:53,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 79 [2019-02-15 11:25:53,394 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:53,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-02-15 11:25:53,448 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:130, output treesize:88 [2019-02-15 11:25:53,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:53,506 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:53,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:53,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:53,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-02-15 11:25:53,542 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:53,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:25:53,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:25:53,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-15 11:25:53,543 INFO L87 Difference]: Start difference. First operand 60 states and 267 transitions. Second operand 10 states. [2019-02-15 11:25:53,889 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 26 [2019-02-15 11:25:54,139 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-02-15 11:25:54,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:54,627 INFO L93 Difference]: Finished difference Result 137 states and 516 transitions. [2019-02-15 11:25:54,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:25:54,628 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:25:54,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:54,630 INFO L225 Difference]: With dead ends: 137 [2019-02-15 11:25:54,630 INFO L226 Difference]: Without dead ends: 136 [2019-02-15 11:25:54,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:25:54,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-02-15 11:25:54,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-02-15 11:25:54,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-15 11:25:54,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 468 transitions. [2019-02-15 11:25:54,658 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 468 transitions. Word has length 5 [2019-02-15 11:25:54,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:54,659 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 468 transitions. [2019-02-15 11:25:54,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:25:54,659 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 468 transitions. [2019-02-15 11:25:54,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:25:54,660 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:54,660 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:25:54,660 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:54,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:54,660 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2019-02-15 11:25:54,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:54,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:54,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:54,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:54,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:54,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:25:54,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:54,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:54,756 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:25:54,756 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [25] [2019-02-15 11:25:54,757 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:54,757 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:55,348 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:55,348 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:55,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:55,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:55,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:55,349 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:55,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:55,357 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:55,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:55,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 11:25:55,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:25:55,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:25:55,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:25:55,525 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:55,540 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:55,555 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:55,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:55,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:25:55,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:25:55,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:25:55,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:25:55,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 11:25:55,627 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:55,657 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:55,671 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:55,680 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:55,690 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:55,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:55,720 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-02-15 11:25:55,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:25:55,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:55,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:55,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 11:25:55,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:55,816 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:55,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 11:25:55,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:55,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:55,847 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-02-15 11:25:55,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:55,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:55,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:55,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:55,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:25:55,904 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:55,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:55,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:55,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:25:55,905 INFO L87 Difference]: Start difference. First operand 93 states and 468 transitions. Second operand 8 states. [2019-02-15 11:25:56,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:56,288 INFO L93 Difference]: Finished difference Result 120 states and 513 transitions. [2019-02-15 11:25:56,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:25:56,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:25:56,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:56,290 INFO L225 Difference]: With dead ends: 120 [2019-02-15 11:25:56,290 INFO L226 Difference]: Without dead ends: 119 [2019-02-15 11:25:56,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:25:56,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-15 11:25:56,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2019-02-15 11:25:56,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-15 11:25:56,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 486 transitions. [2019-02-15 11:25:56,333 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 486 transitions. Word has length 5 [2019-02-15 11:25:56,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:56,334 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 486 transitions. [2019-02-15 11:25:56,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:56,334 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 486 transitions. [2019-02-15 11:25:56,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:25:56,335 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:56,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:25:56,335 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:56,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:56,335 INFO L82 PathProgramCache]: Analyzing trace with hash 29248868, now seen corresponding path program 1 times [2019-02-15 11:25:56,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:56,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:56,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:56,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:56,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:56,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:56,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:56,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:56,399 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:25:56,400 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [27] [2019-02-15 11:25:56,401 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:56,401 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:57,974 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:57,974 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:25:57,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:57,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:57,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:57,974 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:57,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:57,983 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:57,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:57,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:25:57,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:25:58,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:25:58,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:25:58,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:25:58,034 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,071 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,085 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,096 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:25:58,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:25:58,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:25:58,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:25:58,230 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,243 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,257 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,273 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:58,302 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-15 11:25:58,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 11:25:58,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:58,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-02-15 11:25:58,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:58,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:58,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:58,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 11:25:58,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-15 11:25:58,532 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:25:58,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:25:58,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:25:58,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-02-15 11:25:58,533 INFO L87 Difference]: Start difference. First operand 96 states and 486 transitions. Second operand 4 states. [2019-02-15 11:25:58,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:58,665 INFO L93 Difference]: Finished difference Result 105 states and 515 transitions. [2019-02-15 11:25:58,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:25:58,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-15 11:25:58,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:58,667 INFO L225 Difference]: With dead ends: 105 [2019-02-15 11:25:58,667 INFO L226 Difference]: Without dead ends: 104 [2019-02-15 11:25:58,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-02-15 11:25:58,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-02-15 11:25:58,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-02-15 11:25:58,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-15 11:25:58,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 513 transitions. [2019-02-15 11:25:58,715 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 513 transitions. Word has length 5 [2019-02-15 11:25:58,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:58,715 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 513 transitions. [2019-02-15 11:25:58,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:25:58,715 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 513 transitions. [2019-02-15 11:25:58,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:25:58,716 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:58,716 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:25:58,716 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:58,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:58,716 INFO L82 PathProgramCache]: Analyzing trace with hash 29235162, now seen corresponding path program 3 times [2019-02-15 11:25:58,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:58,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:58,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:58,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:58,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:59,278 WARN L181 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2019-02-15 11:25:59,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:59,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:59,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:59,399 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:25:59,399 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:25:59,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:59,400 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:59,408 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:25:59,408 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:25:59,413 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:25:59,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:25:59,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:59,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:25:59,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:25:59,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:59,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:59,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:25:59,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:59,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:59,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:59,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:25:59,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 11:25:59,461 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:59,488 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:59,503 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:59,512 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:59,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:59,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:59,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:59,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:59,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:59,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:59,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:59,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:59,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:59,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:59,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:59,605 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:59,614 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:59,623 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:59,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:59,645 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-15 11:25:59,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:59,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 11:25:59,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-15 11:25:59,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2019-02-15 11:25:59,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:199 [2019-02-15 11:26:00,007 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-02-15 11:26:00,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 61 [2019-02-15 11:26:00,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:00,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,115 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:00,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2019-02-15 11:26:00,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:00,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-02-15 11:26:00,209 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:00,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-02-15 11:26:00,295 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:00,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-02-15 11:26:00,366 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:181, output treesize:121 [2019-02-15 11:26:00,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,444 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:00,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 82 [2019-02-15 11:26:00,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:00,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2019-02-15 11:26:00,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:00,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,622 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:00,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-02-15 11:26:00,623 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:00,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,709 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:00,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2019-02-15 11:26:00,710 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:00,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-02-15 11:26:00,778 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:123 [2019-02-15 11:26:00,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:00,863 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:00,900 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:00,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:00,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:26:00,919 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:00,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:26:00,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:26:00,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:26:00,920 INFO L87 Difference]: Start difference. First operand 103 states and 513 transitions. Second operand 10 states. [2019-02-15 11:26:01,302 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-02-15 11:26:02,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:02,322 INFO L93 Difference]: Finished difference Result 131 states and 560 transitions. [2019-02-15 11:26:02,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:26:02,322 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:26:02,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:02,324 INFO L225 Difference]: With dead ends: 131 [2019-02-15 11:26:02,324 INFO L226 Difference]: Without dead ends: 130 [2019-02-15 11:26:02,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:26:02,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-02-15 11:26:02,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 41. [2019-02-15 11:26:02,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-15 11:26:02,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 140 transitions. [2019-02-15 11:26:02,354 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 140 transitions. Word has length 5 [2019-02-15 11:26:02,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:02,355 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 140 transitions. [2019-02-15 11:26:02,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:26:02,355 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 140 transitions. [2019-02-15 11:26:02,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:26:02,355 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:02,355 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:26:02,356 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:02,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:02,356 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2019-02-15 11:26:02,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:02,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:02,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:26:02,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:02,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:02,585 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-02-15 11:26:02,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:02,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:02,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:02,600 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:26:02,600 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [25] [2019-02-15 11:26:02,601 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:02,601 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:03,116 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:03,117 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:26:03,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:03,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:03,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:03,117 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:03,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:03,126 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:03,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:03,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:26:03,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:26:03,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:03,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:03,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:26:03,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:03,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:03,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:03,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:26:03,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:03,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:03,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:03,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:03,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:26:03,188 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:03,216 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:03,231 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:03,243 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:03,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:03,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:26:03,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:03,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:03,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:26:03,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:03,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:03,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:03,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:03,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:26:03,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:03,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:03,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:03,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:03,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:03,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:03,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:26:03,379 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:03,392 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:03,406 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:03,421 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:03,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:03,447 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 11:26:03,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:03,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 11:26:03,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:03,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:03,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 11:26:03,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:03,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:03,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:03,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:03,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:03,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:03,553 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:03,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 76 [2019-02-15 11:26:03,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:03,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:03,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-02-15 11:26:03,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:03,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:03,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:03,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:03,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:26:03,645 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:03,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:26:03,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:26:03,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:26:03,646 INFO L87 Difference]: Start difference. First operand 41 states and 140 transitions. Second operand 8 states. [2019-02-15 11:26:04,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:04,156 INFO L93 Difference]: Finished difference Result 71 states and 187 transitions. [2019-02-15 11:26:04,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:26:04,156 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:26:04,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:04,157 INFO L225 Difference]: With dead ends: 71 [2019-02-15 11:26:04,157 INFO L226 Difference]: Without dead ends: 68 [2019-02-15 11:26:04,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-02-15 11:26:04,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-15 11:26:04,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2019-02-15 11:26:04,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-15 11:26:04,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 160 transitions. [2019-02-15 11:26:04,180 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 160 transitions. Word has length 5 [2019-02-15 11:26:04,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:04,180 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 160 transitions. [2019-02-15 11:26:04,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:26:04,180 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 160 transitions. [2019-02-15 11:26:04,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:26:04,180 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:04,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:26:04,181 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:04,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:04,181 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2019-02-15 11:26:04,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:04,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:04,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:04,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:04,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:04,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:26:04,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:04,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:04,324 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:26:04,324 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [25] [2019-02-15 11:26:04,325 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:04,325 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:04,540 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:04,541 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:26:04,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:04,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:04,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:04,541 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:04,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:04,550 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:04,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:04,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:26:04,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:26:04,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:26:04,703 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,712 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:26:04,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:26:04,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:26:04,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:26:04,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 11:26:04,773 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,790 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,804 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,814 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,824 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:04,846 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-15 11:26:04,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 11:26:04,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:04,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-15 11:26:04,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-02-15 11:26:04,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:04,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-15 11:26:04,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:04,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:04,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:04,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:04,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 11:26:04,980 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:04,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:26:04,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:26:04,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:26:04,981 INFO L87 Difference]: Start difference. First operand 46 states and 160 transitions. Second operand 8 states. [2019-02-15 11:26:05,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:05,246 INFO L93 Difference]: Finished difference Result 73 states and 194 transitions. [2019-02-15 11:26:05,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:26:05,247 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:26:05,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:05,248 INFO L225 Difference]: With dead ends: 73 [2019-02-15 11:26:05,248 INFO L226 Difference]: Without dead ends: 72 [2019-02-15 11:26:05,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-15 11:26:05,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-15 11:26:05,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 47. [2019-02-15 11:26:05,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-15 11:26:05,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 166 transitions. [2019-02-15 11:26:05,274 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 166 transitions. Word has length 5 [2019-02-15 11:26:05,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:05,274 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 166 transitions. [2019-02-15 11:26:05,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:26:05,274 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 166 transitions. [2019-02-15 11:26:05,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:26:05,274 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:05,275 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:26:05,275 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:05,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:05,275 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2019-02-15 11:26:05,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:05,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:05,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:05,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:05,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:05,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:05,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:05,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:05,367 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:26:05,367 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [25] [2019-02-15 11:26:05,368 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:05,369 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:05,582 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:05,583 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:26:05,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:05,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:05,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:05,583 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:05,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:05,594 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:05,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:05,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:26:05,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:26:05,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:05,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:05,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:26:05,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:05,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:05,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:05,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:26:05,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 11:26:05,674 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:05,692 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:05,707 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:05,719 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:05,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:05,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:05,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:26:05,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:05,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:05,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:26:05,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:05,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:05,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:05,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:05,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:26:05,826 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:05,836 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:05,845 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:05,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:05,866 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-15 11:26:05,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:05,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 11:26:05,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:05,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:05,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 11:26:05,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:05,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:05,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:05,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:05,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:05,949 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:05,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-15 11:26:05,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:05,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:05,989 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-02-15 11:26:06,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:06,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:06,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:06,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:06,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-02-15 11:26:06,240 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:06,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 11:26:06,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 11:26:06,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-02-15 11:26:06,242 INFO L87 Difference]: Start difference. First operand 47 states and 166 transitions. Second operand 9 states. [2019-02-15 11:26:06,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:06,478 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-02-15 11:26:06,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:26:06,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-15 11:26:06,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:06,480 INFO L225 Difference]: With dead ends: 66 [2019-02-15 11:26:06,480 INFO L226 Difference]: Without dead ends: 65 [2019-02-15 11:26:06,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:26:06,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-15 11:26:06,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 48. [2019-02-15 11:26:06,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-15 11:26:06,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 172 transitions. [2019-02-15 11:26:06,513 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 172 transitions. Word has length 5 [2019-02-15 11:26:06,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:06,514 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 172 transitions. [2019-02-15 11:26:06,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 11:26:06,514 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 172 transitions. [2019-02-15 11:26:06,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:26:06,514 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:06,514 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:26:06,515 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:06,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:06,515 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2019-02-15 11:26:06,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:06,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:06,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:06,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:06,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:06,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:26:06,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:26:06,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-15 11:26:06,615 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:26:06,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:26:06,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:26:06,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-15 11:26:06,616 INFO L87 Difference]: Start difference. First operand 48 states and 172 transitions. Second operand 4 states. [2019-02-15 11:26:06,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:06,680 INFO L93 Difference]: Finished difference Result 54 states and 182 transitions. [2019-02-15 11:26:06,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:26:06,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-15 11:26:06,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:06,681 INFO L225 Difference]: With dead ends: 54 [2019-02-15 11:26:06,681 INFO L226 Difference]: Without dead ends: 51 [2019-02-15 11:26:06,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-15 11:26:06,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-15 11:26:06,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-02-15 11:26:06,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-15 11:26:06,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 175 transitions. [2019-02-15 11:26:06,719 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 175 transitions. Word has length 5 [2019-02-15 11:26:06,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:06,719 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 175 transitions. [2019-02-15 11:26:06,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:26:06,719 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 175 transitions. [2019-02-15 11:26:06,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:26:06,720 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:06,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:26:06,720 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:06,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:06,721 INFO L82 PathProgramCache]: Analyzing trace with hash 28941284, now seen corresponding path program 1 times [2019-02-15 11:26:06,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:06,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:06,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:06,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:06,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:06,906 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-02-15 11:26:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:06,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:06,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:06,935 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:26:06,935 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [25] [2019-02-15 11:26:06,936 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:06,936 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:07,167 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:07,167 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:26:07,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:07,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:07,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:07,168 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:07,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:07,177 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:07,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:07,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-15 11:26:07,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:07,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:07,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-15 11:26:07,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:07,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:07,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:07,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:07,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 11:26:07,256 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:07,265 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:07,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:07,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:26:07,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:26:07,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:26:07,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:26:07,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-15 11:26:07,305 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:07,320 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:07,332 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:07,342 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:07,351 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:07,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:07,370 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-02-15 11:26:07,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:07,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 11:26:07,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:26:07,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-15 11:26:07,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:62 [2019-02-15 11:26:07,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:07,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:07,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:07,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:07,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:26:07,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:07,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:07,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-02-15 11:26:07,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:07,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:07,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:07,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:07,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 11:26:07,556 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:07,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:26:07,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:26:07,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:26:07,557 INFO L87 Difference]: Start difference. First operand 47 states and 175 transitions. Second operand 8 states. [2019-02-15 11:26:07,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:07,809 INFO L93 Difference]: Finished difference Result 83 states and 276 transitions. [2019-02-15 11:26:07,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:26:07,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:26:07,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:07,811 INFO L225 Difference]: With dead ends: 83 [2019-02-15 11:26:07,811 INFO L226 Difference]: Without dead ends: 82 [2019-02-15 11:26:07,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:26:07,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-02-15 11:26:07,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-02-15 11:26:07,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-02-15 11:26:07,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 241 transitions. [2019-02-15 11:26:07,857 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 241 transitions. Word has length 5 [2019-02-15 11:26:07,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:07,857 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 241 transitions. [2019-02-15 11:26:07,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:26:07,858 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 241 transitions. [2019-02-15 11:26:07,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:26:07,858 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:07,858 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-15 11:26:07,859 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:07,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:07,859 INFO L82 PathProgramCache]: Analyzing trace with hash 904687194, now seen corresponding path program 1 times [2019-02-15 11:26:07,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:07,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:07,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:07,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:07,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:07,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:26:07,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:07,932 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:07,932 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:26:07,932 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [27] [2019-02-15 11:26:07,933 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:07,933 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:08,073 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:08,073 INFO L272 AbstractInterpreter]: Visited 5 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:26:08,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:08,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:08,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:08,074 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:08,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:08,083 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:08,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:08,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-15 11:26:08,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-15 11:26:08,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 11:26:08,160 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:08,174 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:08,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:08,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:26:08,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:26:08,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:26:08,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:26:08,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-15 11:26:08,215 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:08,231 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:08,244 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:08,253 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:08,263 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:08,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:08,283 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-02-15 11:26:08,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-15 11:26:08,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:08,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:08,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-15 11:26:08,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 40 [2019-02-15 11:26:08,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:08,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:08,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:20 [2019-02-15 11:26:08,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:08,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:08,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:08,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:08,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 11:26:08,405 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:08,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:26:08,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:26:08,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:26:08,405 INFO L87 Difference]: Start difference. First operand 58 states and 241 transitions. Second operand 8 states. [2019-02-15 11:26:08,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:08,755 INFO L93 Difference]: Finished difference Result 86 states and 325 transitions. [2019-02-15 11:26:08,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:26:08,755 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 11:26:08,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:08,756 INFO L225 Difference]: With dead ends: 86 [2019-02-15 11:26:08,757 INFO L226 Difference]: Without dead ends: 85 [2019-02-15 11:26:08,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:26:08,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-15 11:26:08,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 66. [2019-02-15 11:26:08,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-15 11:26:08,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 289 transitions. [2019-02-15 11:26:08,816 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 289 transitions. Word has length 6 [2019-02-15 11:26:08,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:08,817 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 289 transitions. [2019-02-15 11:26:08,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:26:08,817 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 289 transitions. [2019-02-15 11:26:08,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:26:08,817 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:08,817 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:26:08,818 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:08,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:08,818 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2019-02-15 11:26:08,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:08,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:08,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:08,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:08,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:26:08,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:08,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:08,942 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:26:08,942 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [25] [2019-02-15 11:26:08,943 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:08,943 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:09,247 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:09,247 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:26:09,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:09,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:09,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:09,248 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:09,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:09,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:09,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:09,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 11:26:09,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:26:09,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:26:09,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:26:09,486 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,511 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,535 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:26:09,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:26:09,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:26:09,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:26:09,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 11:26:09,609 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,638 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,652 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,669 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,679 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:09,710 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-15 11:26:09,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 11:26:09,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:09,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-15 11:26:09,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-02-15 11:26:09,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:09,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-02-15 11:26:09,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,921 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:09,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-02-15 11:26:09,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:09,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-02-15 11:26:09,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:09,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:10,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:10,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:10,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:26:10,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:10,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:26:10,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:26:10,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:26:10,131 INFO L87 Difference]: Start difference. First operand 66 states and 289 transitions. Second operand 10 states. [2019-02-15 11:26:10,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:10,654 INFO L93 Difference]: Finished difference Result 100 states and 357 transitions. [2019-02-15 11:26:10,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:26:10,655 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:26:10,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:10,656 INFO L225 Difference]: With dead ends: 100 [2019-02-15 11:26:10,656 INFO L226 Difference]: Without dead ends: 99 [2019-02-15 11:26:10,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:26:10,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-15 11:26:10,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 68. [2019-02-15 11:26:10,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-02-15 11:26:10,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 301 transitions. [2019-02-15 11:26:10,732 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 301 transitions. Word has length 6 [2019-02-15 11:26:10,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:10,732 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 301 transitions. [2019-02-15 11:26:10,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:26:10,732 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 301 transitions. [2019-02-15 11:26:10,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:26:10,732 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:10,732 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:26:10,733 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:10,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:10,733 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2019-02-15 11:26:10,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:10,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:10,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:10,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:10,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:10,801 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:10,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:10,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:10,802 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:26:10,802 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [25] [2019-02-15 11:26:10,804 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:10,804 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:11,097 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:11,097 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:26:11,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:11,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:11,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:11,097 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:11,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:11,106 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:11,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:11,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:26:11,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:26:11,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:26:11,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:26:11,269 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,286 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,303 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:26:11,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:26:11,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:26:11,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:26:11,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:26:11,366 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,388 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,401 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,411 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,421 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:11,448 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-15 11:26:11,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:26:11,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:11,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:26:11,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 11:26:11,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:11,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 11:26:11,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,587 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:11,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 11:26:11,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:11,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-15 11:26:11,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:11,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:11,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:11,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:11,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:26:11,693 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:11,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:26:11,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:26:11,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:26:11,694 INFO L87 Difference]: Start difference. First operand 68 states and 301 transitions. Second operand 10 states. [2019-02-15 11:26:12,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:12,194 INFO L93 Difference]: Finished difference Result 104 states and 381 transitions. [2019-02-15 11:26:12,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:26:12,194 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:26:12,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:12,196 INFO L225 Difference]: With dead ends: 104 [2019-02-15 11:26:12,196 INFO L226 Difference]: Without dead ends: 103 [2019-02-15 11:26:12,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:26:12,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-15 11:26:12,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 74. [2019-02-15 11:26:12,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-15 11:26:12,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-02-15 11:26:12,289 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-02-15 11:26:12,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:12,290 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-02-15 11:26:12,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:26:12,290 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-02-15 11:26:12,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:26:12,291 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:12,291 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:26:12,291 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:12,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:12,291 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2019-02-15 11:26:12,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:12,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:12,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:12,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:12,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:12,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:26:12,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:12,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:12,354 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:26:12,355 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [25] [2019-02-15 11:26:12,355 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:12,356 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:12,629 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:12,629 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:26:12,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:12,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:12,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:12,630 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:12,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:12,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:12,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:12,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:26:12,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:26:12,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:26:12,792 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:12,802 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:12,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:12,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:26:12,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:26:12,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:26:12,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:26:12,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 11:26:12,838 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:12,852 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:12,885 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:12,896 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:12,905 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:12,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:12,925 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-15 11:26:12,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:26:12,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:12,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:12,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:26:13,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 11:26:13,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:13,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 11:26:13,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,066 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:13,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 11:26:13,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:13,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-15 11:26:13,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:13,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:13,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:13,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:13,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:26:13,175 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:13,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:26:13,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:26:13,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:26:13,176 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 10 states. [2019-02-15 11:26:13,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:13,769 INFO L93 Difference]: Finished difference Result 107 states and 399 transitions. [2019-02-15 11:26:13,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:26:13,770 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:26:13,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:13,772 INFO L225 Difference]: With dead ends: 107 [2019-02-15 11:26:13,772 INFO L226 Difference]: Without dead ends: 106 [2019-02-15 11:26:13,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:26:13,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-15 11:26:13,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 74. [2019-02-15 11:26:13,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-15 11:26:13,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-02-15 11:26:13,868 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-02-15 11:26:13,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:13,868 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-02-15 11:26:13,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:26:13,869 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-02-15 11:26:13,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:26:13,869 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:13,869 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:26:13,870 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:13,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:13,870 INFO L82 PathProgramCache]: Analyzing trace with hash 906534236, now seen corresponding path program 1 times [2019-02-15 11:26:13,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:13,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:13,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:13,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:13,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:13,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:13,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:13,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:13,917 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:26:13,917 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [27] [2019-02-15 11:26:13,918 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:13,918 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:14,184 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:14,184 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:26:14,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:14,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:14,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:14,185 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:14,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:14,195 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:14,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:14,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:26:14,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:26:14,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:26:14,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:26:14,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:26:14,239 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:14,277 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:14,293 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:14,303 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:14,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:14,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:26:14,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:26:14,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:26:14,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:26:14,429 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:14,456 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:14,486 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:14,514 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:14,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:14,561 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 11:26:14,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 11:26:14,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:14,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:14,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 11:26:14,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:26:14,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:14,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:14,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-15 11:26:14,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:14,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:14,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:14,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:14,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:26:14,809 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:14,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:26:14,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:26:14,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:26:14,810 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 8 states. [2019-02-15 11:26:15,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:15,191 INFO L93 Difference]: Finished difference Result 100 states and 371 transitions. [2019-02-15 11:26:15,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:26:15,192 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 11:26:15,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:15,193 INFO L225 Difference]: With dead ends: 100 [2019-02-15 11:26:15,193 INFO L226 Difference]: Without dead ends: 98 [2019-02-15 11:26:15,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:26:15,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-02-15 11:26:15,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 75. [2019-02-15 11:26:15,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-15 11:26:15,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 343 transitions. [2019-02-15 11:26:15,303 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 343 transitions. Word has length 6 [2019-02-15 11:26:15,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:15,304 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 343 transitions. [2019-02-15 11:26:15,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:26:15,304 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 343 transitions. [2019-02-15 11:26:15,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:26:15,304 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:15,304 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:26:15,304 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:15,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:15,305 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2019-02-15 11:26:15,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:15,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:15,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:15,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:15,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:15,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:15,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:15,417 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:26:15,417 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [25] [2019-02-15 11:26:15,418 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:15,418 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:16,860 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:16,860 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:26:16,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:16,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:16,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:16,861 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:16,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:16,874 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:16,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:16,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:16,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:26:16,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:16,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:16,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:26:16,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:16,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:16,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:16,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:16,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:26:16,985 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:16,999 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:26:17,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:26:17,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:26:17,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:26:17,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 11:26:17,040 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,058 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,072 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,084 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,094 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:17,114 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-15 11:26:17,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 11:26:17,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-15 11:26:17,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-02-15 11:26:17,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:199 [2019-02-15 11:26:17,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 57 [2019-02-15 11:26:17,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,517 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:17,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-02-15 11:26:17,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,590 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:17,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 63 [2019-02-15 11:26:17,591 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-02-15 11:26:17,646 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:142, output treesize:92 [2019-02-15 11:26:17,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-02-15 11:26:17,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 61 [2019-02-15 11:26:17,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,836 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:17,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 53 [2019-02-15 11:26:17,838 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-02-15 11:26:17,883 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:122, output treesize:84 [2019-02-15 11:26:17,937 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:17,938 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:18,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:18,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:18,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:26:18,087 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:18,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:26:18,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:26:18,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:26:18,087 INFO L87 Difference]: Start difference. First operand 75 states and 343 transitions. Second operand 10 states. [2019-02-15 11:26:19,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:19,093 INFO L93 Difference]: Finished difference Result 124 states and 454 transitions. [2019-02-15 11:26:19,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:26:19,094 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:26:19,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:19,095 INFO L225 Difference]: With dead ends: 124 [2019-02-15 11:26:19,096 INFO L226 Difference]: Without dead ends: 123 [2019-02-15 11:26:19,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:26:19,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-02-15 11:26:19,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 78. [2019-02-15 11:26:19,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-15 11:26:19,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 361 transitions. [2019-02-15 11:26:19,223 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 361 transitions. Word has length 6 [2019-02-15 11:26:19,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:19,223 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 361 transitions. [2019-02-15 11:26:19,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:26:19,223 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 361 transitions. [2019-02-15 11:26:19,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:26:19,223 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:19,223 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:26:19,224 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:19,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:19,224 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2019-02-15 11:26:19,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:19,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:19,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:19,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:19,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:19,386 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-15 11:26:19,533 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-15 11:26:19,713 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:26:19,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:19,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:19,714 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:26:19,714 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [25] [2019-02-15 11:26:19,720 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:19,720 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:20,537 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:20,537 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:26:20,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:20,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:20,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:20,537 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:20,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:20,547 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:20,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:20,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:26:20,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:26:20,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:26:20,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:26:20,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 11:26:20,616 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:20,648 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:20,662 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:20,675 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:20,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:20,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 11:26:20,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:26:20,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:26:20,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:26:20,842 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:20,859 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:20,873 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:20,890 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:20,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:20,921 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-15 11:26:20,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:26:20,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:20,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:20,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-15 11:26:21,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,018 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:21,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 11:26:21,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:21,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:21,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-02-15 11:26:21,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,083 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:21,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 11:26:21,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:21,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:21,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-15 11:26:21,168 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:21,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:21,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:21,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:21,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-15 11:26:21,225 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:21,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 11:26:21,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 11:26:21,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:26:21,226 INFO L87 Difference]: Start difference. First operand 78 states and 361 transitions. Second operand 9 states. [2019-02-15 11:26:21,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:21,851 INFO L93 Difference]: Finished difference Result 114 states and 434 transitions. [2019-02-15 11:26:21,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:26:21,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-15 11:26:21,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:21,854 INFO L225 Difference]: With dead ends: 114 [2019-02-15 11:26:21,854 INFO L226 Difference]: Without dead ends: 113 [2019-02-15 11:26:21,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:26:21,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-15 11:26:21,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 84. [2019-02-15 11:26:21,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-15 11:26:21,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 397 transitions. [2019-02-15 11:26:21,990 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 397 transitions. Word has length 6 [2019-02-15 11:26:21,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:21,990 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 397 transitions. [2019-02-15 11:26:21,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 11:26:21,990 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 397 transitions. [2019-02-15 11:26:21,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:26:21,990 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:21,990 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:26:21,991 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:21,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:21,991 INFO L82 PathProgramCache]: Analyzing trace with hash 906278546, now seen corresponding path program 2 times [2019-02-15 11:26:21,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:21,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:21,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:21,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:21,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:22,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:22,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:22,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:22,176 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:26:22,177 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:26:22,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:22,177 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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:22,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:26:22,186 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:26:22,194 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:26:22,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:26:22,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:22,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:26:22,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:26:22,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:26:22,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:26:22,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 11:26:22,240 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:22,275 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:22,289 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:22,301 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:22,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:22,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 11:26:22,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:26:22,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:26:22,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:26:22,463 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:22,479 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:22,495 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:22,512 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:22,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:22,541 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-02-15 11:26:22,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:26:22,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:22,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:22,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 11:26:22,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 11:26:22,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:22,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:22,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-02-15 11:26:22,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,684 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:22,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 11:26:22,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:22,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:22,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-02-15 11:26:22,738 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:22,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:22,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:22,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:22,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:26:22,782 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:22,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:26:22,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:26:22,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:26:22,783 INFO L87 Difference]: Start difference. First operand 84 states and 397 transitions. Second operand 10 states. [2019-02-15 11:26:23,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:23,378 INFO L93 Difference]: Finished difference Result 164 states and 664 transitions. [2019-02-15 11:26:23,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:26:23,379 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:26:23,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:23,381 INFO L225 Difference]: With dead ends: 164 [2019-02-15 11:26:23,381 INFO L226 Difference]: Without dead ends: 163 [2019-02-15 11:26:23,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:26:23,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-02-15 11:26:23,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 117. [2019-02-15 11:26:23,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-02-15 11:26:23,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 595 transitions. [2019-02-15 11:26:23,758 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 595 transitions. Word has length 6 [2019-02-15 11:26:23,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:23,758 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 595 transitions. [2019-02-15 11:26:23,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:26:23,758 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 595 transitions. [2019-02-15 11:26:23,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:26:23,759 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:23,759 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:26:23,760 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:23,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:23,760 INFO L82 PathProgramCache]: Analyzing trace with hash 906295908, now seen corresponding path program 1 times [2019-02-15 11:26:23,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:23,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:23,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:26:23,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:23,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:23,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:26:23,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:23,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:23,959 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:26:23,959 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [27] [2019-02-15 11:26:23,959 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:23,960 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:24,499 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:24,499 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:26:24,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:24,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:24,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:24,500 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:24,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:24,509 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:24,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:24,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:26:24,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:26:24,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:26:24,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:26:24,643 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:24,656 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:24,671 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:24,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:24,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:26:24,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:26:24,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:26:24,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:26:24,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:26:24,754 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:24,790 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:24,807 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:24,821 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:24,833 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:24,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:24,866 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 11:26:24,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 11:26:24,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:24,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:24,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 11:26:24,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 11:26:25,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:26:25,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:26:25,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-02-15 11:26:25,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:25,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:25,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:25,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:25,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:26:25,218 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:25,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:26:25,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:26:25,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:26:25,218 INFO L87 Difference]: Start difference. First operand 117 states and 595 transitions. Second operand 8 states. [2019-02-15 11:26:25,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:25,698 INFO L93 Difference]: Finished difference Result 160 states and 722 transitions. [2019-02-15 11:26:25,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:26:25,698 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 11:26:25,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:25,700 INFO L225 Difference]: With dead ends: 160 [2019-02-15 11:26:25,700 INFO L226 Difference]: Without dead ends: 159 [2019-02-15 11:26:25,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:26:25,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-02-15 11:26:25,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2019-02-15 11:26:25,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-02-15 11:26:25,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 697 transitions. [2019-02-15 11:26:25,932 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 697 transitions. Word has length 6 [2019-02-15 11:26:25,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:25,933 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 697 transitions. [2019-02-15 11:26:25,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:26:25,933 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 697 transitions. [2019-02-15 11:26:25,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:26:25,934 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:25,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:26:25,934 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:25,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:25,934 INFO L82 PathProgramCache]: Analyzing trace with hash 893604942, now seen corresponding path program 1 times [2019-02-15 11:26:25,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:25,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:25,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:25,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:25,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:26,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:26:26,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:26,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:26,023 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:26:26,023 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [27] [2019-02-15 11:26:26,024 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:26,025 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:26,305 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:26,305 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:26:26,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:26,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:26,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:26,306 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:26,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:26,315 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:26,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:26,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:26:26,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:26:26,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:26,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:26,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:26:26,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:26,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:26,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:26,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:26:26,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-15 11:26:26,366 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:26,394 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:26,408 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:26,419 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:26,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:26,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-15 11:26:26,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:26,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:26,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-15 11:26:26,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:26,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:26,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:26,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:26,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 11:26:26,492 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:26,501 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:26,511 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:26,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:26,531 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-02-15 11:26:26,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:26,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-15 11:26:26,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:26,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:26,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-15 11:26:26,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:26,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:26,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:26,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:26,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:26,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:26:26,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:26,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:26,605 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2019-02-15 11:26:26,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:26,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:26,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:26,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:26,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 11:26:26,657 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:26,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:26:26,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:26:26,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:26:26,658 INFO L87 Difference]: Start difference. First operand 134 states and 697 transitions. Second operand 8 states. [2019-02-15 11:26:27,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:27,205 INFO L93 Difference]: Finished difference Result 175 states and 783 transitions. [2019-02-15 11:26:27,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:26:27,206 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 11:26:27,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:27,208 INFO L225 Difference]: With dead ends: 175 [2019-02-15 11:26:27,208 INFO L226 Difference]: Without dead ends: 174 [2019-02-15 11:26:27,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-02-15 11:26:27,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-02-15 11:26:27,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 132. [2019-02-15 11:26:27,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-02-15 11:26:27,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-02-15 11:26:27,439 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-02-15 11:26:27,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:27,439 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-02-15 11:26:27,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:26:27,439 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-02-15 11:26:27,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:26:27,440 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:27,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:26:27,441 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:27,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:27,441 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2019-02-15 11:26:27,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:27,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:27,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:27,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:27,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:27,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 11:26:27,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:26:27,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-15 11:26:27,565 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:26:27,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-15 11:26:27,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-15 11:26:27,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-02-15 11:26:27,566 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 5 states. [2019-02-15 11:26:27,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:27,942 INFO L93 Difference]: Finished difference Result 185 states and 858 transitions. [2019-02-15 11:26:27,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:26:27,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-02-15 11:26:27,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:27,944 INFO L225 Difference]: With dead ends: 185 [2019-02-15 11:26:27,944 INFO L226 Difference]: Without dead ends: 184 [2019-02-15 11:26:27,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-02-15 11:26:27,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-02-15 11:26:28,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 132. [2019-02-15 11:26:28,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-02-15 11:26:28,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-02-15 11:26:28,178 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-02-15 11:26:28,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:28,178 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-02-15 11:26:28,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-15 11:26:28,178 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-02-15 11:26:28,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:26:28,179 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:28,179 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:26:28,179 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:28,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:28,180 INFO L82 PathProgramCache]: Analyzing trace with hash 897299026, now seen corresponding path program 1 times [2019-02-15 11:26:28,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:28,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:28,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:28,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:28,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:28,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:26:28,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:28,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:28,252 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:26:28,252 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [27] [2019-02-15 11:26:28,253 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:28,253 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:28,465 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:28,465 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:26:28,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:28,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:28,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:28,466 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:28,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:28,476 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:28,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:28,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-15 11:26:28,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:28,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:28,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-15 11:26:28,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:28,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:28,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:28,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:28,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 11:26:28,556 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:28,565 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:28,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:28,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:26:28,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:26:28,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:26:28,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:26:28,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-15 11:26:28,605 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:28,621 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:28,634 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:28,644 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:28,655 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:28,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:28,675 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-02-15 11:26:28,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:28,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-15 11:26:28,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:28,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:28,719 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-15 11:26:28,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:28,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:28,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:28,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:28,738 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:28,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2019-02-15 11:26:28,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:28,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:28,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-15 11:26:28,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:28,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:28,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:28,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:28,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:26:28,808 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:28,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:26:28,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:26:28,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:26:28,809 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 8 states. [2019-02-15 11:26:29,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:29,292 INFO L93 Difference]: Finished difference Result 142 states and 698 transitions. [2019-02-15 11:26:29,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:26:29,293 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 11:26:29,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:29,296 INFO L225 Difference]: With dead ends: 142 [2019-02-15 11:26:29,296 INFO L226 Difference]: Without dead ends: 141 [2019-02-15 11:26:29,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:26:29,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-02-15 11:26:29,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2019-02-15 11:26:29,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-02-15 11:26:29,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 682 transitions. [2019-02-15 11:26:29,543 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 682 transitions. Word has length 6 [2019-02-15 11:26:29,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:29,543 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 682 transitions. [2019-02-15 11:26:29,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:26:29,543 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 682 transitions. [2019-02-15 11:26:29,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:26:29,544 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:29,544 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-15 11:26:29,544 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:29,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:29,544 INFO L82 PathProgramCache]: Analyzing trace with hash 897354700, now seen corresponding path program 1 times [2019-02-15 11:26:29,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:29,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:29,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:29,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:29,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:29,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:26:29,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:29,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:29,598 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:26:29,598 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [25] [2019-02-15 11:26:29,598 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:29,598 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:30,122 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:30,122 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:26:30,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:30,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:30,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:30,123 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:30,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:30,131 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:30,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:30,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:26:30,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:26:30,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:26:30,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:26:30,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:26:30,184 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:30,216 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:30,232 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:30,241 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:30,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:30,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:26:30,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:26:30,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:26:30,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:26:30,375 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:30,391 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:30,407 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:30,423 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:30,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:30,452 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-15 11:26:30,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:26:30,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:26:30,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:26:30,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-02-15 11:26:30,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 11:26:30,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:30,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:30,630 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-02-15 11:26:30,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:30,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-02-15 11:26:30,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:30,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:30,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-15 11:26:30,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:30,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:30,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:30,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:30,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-02-15 11:26:30,741 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:30,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 11:26:30,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 11:26:30,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-15 11:26:30,742 INFO L87 Difference]: Start difference. First operand 130 states and 682 transitions. Second operand 9 states. [2019-02-15 11:26:31,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:31,486 INFO L93 Difference]: Finished difference Result 219 states and 1011 transitions. [2019-02-15 11:26:31,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:26:31,487 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-15 11:26:31,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:31,490 INFO L225 Difference]: With dead ends: 219 [2019-02-15 11:26:31,490 INFO L226 Difference]: Without dead ends: 216 [2019-02-15 11:26:31,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:26:31,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-02-15 11:26:31,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 148. [2019-02-15 11:26:31,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-02-15 11:26:31,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 790 transitions. [2019-02-15 11:26:31,775 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 790 transitions. Word has length 6 [2019-02-15 11:26:31,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:31,775 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 790 transitions. [2019-02-15 11:26:31,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 11:26:31,775 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 790 transitions. [2019-02-15 11:26:31,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:26:31,776 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:31,776 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:26:31,776 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:31,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:31,776 INFO L82 PathProgramCache]: Analyzing trace with hash 896937626, now seen corresponding path program 3 times [2019-02-15 11:26:31,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:31,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:31,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:31,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:31,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:31,893 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:26:31,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:31,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:31,894 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:26:31,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:26:31,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:31,894 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:31,904 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:26:31,904 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:26:31,908 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:26:31,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:26:31,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:31,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:31,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:26:31,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:31,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:31,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:26:31,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:31,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:31,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:31,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:31,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:26:31,994 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:32,005 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:32,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:32,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:26:32,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:26:32,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:26:32,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:26:32,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 11:26:32,043 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:32,061 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:32,075 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:32,086 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:32,096 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:32,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:32,117 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-15 11:26:32,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 60 [2019-02-15 11:26:32,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:26:32,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-02-15 11:26:32,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:75 [2019-02-15 11:26:32,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 80 [2019-02-15 11:26:32,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:26:32,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 74 [2019-02-15 11:26:32,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:32,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-02-15 11:26:32,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:99, output treesize:90 [2019-02-15 11:26:32,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,547 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:32,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 88 [2019-02-15 11:26:32,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-02-15 11:26:32,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,765 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:32,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 65 [2019-02-15 11:26:32,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:32,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:32,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 79 [2019-02-15 11:26:32,874 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:32,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 3 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-02-15 11:26:32,966 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:117, output treesize:151 [2019-02-15 11:26:33,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:33,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:33,111 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:33,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:33,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:26:33,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:33,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:26:33,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:26:33,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:26:33,131 INFO L87 Difference]: Start difference. First operand 148 states and 790 transitions. Second operand 10 states. [2019-02-15 11:26:34,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:34,316 INFO L93 Difference]: Finished difference Result 218 states and 1012 transitions. [2019-02-15 11:26:34,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:26:34,317 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:26:34,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:34,319 INFO L225 Difference]: With dead ends: 218 [2019-02-15 11:26:34,319 INFO L226 Difference]: Without dead ends: 215 [2019-02-15 11:26:34,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-02-15 11:26:34,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-02-15 11:26:34,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 165. [2019-02-15 11:26:34,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-02-15 11:26:34,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 892 transitions. [2019-02-15 11:26:34,666 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 892 transitions. Word has length 6 [2019-02-15 11:26:34,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:34,666 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 892 transitions. [2019-02-15 11:26:34,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:26:34,666 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 892 transitions. [2019-02-15 11:26:34,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:26:34,667 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:34,667 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:26:34,667 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:34,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:34,667 INFO L82 PathProgramCache]: Analyzing trace with hash 900993110, now seen corresponding path program 1 times [2019-02-15 11:26:34,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:34,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:34,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:26:34,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:34,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:34,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:34,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:34,721 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:34,721 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:26:34,721 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [27] [2019-02-15 11:26:34,721 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:34,722 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:34,994 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:34,995 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:26:34,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:34,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:34,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:34,996 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:35,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:35,009 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:35,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:35,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:26:35,176 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-02-15 11:26:35,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:35,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:35,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:26:35,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:35,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:35,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:35,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:35,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:26:35,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:35,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:35,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:35,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:35,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:35,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:35,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:26:35,295 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:35,331 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:35,346 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:35,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:35,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:26:35,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:26:35,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:26:35,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:26:35,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:26:35,399 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:35,490 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:35,502 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:35,511 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:35,521 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:35,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:35,549 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-15 11:26:35,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:35,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 11:26:35,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:35,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:35,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 11:26:35,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:35,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:35,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:35,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:35,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:35,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:35,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:35,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 74 [2019-02-15 11:26:35,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:35,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:35,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:34 [2019-02-15 11:26:35,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:35,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:35,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:35,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:35,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 11:26:35,709 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:35,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:26:35,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:26:35,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:26:35,710 INFO L87 Difference]: Start difference. First operand 165 states and 892 transitions. Second operand 8 states. [2019-02-15 11:26:36,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:36,528 INFO L93 Difference]: Finished difference Result 274 states and 1371 transitions. [2019-02-15 11:26:36,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:26:36,529 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 11:26:36,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:36,531 INFO L225 Difference]: With dead ends: 274 [2019-02-15 11:26:36,531 INFO L226 Difference]: Without dead ends: 269 [2019-02-15 11:26:36,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:26:36,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-02-15 11:26:37,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 221. [2019-02-15 11:26:37,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-02-15 11:26:37,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1227 transitions. [2019-02-15 11:26:37,048 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1227 transitions. Word has length 6 [2019-02-15 11:26:37,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:37,048 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1227 transitions. [2019-02-15 11:26:37,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:26:37,049 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1227 transitions. [2019-02-15 11:26:37,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:26:37,050 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:37,050 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:26:37,050 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:37,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:37,050 INFO L82 PathProgramCache]: Analyzing trace with hash 900750874, now seen corresponding path program 1 times [2019-02-15 11:26:37,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:37,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:37,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:37,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:37,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:37,215 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:37,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:37,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:37,216 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:26:37,216 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [25] [2019-02-15 11:26:37,217 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:37,217 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:38,148 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:38,148 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:26:38,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:38,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:38,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26: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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:38,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:38,160 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:38,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:38,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:26:38,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:26:38,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:26:38,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:26:38,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:26:38,330 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:38,382 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:38,397 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:38,408 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:38,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:38,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:26:38,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:26:38,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:26:38,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:26:38,539 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:38,554 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:38,569 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:38,585 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:38,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:38,614 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 11:26:38,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 11:26:38,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:38,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:38,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 11:26:38,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 11:26:38,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:26:38,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:26:38,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-02-15 11:26:38,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,865 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:38,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 83 [2019-02-15 11:26:38,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:38,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:38,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2019-02-15 11:26:38,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:38,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:38,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:38,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:38,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-02-15 11:26:38,941 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:38,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:26:38,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:26:38,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-15 11:26:38,942 INFO L87 Difference]: Start difference. First operand 221 states and 1227 transitions. Second operand 10 states. [2019-02-15 11:26:40,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:40,468 INFO L93 Difference]: Finished difference Result 480 states and 2479 transitions. [2019-02-15 11:26:40,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-15 11:26:40,469 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:26:40,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:40,473 INFO L225 Difference]: With dead ends: 480 [2019-02-15 11:26:40,473 INFO L226 Difference]: Without dead ends: 477 [2019-02-15 11:26:40,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:26:40,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-02-15 11:26:41,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 348. [2019-02-15 11:26:41,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-02-15 11:26:41,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1989 transitions. [2019-02-15 11:26:41,330 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1989 transitions. Word has length 6 [2019-02-15 11:26:41,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:41,331 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 1989 transitions. [2019-02-15 11:26:41,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:26:41,331 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1989 transitions. [2019-02-15 11:26:41,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:26:41,332 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:41,332 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-15 11:26:41,332 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:41,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:41,332 INFO L82 PathProgramCache]: Analyzing trace with hash -2019467998, now seen corresponding path program 1 times [2019-02-15 11:26:41,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:41,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:41,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:41,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:41,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:41,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:41,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:41,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:41,375 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:26:41,375 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [28], [29] [2019-02-15 11:26:41,376 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:41,376 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:41,529 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:41,529 INFO L272 AbstractInterpreter]: Visited 6 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:26:41,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:41,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:41,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:41,529 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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:41,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:41,539 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:41,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:41,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:26:41,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:26:41,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 23 treesize of output 25 [2019-02-15 11:26:41,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-15 11:26:41,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-15 11:26:41,606 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:41,615 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:41,625 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:41,634 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:41,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:41,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:41,653 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-02-15 11:26:41,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-02-15 11:26:41,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:41,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:41,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-15 11:26:41,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2019-02-15 11:26:41,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:41,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:41,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2019-02-15 11:26:41,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:41,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:41,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:41,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 11:26:41,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2019-02-15 11:26:41,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:26:41,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-15 11:26:41,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-15 11:26:41,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:26:41,697 INFO L87 Difference]: Start difference. First operand 348 states and 1989 transitions. Second operand 5 states. [2019-02-15 11:26:43,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:43,624 INFO L93 Difference]: Finished difference Result 804 states and 4563 transitions. [2019-02-15 11:26:43,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:26:43,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-02-15 11:26:43,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:43,631 INFO L225 Difference]: With dead ends: 804 [2019-02-15 11:26:43,632 INFO L226 Difference]: Without dead ends: 800 [2019-02-15 11:26:43,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:26:43,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-02-15 11:26:45,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 774. [2019-02-15 11:26:45,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-02-15 11:26:45,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 4522 transitions. [2019-02-15 11:26:45,762 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 4522 transitions. Word has length 7 [2019-02-15 11:26:45,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:45,762 INFO L480 AbstractCegarLoop]: Abstraction has 774 states and 4522 transitions. [2019-02-15 11:26:45,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-15 11:26:45,762 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 4522 transitions. [2019-02-15 11:26:45,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:26:45,765 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:45,765 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:26:45,765 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:45,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:45,765 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2019-02-15 11:26:45,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:45,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:45,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:45,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:45,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:45,942 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:26:45,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:45,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:45,943 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:26:45,943 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [25] [2019-02-15 11:26:45,944 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:45,945 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:46,302 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:46,303 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 11:26:46,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:46,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:46,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:46,303 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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:46,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:46,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:46,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:46,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:26:46,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:26:46,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:26:46,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:26:46,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 11:26:46,389 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:46,457 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:46,473 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:46,484 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:46,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:46,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 11:26:46,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:26:46,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:26:46,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:26:46,662 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:46,679 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:46,695 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:46,711 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:46,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:46,741 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-02-15 11:26:46,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 11:26:46,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:46,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:46,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-02-15 11:26:46,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-02-15 11:26:46,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:46,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:46,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-15 11:26:46,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:46,916 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:46,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-02-15 11:26:46,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:46,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:46,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-02-15 11:26:47,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:47,022 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:47,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 11:26:47,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:47,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:47,056 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-02-15 11:26:47,085 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:47,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:47,143 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:47,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:47,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 11:26:47,163 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:47,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:26:47,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:26:47,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:26:47,163 INFO L87 Difference]: Start difference. First operand 774 states and 4522 transitions. Second operand 12 states. [2019-02-15 11:26:49,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:49,791 INFO L93 Difference]: Finished difference Result 821 states and 4651 transitions. [2019-02-15 11:26:49,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:26:49,792 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-15 11:26:49,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:49,798 INFO L225 Difference]: With dead ends: 821 [2019-02-15 11:26:49,798 INFO L226 Difference]: Without dead ends: 820 [2019-02-15 11:26:49,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-02-15 11:26:49,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-02-15 11:26:51,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 736. [2019-02-15 11:26:51,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-02-15 11:26:51,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 4294 transitions. [2019-02-15 11:26:51,723 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 4294 transitions. Word has length 7 [2019-02-15 11:26:51,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:51,723 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 4294 transitions. [2019-02-15 11:26:51,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:26:51,724 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 4294 transitions. [2019-02-15 11:26:51,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:26:51,725 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:51,726 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:26:51,726 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:51,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:51,726 INFO L82 PathProgramCache]: Analyzing trace with hash -2017620956, now seen corresponding path program 1 times [2019-02-15 11:26:51,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:51,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:51,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:51,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:51,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:51,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:51,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:51,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:51,871 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:26:51,871 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [29] [2019-02-15 11:26:51,872 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:51,872 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:52,098 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:52,098 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:26:52,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:52,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:52,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:52,099 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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:52,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:52,107 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:52,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:52,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-02-15 11:26:52,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-15 11:26:52,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 22 treesize of output 24 [2019-02-15 11:26:52,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:52,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:52,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:52,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:52,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-02-15 11:26:52,173 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:52,182 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:52,191 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:52,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:52,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:26:52,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:26:52,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-15 11:26:52,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-15 11:26:52,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:26:52,237 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:52,252 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:52,263 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:52,273 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:52,283 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:52,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:52,300 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:36, output treesize:42 [2019-02-15 11:26:52,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:52,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-15 11:26:52,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:52,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:52,328 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-02-15 11:26:52,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:52,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:52,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:52,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:52,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-15 11:26:52,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:52,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:52,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-02-15 11:26:52,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:52,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:52,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:52,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:52,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:26:52,404 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:52,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:26:52,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:26:52,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:26:52,405 INFO L87 Difference]: Start difference. First operand 736 states and 4294 transitions. Second operand 8 states. [2019-02-15 11:26:54,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:54,517 INFO L93 Difference]: Finished difference Result 805 states and 4572 transitions. [2019-02-15 11:26:54,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:26:54,518 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-15 11:26:54,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:54,524 INFO L225 Difference]: With dead ends: 805 [2019-02-15 11:26:54,524 INFO L226 Difference]: Without dead ends: 804 [2019-02-15 11:26:54,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-15 11:26:54,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-02-15 11:26:56,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 776. [2019-02-15 11:26:56,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-02-15 11:26:56,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 4534 transitions. [2019-02-15 11:26:56,560 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 4534 transitions. Word has length 7 [2019-02-15 11:26:56,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:56,560 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 4534 transitions. [2019-02-15 11:26:56,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:26:56,560 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 4534 transitions. [2019-02-15 11:26:56,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:26:56,563 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:56,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:26:56,563 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:56,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:56,563 INFO L82 PathProgramCache]: Analyzing trace with hash -2018040016, now seen corresponding path program 1 times [2019-02-15 11:26:56,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:56,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:56,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:56,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:56,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:56,990 WARN L181 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 17 [2019-02-15 11:26:57,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:26:57,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:57,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:57,039 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:26:57,039 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [27] [2019-02-15 11:26:57,040 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:57,040 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:57,334 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:57,334 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:26:57,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:57,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:57,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:57,335 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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:57,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:57,362 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:57,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:57,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:26:57,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:26:57,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:26:57,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:26:57,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:26:57,415 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:57,443 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:57,456 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:57,467 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:57,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:57,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:26:57,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:26:57,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:26:57,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:26:57,599 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:57,614 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:57,628 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:57,644 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:57,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:57,673 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-15 11:26:57,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:26:57,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:57,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:57,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:26:57,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 11:26:57,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:57,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:57,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 11:26:57,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,813 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:57,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:57,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-02-15 11:26:57,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:57,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:57,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-15 11:26:57,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:57,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:57,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:57,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:57,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:26:57,930 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:57,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:26:57,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:26:57,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:26:57,931 INFO L87 Difference]: Start difference. First operand 776 states and 4534 transitions. Second operand 10 states. [2019-02-15 11:27:00,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:00,751 INFO L93 Difference]: Finished difference Result 1004 states and 5711 transitions. [2019-02-15 11:27:00,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:27:00,752 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 11:27:00,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:00,761 INFO L225 Difference]: With dead ends: 1004 [2019-02-15 11:27:00,761 INFO L226 Difference]: Without dead ends: 1003 [2019-02-15 11:27:00,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:27:00,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-02-15 11:27:02,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 847. [2019-02-15 11:27:02,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-02-15 11:27:02,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 4961 transitions. [2019-02-15 11:27:02,941 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 4961 transitions. Word has length 7 [2019-02-15 11:27:02,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:02,942 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 4961 transitions. [2019-02-15 11:27:02,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:27:02,942 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 4961 transitions. [2019-02-15 11:27:02,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:27:02,944 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:02,944 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:27:02,944 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:02,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:02,945 INFO L82 PathProgramCache]: Analyzing trace with hash -2030550250, now seen corresponding path program 1 times [2019-02-15 11:27:02,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:02,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:02,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:02,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:02,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:03,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:03,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:03,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:03,094 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:27:03,094 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [28], [29] [2019-02-15 11:27:03,095 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:03,095 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:03,302 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:03,303 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:27:03,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:03,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:03,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:03,303 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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:27:03,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:03,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:03,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:03,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-15 11:27:03,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:03,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:03,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-15 11:27:03,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:03,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:03,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:03,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:03,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 11:27:03,390 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:03,399 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:03,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:03,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:27:03,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:27:03,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:27:03,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:27:03,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-15 11:27:03,449 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:03,466 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:03,479 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:03,488 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:03,498 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:03,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:03,518 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-02-15 11:27:03,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:03,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2019-02-15 11:27:03,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:03,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:03,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:29 [2019-02-15 11:27:03,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:03,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:03,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:03,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:03,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:03,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:03,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 11:27:03,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:27:03,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:27:03,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:46 [2019-02-15 11:27:03,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:03,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:03,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:03,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:03,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-02-15 11:27:03,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:03,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 11:27:03,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 11:27:03,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:27:03,727 INFO L87 Difference]: Start difference. First operand 847 states and 4961 transitions. Second operand 9 states. [2019-02-15 11:27:07,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:07,077 INFO L93 Difference]: Finished difference Result 1213 states and 6892 transitions. [2019-02-15 11:27:07,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:27:07,077 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-02-15 11:27:07,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:07,086 INFO L225 Difference]: With dead ends: 1213 [2019-02-15 11:27:07,086 INFO L226 Difference]: Without dead ends: 1212 [2019-02-15 11:27:07,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:27:07,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-02-15 11:27:10,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1101. [2019-02-15 11:27:10,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2019-02-15 11:27:10,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 6484 transitions. [2019-02-15 11:27:10,014 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 6484 transitions. Word has length 7 [2019-02-15 11:27:10,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:10,015 INFO L480 AbstractCegarLoop]: Abstraction has 1101 states and 6484 transitions. [2019-02-15 11:27:10,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 11:27:10,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 6484 transitions. [2019-02-15 11:27:10,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:27:10,017 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:10,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:27:10,018 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:10,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:10,018 INFO L82 PathProgramCache]: Analyzing trace with hash -2026994678, now seen corresponding path program 1 times [2019-02-15 11:27:10,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:10,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:10,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:10,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:10,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:10,162 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:10,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:10,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:10,162 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:27:10,163 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [25] [2019-02-15 11:27:10,164 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:10,164 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:10,527 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:10,527 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 11:27:10,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:10,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:10,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:10,527 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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:27:10,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:10,537 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:10,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:10,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:27:10,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:27:10,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:27:10,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:27:10,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 11:27:10,614 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:10,642 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:10,658 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:10,669 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:10,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:10,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 11:27:10,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:27:10,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:27:10,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:27:10,837 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:10,855 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:10,871 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:10,886 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:10,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:10,915 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-15 11:27:10,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:10,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 11:27:10,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:10,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:10,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-15 11:27:11,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,012 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:11,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-02-15 11:27:11,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:11,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:11,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:42 [2019-02-15 11:27:11,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2019-02-15 11:27:11,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:11,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:11,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:38 [2019-02-15 11:27:11,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,174 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:11,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-02-15 11:27:11,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:11,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:11,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 11:27:11,231 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:11,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:11,279 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:11,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:11,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 11:27:11,298 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:11,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:27:11,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:27:11,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:27:11,299 INFO L87 Difference]: Start difference. First operand 1101 states and 6484 transitions. Second operand 12 states. [2019-02-15 11:27:15,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:15,709 INFO L93 Difference]: Finished difference Result 1577 states and 9103 transitions. [2019-02-15 11:27:15,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:27:15,709 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-15 11:27:15,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:15,724 INFO L225 Difference]: With dead ends: 1577 [2019-02-15 11:27:15,724 INFO L226 Difference]: Without dead ends: 1575 [2019-02-15 11:27:15,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:27:15,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2019-02-15 11:27:17,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 754. [2019-02-15 11:27:17,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-02-15 11:27:17,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 4401 transitions. [2019-02-15 11:27:17,771 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 4401 transitions. Word has length 7 [2019-02-15 11:27:17,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:17,772 INFO L480 AbstractCegarLoop]: Abstraction has 754 states and 4401 transitions. [2019-02-15 11:27:17,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:27:17,772 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 4401 transitions. [2019-02-15 11:27:17,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:27:17,773 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:17,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:27:17,773 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:17,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:17,774 INFO L82 PathProgramCache]: Analyzing trace with hash -2027404064, now seen corresponding path program 1 times [2019-02-15 11:27:17,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:17,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:17,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:17,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:17,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:17,922 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-15 11:27:18,125 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-02-15 11:27:18,143 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:27:18,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:18,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:18,144 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:27:18,144 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [25] [2019-02-15 11:27:18,145 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:18,145 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:18,479 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:18,480 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 11:27:18,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:18,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:18,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:18,480 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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:27:18,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:18,508 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:18,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:18,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:27:18,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:27:18,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:27:18,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:27:18,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 11:27:18,570 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:18,589 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:18,603 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:18,614 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:18,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:18,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:27:18,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:27:18,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:27:18,701 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:18,711 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:18,719 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:18,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:18,739 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-15 11:27:18,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:27:18,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:18,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:18,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:27:18,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,822 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:18,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-02-15 11:27:18,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:18,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:18,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-02-15 11:27:18,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-02-15 11:27:18,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:18,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:18,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-15 11:27:18,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,917 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:18,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-02-15 11:27:18,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:18,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:18,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-15 11:27:18,958 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:18,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:19,002 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:19,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:19,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-15 11:27:19,020 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:19,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:27:19,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:27:19,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:27:19,021 INFO L87 Difference]: Start difference. First operand 754 states and 4401 transitions. Second operand 11 states. [2019-02-15 11:27:22,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:22,400 INFO L93 Difference]: Finished difference Result 1108 states and 6316 transitions. [2019-02-15 11:27:22,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:27:22,400 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-15 11:27:22,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:22,406 INFO L225 Difference]: With dead ends: 1108 [2019-02-15 11:27:22,406 INFO L226 Difference]: Without dead ends: 1107 [2019-02-15 11:27:22,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:27:22,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-02-15 11:27:25,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1052. [2019-02-15 11:27:25,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-02-15 11:27:25,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 6189 transitions. [2019-02-15 11:27:25,258 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 6189 transitions. Word has length 7 [2019-02-15 11:27:25,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:25,258 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 6189 transitions. [2019-02-15 11:27:25,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:27:25,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 6189 transitions. [2019-02-15 11:27:25,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:27:25,260 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:25,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:27:25,260 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:25,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:25,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1973291948, now seen corresponding path program 1 times [2019-02-15 11:27:25,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:25,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:25,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:25,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:25,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:25,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:27:25,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:25,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:25,341 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:27:25,341 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [26], [28], [29] [2019-02-15 11:27:25,342 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:25,342 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:25,828 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:25,829 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:27:25,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:25,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:25,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:25,829 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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:27:25,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:25,838 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:25,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:25,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:27:25,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:27:25,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:27:25,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:27:25,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:27:25,891 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:25,920 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:25,932 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:25,941 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:25,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:25,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:27:25,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:27:26,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:27:26,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:27:26,062 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:26,076 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:26,088 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:26,103 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:26,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:26,134 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 11:27:26,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 11:27:26,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:26,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:26,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 11:27:26,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,209 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:26,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 11:27:26,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:27:26,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:27:26,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-02-15 11:27:26,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:26,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:26,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:26,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:26,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:27:26,375 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:26,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:27:26,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:27:26,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:27:26,375 INFO L87 Difference]: Start difference. First operand 1052 states and 6189 transitions. Second operand 8 states. [2019-02-15 11:27:29,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:29,391 INFO L93 Difference]: Finished difference Result 1075 states and 6230 transitions. [2019-02-15 11:27:29,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:27:29,392 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-15 11:27:29,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:29,397 INFO L225 Difference]: With dead ends: 1075 [2019-02-15 11:27:29,397 INFO L226 Difference]: Without dead ends: 1074 [2019-02-15 11:27:29,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:27:29,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2019-02-15 11:27:32,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1054. [2019-02-15 11:27:32,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-02-15 11:27:32,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 6201 transitions. [2019-02-15 11:27:32,284 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 6201 transitions. Word has length 7 [2019-02-15 11:27:32,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:32,284 INFO L480 AbstractCegarLoop]: Abstraction has 1054 states and 6201 transitions. [2019-02-15 11:27:32,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:27:32,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 6201 transitions. [2019-02-15 11:27:32,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:27:32,286 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:32,286 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:27:32,286 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:32,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:32,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1973720682, now seen corresponding path program 1 times [2019-02-15 11:27:32,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:32,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:32,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:32,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:32,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:32,430 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-15 11:27:32,813 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-15 11:27:32,872 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:27:32,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:32,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:32,873 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:27:32,873 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [25] [2019-02-15 11:27:32,874 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:32,874 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:33,599 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:33,599 INFO L272 AbstractInterpreter]: Visited 7 different actions 17 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 11:27:33,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:33,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:33,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:33,599 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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:27:33,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:33,608 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:33,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:33,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:27:33,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:27:33,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:33,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:33,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:27:33,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:33,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:33,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:33,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:27:33,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:33,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:33,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:33,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:33,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 11:27:33,667 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:33,697 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:33,712 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:33,722 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:33,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:33,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:33,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 11:27:33,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:33,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:33,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:27:33,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:33,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:33,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:33,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:33,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:27:33,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:33,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:33,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:33,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:33,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:33,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:33,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:27:33,889 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:33,905 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:33,919 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:33,934 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:33,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:33,981 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-15 11:27:34,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:27:34,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:34,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:34,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-15 11:27:34,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,165 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:34,165 INFO L303 Elim1Store]: Index analysis took 102 ms [2019-02-15 11:27:34,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 11:27:34,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:34,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:34,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-02-15 11:27:34,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 11:27:34,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:34,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:34,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-02-15 11:27:34,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:34,297 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:34,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 11:27:34,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:34,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:34,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-02-15 11:27:34,354 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:34,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:34,402 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:34,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:34,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 11:27:34,421 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:34,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:27:34,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:27:34,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:27:34,422 INFO L87 Difference]: Start difference. First operand 1054 states and 6201 transitions. Second operand 12 states. [2019-02-15 11:27:38,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:38,974 INFO L93 Difference]: Finished difference Result 1522 states and 8743 transitions. [2019-02-15 11:27:38,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:27:38,974 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-15 11:27:38,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:38,981 INFO L225 Difference]: With dead ends: 1522 [2019-02-15 11:27:38,981 INFO L226 Difference]: Without dead ends: 1521 [2019-02-15 11:27:38,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-02-15 11:27:38,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2019-02-15 11:27:42,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1125. [2019-02-15 11:27:42,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-02-15 11:27:42,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 6627 transitions. [2019-02-15 11:27:42,147 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 6627 transitions. Word has length 7 [2019-02-15 11:27:42,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:42,147 INFO L480 AbstractCegarLoop]: Abstraction has 1125 states and 6627 transitions. [2019-02-15 11:27:42,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:27:42,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 6627 transitions. [2019-02-15 11:27:42,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:27:42,149 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:42,149 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:27:42,150 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:42,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:42,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1956607002, now seen corresponding path program 1 times [2019-02-15 11:27:42,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:42,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:42,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:42,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:42,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:42,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:42,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:42,185 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:42,186 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:27:42,186 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [28], [30], [31] [2019-02-15 11:27:42,187 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:42,187 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:43,529 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:43,529 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:27:43,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:43,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:43,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:43,529 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 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:27:43,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:43,539 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:43,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:43,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:27:43,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:27:43,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 23 treesize of output 25 [2019-02-15 11:27:43,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-15 11:27:43,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-15 11:27:43,601 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:43,611 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:43,618 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:43,627 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:43,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:43,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:43,645 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-02-15 11:27:43,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:43,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-02-15 11:27:43,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:43,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:43,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-15 11:27:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:43,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:43,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:43,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 11:27:43,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-15 11:27:43,682 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:27:43,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:27:43,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:27:43,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 11:27:43,683 INFO L87 Difference]: Start difference. First operand 1125 states and 6627 transitions. Second operand 4 states. [2019-02-15 11:27:47,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:47,714 INFO L93 Difference]: Finished difference Result 1559 states and 9048 transitions. [2019-02-15 11:27:47,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 11:27:47,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-02-15 11:27:47,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:47,722 INFO L225 Difference]: With dead ends: 1559 [2019-02-15 11:27:47,723 INFO L226 Difference]: Without dead ends: 1554 [2019-02-15 11:27:47,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 11:27:47,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2019-02-15 11:27:52,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1528. [2019-02-15 11:27:52,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2019-02-15 11:27:52,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 8994 transitions. [2019-02-15 11:27:52,533 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 8994 transitions. Word has length 7 [2019-02-15 11:27:52,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:52,533 INFO L480 AbstractCegarLoop]: Abstraction has 1528 states and 8994 transitions. [2019-02-15 11:27:52,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:27:52,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 8994 transitions. [2019-02-15 11:27:52,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:27:52,535 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:52,535 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:27:52,535 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:52,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:52,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1969597864, now seen corresponding path program 1 times [2019-02-15 11:27:52,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:52,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:52,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:52,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:52,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:52,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:27:52,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:52,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:52,590 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:27:52,591 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [29] [2019-02-15 11:27:52,592 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:52,592 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:53,095 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:53,095 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:27:53,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:53,096 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:53,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:53,096 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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:27:53,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:53,104 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:53,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:53,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:27:53,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:27:53,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:27:53,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:27:53,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:27:53,152 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:53,182 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:53,195 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:53,205 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:53,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:53,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:27:53,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:27:53,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:27:53,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:27:53,325 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:53,339 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:53,353 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:53,368 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:53,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:53,394 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 11:27:53,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 11:27:53,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:53,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:53,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 11:27:53,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 11:27:53,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:27:53,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:27:53,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-02-15 11:27:53,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:53,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:53,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:53,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:53,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 11:27:53,643 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:53,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:27:53,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:27:53,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:27:53,643 INFO L87 Difference]: Start difference. First operand 1528 states and 8994 transitions. Second operand 8 states. [2019-02-15 11:27:58,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:58,002 INFO L93 Difference]: Finished difference Result 1574 states and 9156 transitions. [2019-02-15 11:27:58,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:27:58,003 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-15 11:27:58,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:58,008 INFO L225 Difference]: With dead ends: 1574 [2019-02-15 11:27:58,009 INFO L226 Difference]: Without dead ends: 1570 [2019-02-15 11:27:58,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:27:58,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-02-15 11:28:02,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1547. [2019-02-15 11:28:02,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-02-15 11:28:02,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 9102 transitions. [2019-02-15 11:28:02,378 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 9102 transitions. Word has length 7 [2019-02-15 11:28:02,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:28:02,378 INFO L480 AbstractCegarLoop]: Abstraction has 1547 states and 9102 transitions. [2019-02-15 11:28:02,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:28:02,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 9102 transitions. [2019-02-15 11:28:02,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:28:02,380 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:28:02,381 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-15 11:28:02,381 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:28:02,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:02,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1969901668, now seen corresponding path program 2 times [2019-02-15 11:28:02,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:28:02,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:02,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:02,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:02,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:28:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:02,444 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:28:02,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:02,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:28:02,445 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:28:02,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:28:02,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:02,445 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 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:28:02,453 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:28:02,453 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:28:02,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:28:02,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:28:02,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:28:02,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:28:02,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:28:02,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:28:02,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:28:02,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:28:02,501 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:02,526 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:02,538 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:02,549 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:02,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:02,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:28:02,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:28:02,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:28:02,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:28:02,668 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:02,682 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:02,695 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:02,710 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:02,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:02,736 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 11:28:02,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 11:28:02,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:02,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:02,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-02-15 11:28:02,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 11:28:02,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:28:02,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-15 11:28:02,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:72 [2019-02-15 11:28:02,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,997 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:02,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 11:28:02,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:03,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:03,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:27 [2019-02-15 11:28:03,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:03,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-02-15 11:28:03,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:03,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:03,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-02-15 11:28:03,094 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:03,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:28:03,139 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:03,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:28:03,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 11:28:03,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:28:03,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:28:03,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:28:03,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:28:03,158 INFO L87 Difference]: Start difference. First operand 1547 states and 9102 transitions. Second operand 11 states. [2019-02-15 11:28:09,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:28:09,161 INFO L93 Difference]: Finished difference Result 2098 states and 12192 transitions. [2019-02-15 11:28:09,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:28:09,162 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-15 11:28:09,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:28:09,167 INFO L225 Difference]: With dead ends: 2098 [2019-02-15 11:28:09,167 INFO L226 Difference]: Without dead ends: 2091 [2019-02-15 11:28:09,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:28:09,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2019-02-15 11:28:14,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1838. [2019-02-15 11:28:14,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-02-15 11:28:14,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10847 transitions. [2019-02-15 11:28:14,377 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10847 transitions. Word has length 7 [2019-02-15 11:28:14,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:28:14,377 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10847 transitions. [2019-02-15 11:28:14,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:28:14,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10847 transitions. [2019-02-15 11:28:14,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:28:14,380 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:28:14,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:28:14,380 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:28:14,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:14,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1965903780, now seen corresponding path program 1 times [2019-02-15 11:28:14,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:28:14,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:14,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:28:14,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:14,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:28:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:14,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:14,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:14,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:28:14,434 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:28:14,434 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [26], [28], [29] [2019-02-15 11:28:14,435 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:28:14,435 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:28:14,913 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:28:14,914 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:28:14,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:14,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:28:14,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:14,914 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 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:28:14,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:14,923 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:28:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:14,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:28:14,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:28:14,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:28:15,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:15,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:15,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:28:15,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:15,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:15,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:15,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:28:15,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:15,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:15,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:15,030 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:15,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:28:15,032 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:15,055 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:15,067 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:15,077 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:15,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:15,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:28:15,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:15,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:15,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:28:15,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:15,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:15,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:15,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:15,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:28:15,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:15,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:15,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:15,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:15,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:15,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:15,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:28:15,199 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:15,213 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:15,226 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:15,241 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:15,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:15,267 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 11:28:15,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:15,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 11:28:15,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:15,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:15,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 11:28:15,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:15,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:15,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:15,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:15,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:15,339 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:15,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-15 11:28:15,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:15,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:15,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-02-15 11:28:15,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:15,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:28:15,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:15,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:28:15,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:28:15,497 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:28:15,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:28:15,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:28:15,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:28:15,497 INFO L87 Difference]: Start difference. First operand 1838 states and 10847 transitions. Second operand 8 states. [2019-02-15 11:28:20,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:28:20,577 INFO L93 Difference]: Finished difference Result 1846 states and 10859 transitions. [2019-02-15 11:28:20,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:28:20,577 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-15 11:28:20,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:28:20,582 INFO L225 Difference]: With dead ends: 1846 [2019-02-15 11:28:20,582 INFO L226 Difference]: Without dead ends: 1839 [2019-02-15 11:28:20,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:28:20,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2019-02-15 11:28:25,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1838. [2019-02-15 11:28:25,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-02-15 11:28:25,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10841 transitions. [2019-02-15 11:28:25,829 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10841 transitions. Word has length 7 [2019-02-15 11:28:25,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:28:25,830 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10841 transitions. [2019-02-15 11:28:25,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:28:25,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10841 transitions. [2019-02-15 11:28:25,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:28:25,832 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:28:25,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:28:25,832 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:28:25,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:25,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1931530426, now seen corresponding path program 1 times [2019-02-15 11:28:25,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:28:25,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:25,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:25,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:25,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:28:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:25,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:28:25,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:25,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:28:25,965 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:28:25,966 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [27] [2019-02-15 11:28:25,967 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:28:25,967 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:28:26,229 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:28:26,230 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:28:26,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:26,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:28:26,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:26,230 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 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:28:26,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:26,240 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:28:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:26,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:28:26,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:28:26,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:28:26,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:28:26,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:28:26,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:28:26,287 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:26,312 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:26,325 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:26,335 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:26,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:26,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:28:26,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:28:26,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:28:26,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:28:26,459 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:26,473 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:26,486 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:26,501 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:26,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:26,528 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-15 11:28:26,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:28:26,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:28:26,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-15 11:28:26,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:96 [2019-02-15 11:28:26,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 61 [2019-02-15 11:28:26,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:26,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 78 [2019-02-15 11:28:26,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:26,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:28:26,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:64 [2019-02-15 11:28:26,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,902 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:26,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 67 [2019-02-15 11:28:26,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:26,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,963 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:26,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 101 [2019-02-15 11:28:26,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:27,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:28:27,017 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-02-15 11:28:31,090 WARN L181 SmtUtils]: Spent 4.05 s on a formula simplification that was a NOOP. DAG size: 51 [2019-02-15 11:28:31,095 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:31,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:28:31,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:31,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:28:31,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-15 11:28:31,152 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:28:31,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:28:31,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:28:31,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:28:31,153 INFO L87 Difference]: Start difference. First operand 1838 states and 10841 transitions. Second operand 11 states. [2019-02-15 11:28:32,291 WARN L181 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-02-15 11:28:33,827 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-02-15 11:28:38,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:28:38,854 INFO L93 Difference]: Finished difference Result 2193 states and 12710 transitions. [2019-02-15 11:28:38,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:28:38,854 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-15 11:28:38,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:28:38,860 INFO L225 Difference]: With dead ends: 2193 [2019-02-15 11:28:38,860 INFO L226 Difference]: Without dead ends: 2192 [2019-02-15 11:28:38,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-02-15 11:28:38,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2019-02-15 11:28:44,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1949. [2019-02-15 11:28:44,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2019-02-15 11:28:44,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 11505 transitions. [2019-02-15 11:28:44,437 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 11505 transitions. Word has length 7 [2019-02-15 11:28:44,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:28:44,438 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 11505 transitions. [2019-02-15 11:28:44,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:28:44,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 11505 transitions. [2019-02-15 11:28:44,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:28:44,440 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:28:44,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:28:44,440 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:28:44,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:44,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 2 times [2019-02-15 11:28:44,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:28:44,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:44,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:44,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:44,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:28:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:44,587 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-15 11:28:45,142 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:45,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:45,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:28:45,143 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:28:45,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:28:45,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:45,144 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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:28:45,165 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:28:45,165 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:28:45,211 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:28:45,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:28:45,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:28:45,377 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-02-15 11:28:45,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:45,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 11:28:45,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:45,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:45,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:28:45,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:45,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:45,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:45,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:45,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:28:45,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:45,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:45,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:45,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:45,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:45,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:45,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:28:45,554 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:45,683 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:45,702 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:45,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:45,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:28:45,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:28:45,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:28:45,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:28:45,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 11:28:45,757 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:45,780 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:45,793 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:45,803 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:45,812 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:45,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:45,840 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-15 11:28:45,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:45,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:28:45,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:45,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:45,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-15 11:28:45,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:45,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:45,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:45,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:45,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:45,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:45,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:45,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 11:28:45,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:45,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:45,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:38 [2019-02-15 11:28:46,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:46,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:46,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:46,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:46,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:46,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:46,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:46,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:46,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:46,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:46,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:46,017 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:46,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 11:28:46,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:46,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:46,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-02-15 11:28:46,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:46,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:46,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:46,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:46,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:46,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:46,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:46,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:46,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:46,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:46,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:46,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:46,082 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:46,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-15 11:28:46,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:46,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:46,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-02-15 11:28:46,142 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:46,142 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:28:46,192 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:46,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:28:46,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 11:28:46,210 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:28:46,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:28:46,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:28:46,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:28:46,211 INFO L87 Difference]: Start difference. First operand 1949 states and 11505 transitions. Second operand 12 states. [2019-02-15 11:28:55,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:28:55,250 INFO L93 Difference]: Finished difference Result 2526 states and 14755 transitions. [2019-02-15 11:28:55,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:28:55,250 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-15 11:28:55,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:28:55,257 INFO L225 Difference]: With dead ends: 2526 [2019-02-15 11:28:55,257 INFO L226 Difference]: Without dead ends: 2520 [2019-02-15 11:28:55,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-02-15 11:28:55,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2019-02-15 11:29:00,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 1960. [2019-02-15 11:29:00,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1960 states. [2019-02-15 11:29:00,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 11570 transitions. [2019-02-15 11:29:00,968 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 11570 transitions. Word has length 7 [2019-02-15 11:29:00,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:29:00,969 INFO L480 AbstractCegarLoop]: Abstraction has 1960 states and 11570 transitions. [2019-02-15 11:29:00,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:29:00,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 11570 transitions. [2019-02-15 11:29:00,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:29:00,972 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:29:00,972 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:29:00,972 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:29:00,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:29:00,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1928255402, now seen corresponding path program 1 times [2019-02-15 11:29:00,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:29:00,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:00,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:29:00,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:00,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:29:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:29:01,183 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-02-15 11:29:01,495 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-02-15 11:29:01,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:29:01,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:29:01,539 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:29:01,539 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:29:01,539 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [26], [28], [29] [2019-02-15 11:29:01,540 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:29:01,540 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:29:01,778 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:29:01,778 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:29:01,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:29:01,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:29:01,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:29:01,778 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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:29:01,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:29:01,787 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:29:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:29:01,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:29:01,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:29:01,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:29:01,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:01,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:01,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:29:01,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:01,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:01,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:01,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:29:01,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:01,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:01,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:01,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:01,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:29:01,826 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:01,851 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:01,863 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:01,873 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:01,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:01,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:29:01,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:01,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:01,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:29:01,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:01,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:01,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:01,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:01,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:29:01,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:01,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:01,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:01,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:01,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:01,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:01,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:29:01,998 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:02,012 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:02,025 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:02,040 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:02,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:29:02,067 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 11:29:02,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:02,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:29:02,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:29:02,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:29:02,286 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:96 [2019-02-15 11:29:02,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:02,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:02,325 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:29:02,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-15 11:29:02,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:02,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:29:02,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:29 [2019-02-15 11:29:02,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:02,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:29:02,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:02,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:29:02,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-02-15 11:29:02,403 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:29:02,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 11:29:02,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 11:29:02,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-02-15 11:29:02,403 INFO L87 Difference]: Start difference. First operand 1960 states and 11570 transitions. Second operand 9 states. [2019-02-15 11:29:08,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:29:08,001 INFO L93 Difference]: Finished difference Result 1971 states and 11600 transitions. [2019-02-15 11:29:08,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:29:08,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-02-15 11:29:08,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:29:08,007 INFO L225 Difference]: With dead ends: 1971 [2019-02-15 11:29:08,007 INFO L226 Difference]: Without dead ends: 1964 [2019-02-15 11:29:08,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:29:08,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-02-15 11:29:13,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-02-15 11:29:13,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-02-15 11:29:13,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 11590 transitions. [2019-02-15 11:29:13,750 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 11590 transitions. Word has length 7 [2019-02-15 11:29:13,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:29:13,751 INFO L480 AbstractCegarLoop]: Abstraction has 1964 states and 11590 transitions. [2019-02-15 11:29:13,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 11:29:13,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 11590 transitions. [2019-02-15 11:29:13,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:29:13,755 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:29:13,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:29:13,755 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:29:13,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:29:13,755 INFO L82 PathProgramCache]: Analyzing trace with hash 2048132400, now seen corresponding path program 2 times [2019-02-15 11:29:13,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:29:13,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:13,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:29:13,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:13,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:29:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:29:13,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:29:13,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:29:13,819 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:29:13,819 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:29:13,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:29:13,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:29:13,820 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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:29:13,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:29:13,829 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:29:13,834 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:29:13,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:29:13,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:29:13,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:29:13,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:29:13,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:29:13,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:29:13,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:29:13,870 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:13,894 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:13,908 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:13,918 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:13,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:13,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:29:13,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:29:13,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:13,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:29:14,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,036 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,037 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:29:14,042 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:14,056 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:14,069 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:14,084 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:14,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:29:14,110 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-15 11:29:14,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 11:29:14,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:14,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:29:14,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:29:14,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 11:29:14,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:14,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:29:14,215 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 11:29:14,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:14,244 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:29:14,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-02-15 11:29:14,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:14,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:29:14,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-15 11:29:14,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:14,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:29:14,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:14,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:29:14,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-15 11:29:14,339 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:29:14,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 11:29:14,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 11:29:14,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:29:14,340 INFO L87 Difference]: Start difference. First operand 1964 states and 11590 transitions. Second operand 9 states. [2019-02-15 11:29:20,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:29:20,245 INFO L93 Difference]: Finished difference Result 2036 states and 11913 transitions. [2019-02-15 11:29:20,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:29:20,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-02-15 11:29:20,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:29:20,251 INFO L225 Difference]: With dead ends: 2036 [2019-02-15 11:29:20,251 INFO L226 Difference]: Without dead ends: 2033 [2019-02-15 11:29:20,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:29:20,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2019-02-15 11:29:26,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2012. [2019-02-15 11:29:26,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2019-02-15 11:29:26,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 11885 transitions. [2019-02-15 11:29:26,203 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 11885 transitions. Word has length 7 [2019-02-15 11:29:26,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:29:26,203 INFO L480 AbstractCegarLoop]: Abstraction has 2012 states and 11885 transitions. [2019-02-15 11:29:26,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 11:29:26,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 11885 transitions. [2019-02-15 11:29:26,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:29:26,206 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:29:26,206 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:29:26,206 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:29:26,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:29:26,206 INFO L82 PathProgramCache]: Analyzing trace with hash 2047765234, now seen corresponding path program 3 times [2019-02-15 11:29:26,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:29:26,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:26,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:29:26,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:26,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:29:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:29:26,273 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:29:26,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:29:26,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:29:26,274 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:29:26,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:29:26,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:29:26,274 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 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:29:26,283 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:29:26,283 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:29:26,297 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:29:26,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:29:26,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:29:26,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:26,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:29:26,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:26,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:26,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:29:26,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:26,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:26,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:26,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:26,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:29:26,372 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:26,385 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:26,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:26,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:29:26,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:29:26,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:29:26,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:29:26,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-15 11:29:26,450 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:26,467 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:26,480 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:26,490 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:26,499 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:26,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:29:26,519 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-15 11:29:26,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:26,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 60 [2019-02-15 11:29:26,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:29:26,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-02-15 11:29:26,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:75 [2019-02-15 11:29:26,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:26,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:26,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:26,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:26,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:26,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:26,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:26,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 80 [2019-02-15 11:29:26,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-15 11:29:26,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:26,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:26,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:26,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:26,863 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:29:26,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 59 [2019-02-15 11:29:26,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:26,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2019-02-15 11:29:26,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:96, output treesize:167 [2019-02-15 11:29:27,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 57 [2019-02-15 11:29:27,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:27,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-02-15 11:29:27,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:27,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,575 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:29:27,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-02-15 11:29:27,576 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:27,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,653 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:29:27,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 71 [2019-02-15 11:29:27,655 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:27,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-02-15 11:29:27,719 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:167, output treesize:115 [2019-02-15 11:29:27,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,788 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:29:27,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 55 [2019-02-15 11:29:27,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:27,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-02-15 11:29:27,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:27,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,951 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:29:27,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:27,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 67 [2019-02-15 11:29:27,953 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:28,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:28,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:28,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:28,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:28,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:28,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:28,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:28,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:28,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:28,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:28,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:28,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 93 [2019-02-15 11:29:28,029 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:28,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-02-15 11:29:28,096 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:155, output treesize:111 [2019-02-15 11:29:28,336 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-02-15 11:29:28,340 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:28,340 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:29:28,462 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:28,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:29:28,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 11:29:28,481 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:29:28,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:29:28,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:29:28,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:29:28,481 INFO L87 Difference]: Start difference. First operand 2012 states and 11885 transitions. Second operand 11 states. [2019-02-15 11:29:30,605 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-02-15 11:29:37,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:29:37,936 INFO L93 Difference]: Finished difference Result 2952 states and 17243 transitions. [2019-02-15 11:29:37,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:29:37,937 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-15 11:29:37,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:29:37,944 INFO L225 Difference]: With dead ends: 2952 [2019-02-15 11:29:37,944 INFO L226 Difference]: Without dead ends: 2951 [2019-02-15 11:29:37,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-02-15 11:29:37,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2019-02-15 11:29:43,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1726. [2019-02-15 11:29:43,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-02-15 11:29:43,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 10171 transitions. [2019-02-15 11:29:43,278 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 10171 transitions. Word has length 7 [2019-02-15 11:29:43,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:29:43,278 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 10171 transitions. [2019-02-15 11:29:43,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:29:43,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 10171 transitions. [2019-02-15 11:29:43,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:29:43,281 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:29:43,281 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:29:43,281 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:29:43,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:29:43,282 INFO L82 PathProgramCache]: Analyzing trace with hash 2035383838, now seen corresponding path program 1 times [2019-02-15 11:29:43,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:29:43,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:43,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:29:43,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:43,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:29:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:29:43,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:29:43,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:29:43,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:29:43,424 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:29:43,424 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [29] [2019-02-15 11:29:43,425 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:29:43,425 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:29:43,664 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:29:43,665 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:29:43,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:29:43,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:29:43,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:29:43,665 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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:29:43,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:29:43,678 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:29:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:29:43,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:29:43,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:29:43,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:43,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:43,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:29:43,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:43,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:43,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:43,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:43,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:29:43,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:43,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:43,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:43,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:43,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:43,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:43,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:29:43,779 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:43,794 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:43,806 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:43,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:43,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:29:43,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:29:43,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:29:43,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:29:43,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:29:43,855 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:43,875 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:43,887 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:43,896 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:43,905 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:43,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:29:43,932 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 11:29:43,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:43,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:29:43,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:29:44,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:29:44,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-02-15 11:29:44,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:44,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:44,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:44,120 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:29:44,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 59 [2019-02-15 11:29:44,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:44,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:44,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:44,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:44,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:44,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:44,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:44,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:44,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-02-15 11:29:44,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:44,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:29:44,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:112, output treesize:86 [2019-02-15 11:29:46,517 WARN L181 SmtUtils]: Spent 2.27 s on a formula simplification that was a NOOP. DAG size: 55 [2019-02-15 11:29:46,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:46,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:29:46,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:46,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:29:46,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-02-15 11:29:46,565 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:29:46,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:29:46,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:29:46,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-02-15 11:29:46,565 INFO L87 Difference]: Start difference. First operand 1726 states and 10171 transitions. Second operand 10 states. [2019-02-15 11:29:46,806 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-02-15 11:29:46,960 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-02-15 11:29:47,270 WARN L181 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-02-15 11:29:53,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:29:53,046 INFO L93 Difference]: Finished difference Result 1903 states and 11093 transitions. [2019-02-15 11:29:53,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:29:53,046 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 11:29:53,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:29:53,051 INFO L225 Difference]: With dead ends: 1903 [2019-02-15 11:29:53,051 INFO L226 Difference]: Without dead ends: 1896 [2019-02-15 11:29:53,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:29:53,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-02-15 11:29:58,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1875. [2019-02-15 11:29:58,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2019-02-15 11:29:58,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 11063 transitions. [2019-02-15 11:29:58,942 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 11063 transitions. Word has length 7 [2019-02-15 11:29:58,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:29:58,942 INFO L480 AbstractCegarLoop]: Abstraction has 1875 states and 11063 transitions. [2019-02-15 11:29:58,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:29:58,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 11063 transitions. [2019-02-15 11:29:58,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:29:58,945 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:29:58,945 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:29:58,945 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:29:58,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:29:58,945 INFO L82 PathProgramCache]: Analyzing trace with hash -2145066854, now seen corresponding path program 2 times [2019-02-15 11:29:58,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:29:58,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:58,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:29:58,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:58,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:29:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:29:59,162 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 16 [2019-02-15 11:29:59,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:29:59,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:29:59,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:29:59,180 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:29:59,180 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:29:59,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:29:59,180 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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:29:59,188 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:29:59,188 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:29:59,192 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-15 11:29:59,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:29:59,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:29:59,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:29:59,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:29:59,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:59,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:59,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:29:59,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:59,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:59,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:59,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:29:59,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:59,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:59,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:59,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:59,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:29:59,224 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:59,249 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:59,262 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:59,273 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:59,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:59,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:29:59,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:59,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:59,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:29:59,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:59,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:59,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:59,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:59,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:29:59,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:59,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:59,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:59,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:59,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:59,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:59,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:29:59,409 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:59,423 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:59,436 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:59,451 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:59,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:29:59,477 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 11:29:59,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:59,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 11:29:59,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:59,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:29:59,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 11:29:59,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:59,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:59,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:59,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:59,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:59,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:59,554 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:29:59,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 11:29:59,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:29:59,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:29:59,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-02-15 11:29:59,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:59,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:29:59,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:59,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:29:59,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:29:59,728 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:29:59,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:29:59,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:29:59,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:29:59,728 INFO L87 Difference]: Start difference. First operand 1875 states and 11063 transitions. Second operand 8 states. [2019-02-15 11:30:05,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:30:05,418 INFO L93 Difference]: Finished difference Result 1884 states and 11081 transitions. [2019-02-15 11:30:05,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:30:05,419 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-15 11:30:05,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:30:05,423 INFO L225 Difference]: With dead ends: 1884 [2019-02-15 11:30:05,424 INFO L226 Difference]: Without dead ends: 1877 [2019-02-15 11:30:05,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:30:05,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2019-02-15 11:30:11,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1877. [2019-02-15 11:30:11,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2019-02-15 11:30:11,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 11071 transitions. [2019-02-15 11:30:11,420 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 11071 transitions. Word has length 7 [2019-02-15 11:30:11,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:30:11,421 INFO L480 AbstractCegarLoop]: Abstraction has 1877 states and 11071 transitions. [2019-02-15 11:30:11,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:30:11,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 11071 transitions. [2019-02-15 11:30:11,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:30:11,423 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:30:11,424 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:30:11,424 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:30:11,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:30:11,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1861574920, now seen corresponding path program 1 times [2019-02-15 11:30:11,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:30:11,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:30:11,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:30:11,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:30:11,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:30:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:30:11,526 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:30:11,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:30:11,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:30:11,526 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 11:30:11,527 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [28], [29] [2019-02-15 11:30:11,527 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:30:11,528 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:30:11,812 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:30:11,813 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:30:11,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:30:11,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:30:11,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:30:11,813 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 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:30:11,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:30:11,822 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:30:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:30:11,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:30:11,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:30:11,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:11,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:11,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:30:11,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:11,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:11,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:11,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:11,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:30:11,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:11,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:11,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:11,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:11,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:11,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:11,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:30:11,944 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:30:11,961 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:11,978 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:11,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:12,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:30:12,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:30:12,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:30:12,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:30:12,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:30:12,068 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:30:12,088 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:12,100 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:12,109 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:12,118 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:12,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:30:12,144 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 11:30:12,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-15 11:30:12,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:30:12,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:30:12,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-02-15 11:30:12,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2019-02-15 11:30:12,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:30:12,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:30:12,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-02-15 11:30:12,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:12,281 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:30:12,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 94 [2019-02-15 11:30:12,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:30:12,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:30:12,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:64 [2019-02-15 11:30:12,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:30:12,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:30:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:30:12,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:30:12,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-15 11:30:12,463 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:30:12,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:30:12,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:30:12,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:30:12,464 INFO L87 Difference]: Start difference. First operand 1877 states and 11071 transitions. Second operand 11 states. [2019-02-15 11:30:21,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:30:21,558 INFO L93 Difference]: Finished difference Result 2991 states and 17341 transitions. [2019-02-15 11:30:21,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:30:21,559 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-15 11:30:21,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:30:21,566 INFO L225 Difference]: With dead ends: 2991 [2019-02-15 11:30:21,566 INFO L226 Difference]: Without dead ends: 2978 [2019-02-15 11:30:21,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:30:21,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2019-02-15 11:30:29,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2350. [2019-02-15 11:30:29,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2350 states. [2019-02-15 11:30:29,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 13866 transitions. [2019-02-15 11:30:29,531 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 13866 transitions. Word has length 8 [2019-02-15 11:30:29,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:30:29,531 INFO L480 AbstractCegarLoop]: Abstraction has 2350 states and 13866 transitions. [2019-02-15 11:30:29,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:30:29,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 13866 transitions. [2019-02-15 11:30:29,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:30:29,534 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:30:29,534 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:30:29,535 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:30:29,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:30:29,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1861146186, now seen corresponding path program 1 times [2019-02-15 11:30:29,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:30:29,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:30:29,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:30:29,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:30:29,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:30:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:30:29,623 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:30:29,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:30:29,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:30:29,623 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 11:30:29,623 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [25] [2019-02-15 11:30:29,624 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:30:29,624 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:30:30,035 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:30:30,035 INFO L272 AbstractInterpreter]: Visited 8 different actions 14 times. Merged at 1 different actions 1 times. Never widened. Found 10 fixpoints after 6 different actions. Largest state had 0 variables. [2019-02-15 11:30:30,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:30:30,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:30:30,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:30:30,036 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 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:30:30,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:30:30,045 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:30:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:30:30,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:30:30,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 11:30:30,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:30:30,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:30:30,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:30:30,190 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:30:30,206 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:30,220 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:30,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:30,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:30:30,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:30:30,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:30:30,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:30:30,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 11:30:30,267 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:30:30,290 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:30,303 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:30,313 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:30,323 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:30,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:30:30,351 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-02-15 11:30:30,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 11:30:30,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:30:30,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:30:30,413 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-02-15 11:30:30,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-02-15 11:30:30,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:30:30,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:30:30,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-15 11:30:30,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,513 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:30:30,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-02-15 11:30:30,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:30:30,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:30:30,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-02-15 11:30:30,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,593 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:30:30,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-02-15 11:30:30,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:30:30,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:30:30,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:34 [2019-02-15 11:30:30,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:30:30,663 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:30:30,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-02-15 11:30:30,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:30:30,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:30:30,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-02-15 11:30:30,719 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:30:30,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:30:31,526 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:30:31,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:30:31,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-02-15 11:30:31,552 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:30:31,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-15 11:30:31,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-15 11:30:31,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2019-02-15 11:30:31,553 INFO L87 Difference]: Start difference. First operand 2350 states and 13866 transitions. Second operand 14 states. [2019-02-15 11:30:42,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:30:42,085 INFO L93 Difference]: Finished difference Result 3181 states and 18621 transitions. [2019-02-15 11:30:42,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:30:42,086 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-02-15 11:30:42,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:30:42,094 INFO L225 Difference]: With dead ends: 3181 [2019-02-15 11:30:42,094 INFO L226 Difference]: Without dead ends: 3179 [2019-02-15 11:30:42,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=188, Invalid=364, Unknown=0, NotChecked=0, Total=552 [2019-02-15 11:30:42,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2019-02-15 11:30:49,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 2326. [2019-02-15 11:30:49,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-02-15 11:30:49,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13718 transitions. [2019-02-15 11:30:49,799 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13718 transitions. Word has length 8 [2019-02-15 11:30:49,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:30:49,800 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13718 transitions. [2019-02-15 11:30:49,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-15 11:30:49,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13718 transitions. [2019-02-15 11:30:49,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:30:49,804 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:30:49,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:30:49,805 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:30:49,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:30:49,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1477451752, now seen corresponding path program 1 times [2019-02-15 11:30:49,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:30:49,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:30:49,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:30:49,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:30:49,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:30:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:30:49,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 11:30:49,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:30:49,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-15 11:30:49,862 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:30:49,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-15 11:30:49,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-15 11:30:49,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-02-15 11:30:49,863 INFO L87 Difference]: Start difference. First operand 2326 states and 13718 transitions. Second operand 5 states. [2019-02-15 11:30:56,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:30:56,991 INFO L93 Difference]: Finished difference Result 2346 states and 13737 transitions. [2019-02-15 11:30:56,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 11:30:56,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-02-15 11:30:56,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:30:56,997 INFO L225 Difference]: With dead ends: 2346 [2019-02-15 11:30:56,997 INFO L226 Difference]: Without dead ends: 2337 [2019-02-15 11:30:56,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-02-15 11:30:57,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2019-02-15 11:31:04,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2326. [2019-02-15 11:31:04,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-02-15 11:31:04,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13543 transitions. [2019-02-15 11:31:04,639 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13543 transitions. Word has length 8 [2019-02-15 11:31:04,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:31:04,639 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13543 transitions. [2019-02-15 11:31:04,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-15 11:31:04,639 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13543 transitions. [2019-02-15 11:31:04,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:31:04,643 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:31:04,643 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:31:04,643 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:31:04,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:31:04,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 2 times [2019-02-15 11:31:04,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:31:04,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:31:04,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:31:04,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:31:04,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:31:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:31:04,757 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:31:04,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:31:04,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:31:04,757 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:31:04,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:31:04,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:31:04,758 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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:31:04,766 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:31:04,766 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:31:04,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-15 11:31:04,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:31:04,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:31:04,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 11:31:04,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:31:04,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:31:04,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:04,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:31:04,933 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:04,949 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:04,964 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:04,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:05,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:31:05,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:31:05,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:31:05,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:31:05,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 11:31:05,011 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:05,033 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:05,046 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:05,057 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:05,066 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:05,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:05,094 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-02-15 11:31:05,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 11:31:05,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:05,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:05,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-02-15 11:31:05,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 11:31:05,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:05,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:05,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-15 11:31:05,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,509 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:31:05,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,532 INFO L303 Elim1Store]: Index analysis took 266 ms [2019-02-15 11:31:05,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-02-15 11:31:05,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:05,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:05,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:34 [2019-02-15 11:31:05,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,814 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:31:05,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-02-15 11:31:05,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:05,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:05,847 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 11:31:05,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:05,881 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:31:05,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-02-15 11:31:05,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:05,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:05,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-02-15 11:31:05,942 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:31:05,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:31:06,027 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:31:06,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:31:06,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-02-15 11:31:06,046 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:31:06,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-15 11:31:06,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-15 11:31:06,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-02-15 11:31:06,047 INFO L87 Difference]: Start difference. First operand 2326 states and 13543 transitions. Second operand 14 states. [2019-02-15 11:31:14,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:31:14,051 INFO L93 Difference]: Finished difference Result 2345 states and 13559 transitions. [2019-02-15 11:31:14,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:31:14,052 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-02-15 11:31:14,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:31:14,057 INFO L225 Difference]: With dead ends: 2345 [2019-02-15 11:31:14,057 INFO L226 Difference]: Without dead ends: 2338 [2019-02-15 11:31:14,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2019-02-15 11:31:14,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2019-02-15 11:31:16,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 473. [2019-02-15 11:31:16,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-02-15 11:31:16,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 2593 transitions. [2019-02-15 11:31:16,190 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 2593 transitions. Word has length 8 [2019-02-15 11:31:16,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:31:16,190 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 2593 transitions. [2019-02-15 11:31:16,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-15 11:31:16,190 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 2593 transitions. [2019-02-15 11:31:16,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:31:16,191 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:31:16,191 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-02-15 11:31:16,192 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:31:16,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:31:16,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1700463206, now seen corresponding path program 1 times [2019-02-15 11:31:16,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:31:16,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:31:16,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:31:16,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:31:16,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:31:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:31:16,242 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:31:16,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:31:16,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:31:16,243 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 11:31:16,243 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [27] [2019-02-15 11:31:16,244 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:31:16,244 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:31:16,514 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:31:16,515 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:31:16,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:31:16,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:31:16,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:31:16,515 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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:31:16,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:31:16,526 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:31:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:31:16,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:31:16,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:31:16,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:31:16,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:31:16,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:31:16,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-15 11:31:16,566 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:16,584 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:16,596 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:16,607 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:16,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:16,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-15 11:31:16,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-15 11:31:16,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,790 INFO L303 Elim1Store]: Index analysis took 118 ms [2019-02-15 11:31:16,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 11:31:16,791 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:16,834 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:16,843 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:16,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:16,861 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-02-15 11:31:16,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-15 11:31:16,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:16,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:16,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-02-15 11:31:16,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:31:16,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:16,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:16,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:18 [2019-02-15 11:31:16,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 60 [2019-02-15 11:31:16,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:16,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:16,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:16 [2019-02-15 11:31:16,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:16,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 62 [2019-02-15 11:31:16,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:17,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:17,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2019-02-15 11:31:17,020 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:31:17,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:31:17,061 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:31:17,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:31:17,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-15 11:31:17,080 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:31:17,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:31:17,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:31:17,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:31:17,081 INFO L87 Difference]: Start difference. First operand 473 states and 2593 transitions. Second operand 11 states. [2019-02-15 11:31:19,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:31:19,376 INFO L93 Difference]: Finished difference Result 480 states and 2609 transitions. [2019-02-15 11:31:19,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:31:19,376 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-15 11:31:19,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:31:19,378 INFO L225 Difference]: With dead ends: 480 [2019-02-15 11:31:19,379 INFO L226 Difference]: Without dead ends: 477 [2019-02-15 11:31:19,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:31:19,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-02-15 11:31:20,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 158. [2019-02-15 11:31:20,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-02-15 11:31:20,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 805 transitions. [2019-02-15 11:31:20,312 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 805 transitions. Word has length 8 [2019-02-15 11:31:20,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:31:20,312 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 805 transitions. [2019-02-15 11:31:20,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:31:20,313 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 805 transitions. [2019-02-15 11:31:20,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:31:20,313 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:31:20,313 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:31:20,313 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:31:20,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:31:20,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1702729308, now seen corresponding path program 1 times [2019-02-15 11:31:20,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:31:20,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:31:20,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:31:20,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:31:20,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:31:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:31:20,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:31:20,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:31:20,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:31:20,366 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 11:31:20,366 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [28], [29] [2019-02-15 11:31:20,367 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:31:20,367 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:31:20,650 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:31:20,651 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:31:20,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:31:20,651 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:31:20,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:31:20,651 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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:31:20,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:31:20,661 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:31:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:31:20,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:31:20,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:31:20,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:31:20,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:20,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:20,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:31:20,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:20,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:20,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:20,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:31:20,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:20,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:20,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:20,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:20,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:31:20,711 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:20,736 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:20,748 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:20,756 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:20,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:20,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:31:20,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:20,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:20,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:31:20,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:20,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:20,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:20,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:20,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:31:20,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:20,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:20,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:20,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:20,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:20,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:20,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:31:20,890 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:20,904 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:20,918 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:20,933 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:20,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:20,959 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 11:31:20,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:20,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:31:20,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:21,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:21,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:31:21,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:21,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:21,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:21,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:21,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:21,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:21,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 11:31:21,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:21,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:21,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 11:31:21,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:21,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:21,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:21,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:21,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:21,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:21,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:21,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:21,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:21,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:21,083 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:31:21,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-02-15 11:31:21,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:21,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:21,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-15 11:31:21,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:31:21,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:31:21,165 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:31:21,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:31:21,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-15 11:31:21,184 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:31:21,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 11:31:21,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 11:31:21,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:31:21,185 INFO L87 Difference]: Start difference. First operand 158 states and 805 transitions. Second operand 9 states. [2019-02-15 11:31:23,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:31:23,080 INFO L93 Difference]: Finished difference Result 250 states and 1244 transitions. [2019-02-15 11:31:23,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:31:23,080 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-15 11:31:23,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:31:23,081 INFO L225 Difference]: With dead ends: 250 [2019-02-15 11:31:23,082 INFO L226 Difference]: Without dead ends: 243 [2019-02-15 11:31:23,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:31:23,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-02-15 11:31:24,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 217. [2019-02-15 11:31:24,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-02-15 11:31:24,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 1122 transitions. [2019-02-15 11:31:24,600 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 1122 transitions. Word has length 8 [2019-02-15 11:31:24,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:31:24,600 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 1122 transitions. [2019-02-15 11:31:24,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 11:31:24,600 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 1122 transitions. [2019-02-15 11:31:24,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:31:24,601 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:31:24,601 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:31:24,601 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:31:24,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:31:24,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1689800014, now seen corresponding path program 1 times [2019-02-15 11:31:24,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:31:24,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:31:24,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:31:24,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:31:24,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:31:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:31:24,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:31:24,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:31:24,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:31:24,689 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 11:31:24,689 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [28], [29] [2019-02-15 11:31:24,689 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:31:24,690 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:31:24,959 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:31:24,959 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:31:24,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:31:24,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:31:24,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:31:24,960 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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:31:24,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:31:24,968 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:31:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:31:24,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:31:24,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:31:24,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:31:24,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:24,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:24,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:31:24,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:24,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:24,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:24,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:31:25,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-15 11:31:25,002 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:25,017 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:25,029 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:25,039 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:25,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:25,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-15 11:31:25,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-15 11:31:25,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 11:31:25,106 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:25,114 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:25,122 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:25,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:25,140 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-02-15 11:31:25,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-15 11:31:25,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:25,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:25,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-02-15 11:31:25,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:31:25,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:25,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:25,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-02-15 11:31:25,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:25,230 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:31:25,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 56 [2019-02-15 11:31:25,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:25,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:25,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-02-15 11:31:25,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:31:25,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:31:25,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:31:25,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:31:25,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:31:25,309 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:31:25,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:31:25,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:31:25,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:31:25,309 INFO L87 Difference]: Start difference. First operand 217 states and 1122 transitions. Second operand 10 states. [2019-02-15 11:31:28,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:31:28,424 INFO L93 Difference]: Finished difference Result 372 states and 1862 transitions. [2019-02-15 11:31:28,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:31:28,425 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-15 11:31:28,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:31:28,427 INFO L225 Difference]: With dead ends: 372 [2019-02-15 11:31:28,427 INFO L226 Difference]: Without dead ends: 362 [2019-02-15 11:31:28,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:31:28,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-02-15 11:31:30,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 274. [2019-02-15 11:31:30,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-02-15 11:31:30,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 1432 transitions. [2019-02-15 11:31:30,738 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 1432 transitions. Word has length 8 [2019-02-15 11:31:30,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:31:30,738 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 1432 transitions. [2019-02-15 11:31:30,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:31:30,738 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 1432 transitions. [2019-02-15 11:31:30,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:31:30,739 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:31:30,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:31:30,740 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:31:30,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:31:30,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1048110876, now seen corresponding path program 2 times [2019-02-15 11:31:30,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:31:30,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:31:30,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:31:30,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:31:30,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:31:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:31:30,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:31:30,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:31:30,826 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:31:30,826 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:31:30,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:31:30,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:31:30,826 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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:31:30,835 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:31:30,835 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:31:30,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:31:30,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:31:30,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:31:30,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:31:30,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:31:30,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:30,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:30,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:31:30,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:30,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:30,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:30,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:31:30,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:30,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:30,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:30,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:30,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:31:30,883 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:30,907 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:30,920 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:30,930 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:30,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:30,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:31:30,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:30,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:30,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:31:31,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:31,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:31,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:31,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:31,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:31:31,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:31,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:31,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:31,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:31,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:31,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:31,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:31:31,052 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:31,066 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:31,079 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:31,094 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:31,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:31,120 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 11:31:31,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:31,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 11:31:31,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:31,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:31,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 11:31:31,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:31,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:31,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:31,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:31,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:31,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:31,194 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:31:31,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 11:31:31,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:31:31,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:31:31,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-02-15 11:31:31,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:31,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:31,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:31,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:31,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:31,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:31,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:31,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:31:31,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:31,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:31,346 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2019-02-15 11:31:31,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:31:31,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:31:31,413 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:31:31,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:31:31,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:31:31,431 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:31:31,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:31:31,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:31:31,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:31:31,432 INFO L87 Difference]: Start difference. First operand 274 states and 1432 transitions. Second operand 10 states. [2019-02-15 11:31:34,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:31:34,359 INFO L93 Difference]: Finished difference Result 332 states and 1700 transitions. [2019-02-15 11:31:34,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:31:34,359 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-15 11:31:34,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:31:34,361 INFO L225 Difference]: With dead ends: 332 [2019-02-15 11:31:34,361 INFO L226 Difference]: Without dead ends: 325 [2019-02-15 11:31:34,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:31:34,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-02-15 11:31:36,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 285. [2019-02-15 11:31:36,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-02-15 11:31:36,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 1489 transitions. [2019-02-15 11:31:36,773 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 1489 transitions. Word has length 8 [2019-02-15 11:31:36,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:31:36,773 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 1489 transitions. [2019-02-15 11:31:36,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:31:36,773 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 1489 transitions. [2019-02-15 11:31:36,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:31:36,774 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:31:36,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:31:36,774 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:31:36,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:31:36,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1051804960, now seen corresponding path program 1 times [2019-02-15 11:31:36,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:31:36,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:31:36,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:31:36,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:31:36,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:31:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:31:36,837 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:31:36,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:31:36,837 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:31:36,837 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 11:31:36,837 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [26], [28], [29] [2019-02-15 11:31:36,838 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:31:36,838 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:31:37,452 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:31:37,452 INFO L272 AbstractInterpreter]: Visited 8 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:31:37,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:31:37,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:31:37,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:31:37,452 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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:31:37,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:31:37,461 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:31:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:31:37,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:31:37,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:31:37,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:37,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:37,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:31:37,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:37,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:37,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:37,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:37,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:31:37,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:37,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:37,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:37,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:37,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:37,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:37,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:31:37,567 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:37,582 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:37,596 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:37,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:37,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:31:37,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:31:37,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:31:37,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:31:37,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:31:37,644 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:37,663 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:37,675 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:37,684 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:37,693 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:37,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:37,719 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-15 11:31:37,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:37,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 11:31:37,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:37,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:37,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:31:37,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:37,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:37,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:37,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:37,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:37,805 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:31:37,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-15 11:31:37,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:37,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:37,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-15 11:31:37,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:37,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:37,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:37,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:37,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:37,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:37,849 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:31:37,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-15 11:31:37,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:37,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:37,870 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-15 11:31:37,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:31:37,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:31:37,931 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:31:37,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:31:37,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:31:37,950 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:31:37,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:31:37,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:31:37,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:31:37,950 INFO L87 Difference]: Start difference. First operand 285 states and 1489 transitions. Second operand 10 states. [2019-02-15 11:31:40,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:31:40,567 INFO L93 Difference]: Finished difference Result 294 states and 1507 transitions. [2019-02-15 11:31:40,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:31:40,567 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-15 11:31:40,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:31:40,568 INFO L225 Difference]: With dead ends: 294 [2019-02-15 11:31:40,568 INFO L226 Difference]: Without dead ends: 287 [2019-02-15 11:31:40,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:31:40,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-02-15 11:31:42,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2019-02-15 11:31:42,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-02-15 11:31:42,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1484 transitions. [2019-02-15 11:31:42,966 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1484 transitions. Word has length 8 [2019-02-15 11:31:42,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:31:42,967 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1484 transitions. [2019-02-15 11:31:42,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:31:42,967 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1484 transitions. [2019-02-15 11:31:42,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:31:42,967 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:31:42,967 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:31:42,968 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:31:42,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:31:42,968 INFO L82 PathProgramCache]: Analyzing trace with hash -944676524, now seen corresponding path program 1 times [2019-02-15 11:31:42,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:31:42,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:31:42,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:31:42,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:31:42,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:31:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:31:43,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:31:43,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:31:43,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:31:43,065 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 11:31:43,066 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [26], [28], [29] [2019-02-15 11:31:43,067 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:31:43,067 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:31:43,677 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:31:43,677 INFO L272 AbstractInterpreter]: Visited 8 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:31:43,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:31:43,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:31:43,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:31:43,678 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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:31:43,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:31:43,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:31:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:31:43,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:31:43,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:31:43,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:31:43,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:43,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:43,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:31:43,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:43,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:43,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:43,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:31:43,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:43,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:43,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:43,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:43,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:31:43,718 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:43,742 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:43,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:43,766 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:43,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:43,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:31:43,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:43,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:43,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:31:43,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:43,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:43,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:43,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:43,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:31:43,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:43,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:43,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:43,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:43,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:43,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:43,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:31:43,888 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:43,901 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:43,914 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:43,929 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:43,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:43,955 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-15 11:31:43,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:43,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 11:31:43,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:44,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:44,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-02-15 11:31:44,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:44,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:44,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:44,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:44,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:44,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:44,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:44,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 11:31:44,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:31:44,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:31:44,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:74 [2019-02-15 11:31:44,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:44,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:44,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:44,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:44,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:44,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:44,262 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:31:44,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:44,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 69 [2019-02-15 11:31:44,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:44,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:44,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:44,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:44,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:44,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:44,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:44,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:44,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:44,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:44,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:44,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:44,323 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:31:44,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-02-15 11:31:44,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:44,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:31:44,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:92, output treesize:70 [2019-02-15 11:31:44,426 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:31:44,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:31:44,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:31:44,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:31:44,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-15 11:31:44,480 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:31:44,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:31:44,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:31:44,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:31:44,481 INFO L87 Difference]: Start difference. First operand 284 states and 1484 transitions. Second operand 11 states. [2019-02-15 11:31:44,752 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-02-15 11:31:45,010 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2019-02-15 11:31:48,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:31:48,115 INFO L93 Difference]: Finished difference Result 364 states and 1818 transitions. [2019-02-15 11:31:48,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:31:48,115 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-15 11:31:48,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:31:48,117 INFO L225 Difference]: With dead ends: 364 [2019-02-15 11:31:48,117 INFO L226 Difference]: Without dead ends: 357 [2019-02-15 11:31:48,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2019-02-15 11:31:48,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-02-15 11:31:50,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 283. [2019-02-15 11:31:50,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-02-15 11:31:50,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 1479 transitions. [2019-02-15 11:31:50,647 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 1479 transitions. Word has length 8 [2019-02-15 11:31:50,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:31:50,647 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 1479 transitions. [2019-02-15 11:31:50,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:31:50,647 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 1479 transitions. [2019-02-15 11:31:50,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:31:50,648 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:31:50,648 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:31:50,648 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:31:50,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:31:50,648 INFO L82 PathProgramCache]: Analyzing trace with hash -937288356, now seen corresponding path program 1 times [2019-02-15 11:31:50,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:31:50,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:31:50,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:31:50,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:31:50,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:31:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:31:50,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:31:50,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:31:50,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:31:50,754 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 11:31:50,754 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [26], [28], [29] [2019-02-15 11:31:50,755 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:31:50,755 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:31:51,425 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:31:51,425 INFO L272 AbstractInterpreter]: Visited 8 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:31:51,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:31:51,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:31:51,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:31:51,425 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 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:31:51,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:31:51,433 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:31:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:31:51,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:31:51,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:31:51,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:31:51,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:31:51,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:31:51,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:31:51,473 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:51,498 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:51,511 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:51,522 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:51,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:51,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:31:51,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:31:51,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:31:51,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:31:51,645 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:51,659 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:51,672 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:51,687 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:51,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:51,713 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-15 11:31:51,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 11:31:51,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:51,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:51,775 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:31:51,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-02-15 11:31:51,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:51,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:51,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-02-15 11:31:51,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:51,846 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:31:51,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 11:31:51,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:51,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:51,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-15 11:31:51,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:31:51,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:31:51,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:31:51,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:31:51,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-15 11:31:51,936 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:31:51,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 11:31:51,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 11:31:51,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:31:51,937 INFO L87 Difference]: Start difference. First operand 283 states and 1479 transitions. Second operand 9 states. [2019-02-15 11:31:54,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:31:54,975 INFO L93 Difference]: Finished difference Result 319 states and 1617 transitions. [2019-02-15 11:31:54,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:31:54,975 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-15 11:31:54,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:31:54,977 INFO L225 Difference]: With dead ends: 319 [2019-02-15 11:31:54,977 INFO L226 Difference]: Without dead ends: 312 [2019-02-15 11:31:54,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:31:54,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-02-15 11:31:57,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 304. [2019-02-15 11:31:57,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-02-15 11:31:57,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 1600 transitions. [2019-02-15 11:31:57,907 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 1600 transitions. Word has length 8 [2019-02-15 11:31:57,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:31:57,907 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 1600 transitions. [2019-02-15 11:31:57,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 11:31:57,907 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 1600 transitions. [2019-02-15 11:31:57,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:31:57,908 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:31:57,908 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:31:57,908 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:31:57,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:31:57,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1115262138, now seen corresponding path program 1 times [2019-02-15 11:31:57,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:31:57,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:31:57,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:31:57,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:31:57,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:31:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:31:58,009 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 11:31:58,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:31:58,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:31:58,010 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 11:31:58,010 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [29] [2019-02-15 11:31:58,011 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:31:58,011 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:31:58,276 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:31:58,276 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:31:58,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:31:58,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:31:58,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:31:58,276 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 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:31:58,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:31:58,284 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:31:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:31:58,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:31:58,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:31:58,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:31:58,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:31:58,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:31:58,403 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:58,420 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:58,436 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:58,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:58,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:31:58,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:31:58,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:31:58,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:31:58,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:31:58,492 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:58,513 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:58,524 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:58,534 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:58,543 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:31:58,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:31:58,569 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-15 11:31:58,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:31:58,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:31:58,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-15 11:31:58,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-02-15 11:31:58,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 67 [2019-02-15 11:31:58,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:58,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-02-15 11:31:58,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:58,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:31:58,893 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:68 [2019-02-15 11:31:58,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,942 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:31:58,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-02-15 11:31:58,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:58,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:58,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:59,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:59,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:59,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:59,003 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:31:59,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:31:59,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 65 [2019-02-15 11:31:59,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:31:59,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:31:59,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-02-15 11:32:07,097 WARN L181 SmtUtils]: Spent 8.03 s on a formula simplification that was a NOOP. DAG size: 49 [2019-02-15 11:32:07,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:32:07,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:32:07,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:32:07,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:32:07,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-15 11:32:07,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:32:07,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:32:07,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:32:07,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:32:07,158 INFO L87 Difference]: Start difference. First operand 304 states and 1600 transitions. Second operand 11 states. [2019-02-15 11:32:08,483 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-02-15 11:32:11,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:32:11,488 INFO L93 Difference]: Finished difference Result 392 states and 1929 transitions. [2019-02-15 11:32:11,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:32:11,488 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-15 11:32:11,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:32:11,490 INFO L225 Difference]: With dead ends: 392 [2019-02-15 11:32:11,490 INFO L226 Difference]: Without dead ends: 386 [2019-02-15 11:32:11,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2019-02-15 11:32:11,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-02-15 11:32:14,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 315. [2019-02-15 11:32:14,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-02-15 11:32:14,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 1665 transitions. [2019-02-15 11:32:14,617 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 1665 transitions. Word has length 8 [2019-02-15 11:32:14,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:32:14,618 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 1665 transitions. [2019-02-15 11:32:14,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:32:14,618 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 1665 transitions. [2019-02-15 11:32:14,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:32:14,618 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:32:14,619 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:32:14,619 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:32:14,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:32:14,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2019-02-15 11:32:14,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:32:14,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:32:14,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:32:14,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:32:14,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:32:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:32:14,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 11:32:14,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:32:14,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-15 11:32:14,683 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:32:14,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-15 11:32:14,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-15 11:32:14,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-02-15 11:32:14,683 INFO L87 Difference]: Start difference. First operand 315 states and 1665 transitions. Second operand 5 states. [2019-02-15 11:32:17,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:32:17,662 INFO L93 Difference]: Finished difference Result 320 states and 1669 transitions. [2019-02-15 11:32:17,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:32:17,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-02-15 11:32:17,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:32:17,664 INFO L225 Difference]: With dead ends: 320 [2019-02-15 11:32:17,664 INFO L226 Difference]: Without dead ends: 315 [2019-02-15 11:32:17,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-02-15 11:32:17,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-02-15 11:32:20,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 314. [2019-02-15 11:32:20,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-02-15 11:32:20,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 1654 transitions. [2019-02-15 11:32:20,794 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 1654 transitions. Word has length 8 [2019-02-15 11:32:20,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:32:20,794 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 1654 transitions. [2019-02-15 11:32:20,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-15 11:32:20,795 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 1654 transitions. [2019-02-15 11:32:20,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 11:32:20,795 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:32:20,795 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:32:20,795 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:32:20,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:32:20,796 INFO L82 PathProgramCache]: Analyzing trace with hash 95484720, now seen corresponding path program 3 times [2019-02-15 11:32:20,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:32:20,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:32:20,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:32:20,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:32:20,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:32:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:32:20,870 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:32:20,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:32:20,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:32:20,870 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:32:20,870 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:32:20,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:32:20,871 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 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:32:20,878 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:32:20,878 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:32:20,883 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:32:20,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:32:20,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:32:20,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:32:20,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:20,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:20,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:32:20,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:20,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:20,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:20,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:20,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:32:20,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:20,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:20,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:20,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:20,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:20,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:20,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:32:20,981 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:32:20,995 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:21,009 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:21,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:21,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:32:21,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:32:21,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:32:21,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:32:21,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:32:21,058 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:32:21,077 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:21,089 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:21,098 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:21,107 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:21,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:32:21,134 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 11:32:21,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:21,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-15 11:32:21,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:32:21,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:32:21,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-02-15 11:32:21,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:21,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:21,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:21,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:21,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:21,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:21,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:21,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 74 [2019-02-15 11:32:21,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:32:21,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:32:21,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:46 [2019-02-15 11:32:21,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:21,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:21,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:21,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:21,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:21,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:21,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:21,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 11:32:21,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:32:21,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:32:21,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:68 [2019-02-15 11:32:21,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:21,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:21,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:21,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:21,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:21,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:21,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:21,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:21,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:21,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:21,491 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:32:21,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-02-15 11:32:21,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:32:21,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:32:21,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-15 11:32:21,533 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:32:21,533 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:32:21,594 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:32:21,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:32:21,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 11:32:21,613 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:32:21,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:32:21,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:32:21,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:32:21,614 INFO L87 Difference]: Start difference. First operand 314 states and 1654 transitions. Second operand 12 states. [2019-02-15 11:32:27,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:32:27,930 INFO L93 Difference]: Finished difference Result 601 states and 3111 transitions. [2019-02-15 11:32:27,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:32:27,931 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-15 11:32:27,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:32:27,932 INFO L225 Difference]: With dead ends: 601 [2019-02-15 11:32:27,932 INFO L226 Difference]: Without dead ends: 591 [2019-02-15 11:32:27,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-02-15 11:32:27,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-02-15 11:32:33,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 448. [2019-02-15 11:32:33,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-02-15 11:32:33,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 2380 transitions. [2019-02-15 11:32:33,118 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 2380 transitions. Word has length 9 [2019-02-15 11:32:33,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:32:33,118 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 2380 transitions. [2019-02-15 11:32:33,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:32:33,118 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 2380 transitions. [2019-02-15 11:32:33,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 11:32:33,119 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:32:33,119 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:32:33,119 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:32:33,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:32:33,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1988764338, now seen corresponding path program 1 times [2019-02-15 11:32:33,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:32:33,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:32:33,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:32:33,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:32:33,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:32:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:32:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:32:33,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:32:33,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:32:33,345 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 11:32:33,345 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [30], [31] [2019-02-15 11:32:33,346 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:32:33,347 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:32:33,633 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:32:33,633 INFO L272 AbstractInterpreter]: Visited 9 different actions 13 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:32:33,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:32:33,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:32:33,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:32:33,633 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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:32:33,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:32:33,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:32:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:32:33,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:32:33,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:32:33,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:33,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:33,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:32:33,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:33,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:33,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:33,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:33,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:32:33,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:33,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:33,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:33,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:33,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:33,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:33,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:32:33,758 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:32:33,772 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:33,789 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:33,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:33,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:32:33,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:32:33,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:32:33,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:32:33,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:32:33,845 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:32:33,865 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:33,876 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:33,886 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:33,895 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:33,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:32:33,921 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 11:32:33,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:33,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-15 11:32:33,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:32:33,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:32:33,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 11:32:33,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:33,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:33,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:34,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:34,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:34,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:34,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:34,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2019-02-15 11:32:34,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:32:34,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:32:34,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-02-15 11:32:34,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:34,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:34,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:34,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:34,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:34,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:34,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:34,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:34,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:34,064 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:32:34,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:34,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 93 [2019-02-15 11:32:34,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:32:34,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:32:34,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:64 [2019-02-15 11:32:34,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:32:34,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:32:34,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:32:34,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:32:34,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:32:34,258 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:32:34,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:32:34,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:32:34,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:32:34,258 INFO L87 Difference]: Start difference. First operand 448 states and 2380 transitions. Second operand 10 states. [2019-02-15 11:32:44,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:32:44,043 INFO L93 Difference]: Finished difference Result 731 states and 3887 transitions. [2019-02-15 11:32:44,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:32:44,043 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-15 11:32:44,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:32:44,045 INFO L225 Difference]: With dead ends: 731 [2019-02-15 11:32:44,045 INFO L226 Difference]: Without dead ends: 718 [2019-02-15 11:32:44,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:32:44,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-02-15 11:32:52,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 399. [2019-02-15 11:32:52,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-02-15 11:32:52,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 2082 transitions. [2019-02-15 11:32:52,533 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 2082 transitions. Word has length 9 [2019-02-15 11:32:52,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:32:52,533 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 2082 transitions. [2019-02-15 11:32:52,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:32:52,533 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 2082 transitions. [2019-02-15 11:32:52,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 11:32:52,534 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:32:52,534 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:32:52,534 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:32:52,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:32:52,535 INFO L82 PathProgramCache]: Analyzing trace with hash 2086595996, now seen corresponding path program 1 times [2019-02-15 11:32:52,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:32:52,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:32:52,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:32:52,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:32:52,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:32:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:32:52,664 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:32:52,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:32:52,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:32:52,664 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 11:32:52,664 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [28], [29] [2019-02-15 11:32:52,665 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:32:52,666 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:32:53,034 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:32:53,034 INFO L272 AbstractInterpreter]: Visited 9 different actions 14 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 11:32:53,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:32:53,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:32:53,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:32:53,035 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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:32:53,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:32:53,043 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:32:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:32:53,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:32:53,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:32:53,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:32:53,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:32:53,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:32:53,155 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:32:53,172 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:53,187 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:53,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:53,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:32:53,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:32:53,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:32:53,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:32:53,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:32:53,243 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:32:53,280 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:53,292 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:53,301 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:53,311 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:53,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:32:53,337 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-15 11:32:53,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:32:53,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:32:53,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:32:53,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:33 [2019-02-15 11:32:53,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 11:32:53,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:32:53,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:32:53,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-02-15 11:32:53,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,478 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:32:53,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 11:32:53,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:32:53,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:32:53,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-02-15 11:32:53,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:32:53,530 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:32:53,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-02-15 11:32:53,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:32:53,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:32:53,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:35 [2019-02-15 11:32:53,576 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:32:53,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:32:53,641 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:32:53,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:32:53,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 11:32:53,658 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:32:53,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:32:53,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:32:53,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:32:53,659 INFO L87 Difference]: Start difference. First operand 399 states and 2082 transitions. Second operand 12 states. [2019-02-15 11:33:03,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:33:03,835 INFO L93 Difference]: Finished difference Result 480 states and 2456 transitions. [2019-02-15 11:33:03,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:33:03,835 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-15 11:33:03,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:33:03,837 INFO L225 Difference]: With dead ends: 480 [2019-02-15 11:33:03,837 INFO L226 Difference]: Without dead ends: 473 [2019-02-15 11:33:03,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2019-02-15 11:33:03,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-02-15 11:33:07,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 193. [2019-02-15 11:33:07,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-02-15 11:33:07,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 982 transitions. [2019-02-15 11:33:07,127 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 982 transitions. Word has length 9 [2019-02-15 11:33:07,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:33:07,128 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 982 transitions. [2019-02-15 11:33:07,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:33:07,128 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 982 transitions. [2019-02-15 11:33:07,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 11:33:07,129 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:33:07,129 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:33:07,129 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:33:07,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:33:07,129 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2019-02-15 11:33:07,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:33:07,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:33:07,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:33:07,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:33:07,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:33:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:33:07,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 11:33:07,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:33:07,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:33:07,227 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 11:33:07,227 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [30], [31] [2019-02-15 11:33:07,228 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:33:07,228 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:33:07,497 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:33:07,498 INFO L272 AbstractInterpreter]: Visited 9 different actions 13 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:33:07,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:33:07,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:33:07,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:33:07,498 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 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:33:07,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:33:07,507 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:33:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:33:07,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:33:07,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:33:07,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:33:07,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:33:07,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:33:07,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:33:07,542 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:33:07,567 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:07,580 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:07,589 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:07,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:07,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:33:07,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:33:07,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:33:07,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:33:07,713 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:33:07,727 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:07,740 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:07,755 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:07,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:33:07,781 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-15 11:33:07,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:33:07,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:33:07,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:33:07,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:33:07,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 11:33:07,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:33:07,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:33:07,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 11:33:07,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,918 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:33:07,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:07,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-02-15 11:33:07,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:33:07,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:33:07,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-15 11:33:07,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:33:07,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:33:07,991 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:33:08,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:33:08,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:33:08,010 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:33:08,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:33:08,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:33:08,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:33:08,011 INFO L87 Difference]: Start difference. First operand 193 states and 982 transitions. Second operand 10 states. [2019-02-15 11:33:13,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:33:13,264 INFO L93 Difference]: Finished difference Result 258 states and 1245 transitions. [2019-02-15 11:33:13,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:33:13,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-15 11:33:13,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:33:13,266 INFO L225 Difference]: With dead ends: 258 [2019-02-15 11:33:13,266 INFO L226 Difference]: Without dead ends: 243 [2019-02-15 11:33:13,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:33:13,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-02-15 11:33:17,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 219. [2019-02-15 11:33:17,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-02-15 11:33:17,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 1113 transitions. [2019-02-15 11:33:17,697 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 1113 transitions. Word has length 9 [2019-02-15 11:33:17,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:33:17,704 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 1113 transitions. [2019-02-15 11:33:17,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:33:17,705 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 1113 transitions. [2019-02-15 11:33:17,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 11:33:17,705 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:33:17,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:33:17,706 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:33:17,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:33:17,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1629971288, now seen corresponding path program 1 times [2019-02-15 11:33:17,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:33:17,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:33:17,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:33:17,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:33:17,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:33:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:33:17,849 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 11:33:17,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:33:17,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:33:17,849 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 11:33:17,849 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [26], [28], [29] [2019-02-15 11:33:17,850 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:33:17,850 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:33:18,576 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:33:18,577 INFO L272 AbstractInterpreter]: Visited 9 different actions 19 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 11:33:18,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:33:18,577 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:33:18,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:33:18,577 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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:33:18,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:33:18,586 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:33:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:33:18,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:33:18,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:33:18,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:33:18,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:18,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:18,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:33:18,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:18,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:18,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:18,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:33:18,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:18,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:18,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:18,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:18,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:33:18,633 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:33:18,657 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:18,670 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:18,680 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:18,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:18,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:33:18,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:18,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:18,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:33:18,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:18,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:18,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:18,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:18,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:33:18,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:18,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:18,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:18,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:18,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:18,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:18,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:33:18,800 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:33:18,814 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:18,828 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:18,843 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:18,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:18,869 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-02-15 11:33:18,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:18,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 11:33:18,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:33:18,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:33:18,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-02-15 11:33:18,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:18,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:18,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:18,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:18,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:18,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:18,967 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:33:18,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-02-15 11:33:18,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:33:19,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-15 11:33:19,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:72 [2019-02-15 11:33:19,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:19,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:19,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:19,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:19,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:19,111 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:33:19,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 53 [2019-02-15 11:33:19,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:33:19,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:19,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:19,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:19,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:19,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:19,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:19,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:19,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:19,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:19,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 90 [2019-02-15 11:33:19,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:33:19,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:33:19,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:92, output treesize:68 [2019-02-15 11:33:19,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:19,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:19,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:19,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:19,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:19,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:19,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:19,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:19,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:19,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:19,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:19,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:19,285 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:33:19,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 102 [2019-02-15 11:33:19,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:33:19,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:19,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:19,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:19,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:19,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:19,350 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:33:19,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 63 [2019-02-15 11:33:19,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:33:19,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:33:19,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:90, output treesize:70 [2019-02-15 11:33:19,459 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:33:19,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:33:19,504 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:33:19,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:33:19,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 11:33:19,523 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:33:19,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:33:19,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:33:19,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:33:19,524 INFO L87 Difference]: Start difference. First operand 219 states and 1113 transitions. Second operand 12 states. [2019-02-15 11:33:26,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:33:26,490 INFO L93 Difference]: Finished difference Result 295 states and 1406 transitions. [2019-02-15 11:33:26,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:33:26,490 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-15 11:33:26,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:33:26,492 INFO L225 Difference]: With dead ends: 295 [2019-02-15 11:33:26,492 INFO L226 Difference]: Without dead ends: 284 [2019-02-15 11:33:26,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2019-02-15 11:33:26,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-02-15 11:33:31,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 225. [2019-02-15 11:33:31,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-02-15 11:33:31,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1147 transitions. [2019-02-15 11:33:31,219 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1147 transitions. Word has length 9 [2019-02-15 11:33:31,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:33:31,220 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1147 transitions. [2019-02-15 11:33:31,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:33:31,220 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1147 transitions. [2019-02-15 11:33:31,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 11:33:31,220 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:33:31,220 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:33:31,221 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:33:31,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:33:31,221 INFO L82 PathProgramCache]: Analyzing trace with hash 894315494, now seen corresponding path program 1 times [2019-02-15 11:33:31,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:33:31,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:33:31,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:33:31,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:33:31,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:33:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:33:31,332 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:33:31,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:33:31,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:33:31,333 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 11:33:31,333 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [30], [31] [2019-02-15 11:33:31,333 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:33:31,333 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:33:31,808 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:33:31,808 INFO L272 AbstractInterpreter]: Visited 8 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:33:31,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:33:31,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:33:31,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:33:31,808 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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:33:31,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:33:31,816 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:33:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:33:31,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:33:31,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:33:31,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:33:31,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:31,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:31,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:33:31,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:31,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:31,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:31,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:33:31,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:31,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:31,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:31,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:31,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:33:31,850 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:33:31,874 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:31,888 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:31,898 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:31,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:31,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:33:31,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:31,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:31,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:33:31,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:31,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:31,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:31,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:31,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:33:32,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:32,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:32,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:32,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:32,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:32,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:32,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:33:32,018 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:33:32,033 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:32,046 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:32,061 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:32,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:33:32,087 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-15 11:33:32,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:32,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-15 11:33:32,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:33:32,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:33:32,132 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 11:33:32,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:32,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:32,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:32,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:32,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:32,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:32,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:32,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-02-15 11:33:32,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:33:32,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:33:32,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-02-15 11:33:32,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:32,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:32,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:32,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:32,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:32,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:32,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:32,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:32,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:32,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 11:33:32,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:33:32,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:33:32,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:25 [2019-02-15 11:33:32,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:33:32,418 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:33:32,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:33:32,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:33:32,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:33:32,462 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:33:32,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:33:32,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:33:32,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:33:32,462 INFO L87 Difference]: Start difference. First operand 225 states and 1147 transitions. Second operand 10 states. [2019-02-15 11:33:39,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:33:39,406 INFO L93 Difference]: Finished difference Result 328 states and 1595 transitions. [2019-02-15 11:33:39,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:33:39,407 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-15 11:33:39,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:33:39,408 INFO L225 Difference]: With dead ends: 328 [2019-02-15 11:33:39,408 INFO L226 Difference]: Without dead ends: 315 [2019-02-15 11:33:39,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:33:39,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-02-15 11:33:46,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 258. [2019-02-15 11:33:46,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-02-15 11:33:46,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 1289 transitions. [2019-02-15 11:33:46,081 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 1289 transitions. Word has length 9 [2019-02-15 11:33:46,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:33:46,081 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 1289 transitions. [2019-02-15 11:33:46,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:33:46,081 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 1289 transitions. [2019-02-15 11:33:46,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 11:33:46,082 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:33:46,082 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:33:46,082 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:33:46,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:33:46,082 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2019-02-15 11:33:46,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:33:46,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:33:46,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:33:46,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:33:46,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:33:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:33:46,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 11:33:46,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:33:46,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:33:46,269 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 11:33:46,269 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [30], [31] [2019-02-15 11:33:46,270 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:33:46,270 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:33:46,540 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:33:46,540 INFO L272 AbstractInterpreter]: Visited 9 different actions 13 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:33:46,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:33:46,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:33:46,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:33:46,540 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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:33:46,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:33:46,552 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:33:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:33:46,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:33:46,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:46,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 11:33:46,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:46,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:46,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:33:46,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:46,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:46,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:46,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:46,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:33:46,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:46,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:46,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:46,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:46,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:46,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:46,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:33:46,695 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:33:46,712 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:46,728 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:46,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:46,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:33:46,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:33:46,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:33:46,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:33:46,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 11:33:46,780 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:33:46,803 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:46,815 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:46,826 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:46,835 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:33:46,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:33:46,863 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-15 11:33:46,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:46,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:33:46,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:33:46,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:33:46,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-15 11:33:46,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:46,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:46,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:46,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:46,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:46,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:46,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:46,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-15 11:33:46,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:33:46,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:33:46,987 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-02-15 11:33:47,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:47,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:47,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:47,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:47,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:47,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:47,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:47,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:47,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:47,018 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:33:47,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:33:47,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-02-15 11:33:47,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:33:47,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:33:47,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-02-15 11:33:47,078 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:33:47,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:33:47,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:33:47,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:33:47,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:33:47,137 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:33:47,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:33:47,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:33:47,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:33:47,138 INFO L87 Difference]: Start difference. First operand 258 states and 1289 transitions. Second operand 10 states. [2019-02-15 11:33:56,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:33:56,449 INFO L93 Difference]: Finished difference Result 326 states and 1564 transitions. [2019-02-15 11:33:56,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:33:56,449 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-15 11:33:56,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:33:56,451 INFO L225 Difference]: With dead ends: 326 [2019-02-15 11:33:56,451 INFO L226 Difference]: Without dead ends: 313 [2019-02-15 11:33:56,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:33:56,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-02-15 11:34:04,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2019-02-15 11:34:04,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-02-15 11:34:04,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1425 transitions. [2019-02-15 11:34:04,584 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1425 transitions. Word has length 9 [2019-02-15 11:34:04,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:34:04,584 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1425 transitions. [2019-02-15 11:34:04,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:34:04,584 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1425 transitions. [2019-02-15 11:34:04,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 11:34:04,585 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:34:04,585 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:34:04,585 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:34:04,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:34:04,585 INFO L82 PathProgramCache]: Analyzing trace with hash -561287958, now seen corresponding path program 1 times [2019-02-15 11:34:04,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:34:04,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:34:04,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:34:04,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:34:04,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:34:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:34:04,672 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-15 11:34:04,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:34:04,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:34:04,673 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 11:34:04,673 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [29] [2019-02-15 11:34:04,674 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:34:04,674 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:34:05,201 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:34:05,201 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:34:05,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:34:05,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:34:05,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:34:05,201 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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:34:05,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:34:05,212 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:34:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:34:05,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:34:05,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:34:05,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:34:05,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:34:05,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:34:05,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:34:05,268 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:05,293 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:05,306 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:05,314 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:05,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:05,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:34:05,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:34:05,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:34:05,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:34:05,436 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:05,450 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:05,463 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:05,479 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:05,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:34:05,504 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 11:34:05,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:34:05,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:34:05,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:34:05,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-02-15 11:34:05,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,721 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:34:05,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 58 [2019-02-15 11:34:05,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:05,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:34:05,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:31 [2019-02-15 11:34:05,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-02-15 11:34:05,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:05,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:34:05,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-15 11:34:05,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:05,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2019-02-15 11:34:05,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:05,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:34:05,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:29 [2019-02-15 11:34:05,862 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:34:05,863 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:34:05,905 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:34:05,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:34:05,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-15 11:34:05,923 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:34:05,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:34:05,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:34:05,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:34:05,924 INFO L87 Difference]: Start difference. First operand 284 states and 1425 transitions. Second operand 11 states. [2019-02-15 11:34:17,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:34:17,280 INFO L93 Difference]: Finished difference Result 400 states and 1978 transitions. [2019-02-15 11:34:17,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:34:17,280 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-02-15 11:34:17,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:34:17,282 INFO L225 Difference]: With dead ends: 400 [2019-02-15 11:34:17,282 INFO L226 Difference]: Without dead ends: 393 [2019-02-15 11:34:17,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:34:17,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-02-15 11:34:27,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 366. [2019-02-15 11:34:27,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-02-15 11:34:27,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1845 transitions. [2019-02-15 11:34:27,541 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1845 transitions. Word has length 9 [2019-02-15 11:34:27,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:34:27,541 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 1845 transitions. [2019-02-15 11:34:27,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:34:27,541 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1845 transitions. [2019-02-15 11:34:27,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 11:34:27,542 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:34:27,542 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:34:27,542 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:34:27,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:34:27,542 INFO L82 PathProgramCache]: Analyzing trace with hash -975025366, now seen corresponding path program 1 times [2019-02-15 11:34:27,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:34:27,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:34:27,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:34:27,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:34:27,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:34:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:34:27,775 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 16 [2019-02-15 11:34:27,829 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-15 11:34:27,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:34:27,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:34:27,830 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 11:34:27,830 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [29] [2019-02-15 11:34:27,831 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:34:27,831 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:34:28,097 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:34:28,097 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:34:28,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:34:28,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:34:28,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:34:28,097 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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:34:28,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:34:28,105 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:34:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:34:28,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:34:28,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:34:28,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:34:28,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:34:28,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:34:28,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:34:28,156 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:28,181 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:28,194 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:28,204 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:28,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:28,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:34:28,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:34:28,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:34:28,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:34:28,326 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:28,340 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:28,353 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:28,368 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:28,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:34:28,395 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-15 11:34:28,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:34:28,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:34:28,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:34:28,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-02-15 11:34:28,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,587 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:34:28,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 62 [2019-02-15 11:34:28,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:28,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,647 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:34:28,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 79 [2019-02-15 11:34:28,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:28,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:34:28,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:74 [2019-02-15 11:34:28,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 82 [2019-02-15 11:34:28,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:28,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,793 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:34:28,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-02-15 11:34:28,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:28,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:34:28,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:100, output treesize:74 [2019-02-15 11:34:28,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 102 [2019-02-15 11:34:28,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:28,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:28,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 71 [2019-02-15 11:34:28,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:28,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:34:28,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-02-15 11:34:29,034 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:34:29,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:34:29,080 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:34:29,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:34:29,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-15 11:34:29,099 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:34:29,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:34:29,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:34:29,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:34:29,099 INFO L87 Difference]: Start difference. First operand 366 states and 1845 transitions. Second operand 11 states. [2019-02-15 11:34:41,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:34:41,486 INFO L93 Difference]: Finished difference Result 441 states and 2134 transitions. [2019-02-15 11:34:41,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-15 11:34:41,487 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-02-15 11:34:41,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:34:41,488 INFO L225 Difference]: With dead ends: 441 [2019-02-15 11:34:41,489 INFO L226 Difference]: Without dead ends: 428 [2019-02-15 11:34:41,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-02-15 11:34:41,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-02-15 11:34:51,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 367. [2019-02-15 11:34:51,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-02-15 11:34:51,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1844 transitions. [2019-02-15 11:34:51,789 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1844 transitions. Word has length 9 [2019-02-15 11:34:51,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:34:51,789 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 1844 transitions. [2019-02-15 11:34:51,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:34:51,789 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1844 transitions. [2019-02-15 11:34:51,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 11:34:51,790 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:34:51,790 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:34:51,790 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:34:51,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:34:51,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1143531808, now seen corresponding path program 1 times [2019-02-15 11:34:51,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:34:51,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:34:51,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:34:51,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:34:51,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:34:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:34:51,920 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-15 11:34:51,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:34:51,920 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:34:51,921 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 11:34:51,921 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [29] [2019-02-15 11:34:51,922 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:34:51,922 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:34:52,267 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:34:52,267 INFO L272 AbstractInterpreter]: Visited 9 different actions 14 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 11:34:52,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:34:52,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:34:52,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:34:52,268 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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:34:52,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:34:52,276 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:34:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:34:52,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:34:52,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:34:52,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:34:52,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:34:52,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:34:52,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:34:52,315 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:52,340 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:52,353 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:52,362 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:52,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:52,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:34:52,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:34:52,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:34:52,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:34:52,485 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:52,500 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:52,513 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:52,528 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:34:52,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:34:52,554 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-15 11:34:52,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:34:52,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:34:52,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-15 11:34:52,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-02-15 11:34:52,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 67 [2019-02-15 11:34:52,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:52,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 96 [2019-02-15 11:34:52,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:52,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:34:52,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:68 [2019-02-15 11:34:52,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,925 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:34:52,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 99 [2019-02-15 11:34:52,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:52,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:52,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,001 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:34:53,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2019-02-15 11:34:53,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:53,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:34:53,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:62 [2019-02-15 11:34:53,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,088 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:34:53,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 83 [2019-02-15 11:34:53,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:53,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:34:53,149 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:34:53,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 106 [2019-02-15 11:34:53,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:34:53,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:34:53,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:66 [2019-02-15 11:34:53,246 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:34:53,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:34:53,306 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:34:53,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:34:53,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 11:34:53,325 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:34:53,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:34:53,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:34:53,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:34:53,325 INFO L87 Difference]: Start difference. First operand 367 states and 1844 transitions. Second operand 12 states. [2019-02-15 11:35:13,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:35:13,520 INFO L93 Difference]: Finished difference Result 685 states and 3436 transitions. [2019-02-15 11:35:13,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-15 11:35:13,521 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-15 11:35:13,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:35:13,522 INFO L225 Difference]: With dead ends: 685 [2019-02-15 11:35:13,523 INFO L226 Difference]: Without dead ends: 677 [2019-02-15 11:35:13,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-02-15 11:35:13,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-02-15 11:35:28,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 545. [2019-02-15 11:35:28,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-02-15 11:35:28,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 2791 transitions. [2019-02-15 11:35:28,883 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 2791 transitions. Word has length 9 [2019-02-15 11:35:28,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:35:28,883 INFO L480 AbstractCegarLoop]: Abstraction has 545 states and 2791 transitions. [2019-02-15 11:35:28,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:35:28,883 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 2791 transitions. [2019-02-15 11:35:28,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 11:35:28,884 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:35:28,884 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:35:28,884 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:35:28,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:35:28,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1616311456, now seen corresponding path program 2 times [2019-02-15 11:35:28,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:35:28,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:35:28,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:35:28,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:35:28,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:35:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:35:29,178 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2019-02-15 11:35:29,268 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 11:35:29,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:35:29,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:35:29,268 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:35:29,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:35:29,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:35:29,269 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 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:35:29,277 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:35:29,277 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:35:29,284 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:35:29,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:35:29,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:35:29,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:35:29,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:35:29,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:35:29,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:35:29,382 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:35:29,397 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:29,411 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:29,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:29,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:35:29,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:35:29,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:35:29,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:35:29,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:35:29,457 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:35:29,477 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:29,488 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:29,497 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:29,507 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:29,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:35:29,533 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-15 11:35:29,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-15 11:35:29,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:35:29,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-15 11:35:29,663 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-02-15 11:35:29,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-02-15 11:35:29,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:35:29,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,819 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:35:29,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2019-02-15 11:35:29,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:35:29,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:35:29,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:86 [2019-02-15 11:35:29,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:29,933 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:35:29,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 99 [2019-02-15 11:35:29,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:35:30,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:30,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 45 [2019-02-15 11:35:30,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:35:30,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:35:30,037 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:106, output treesize:70 [2019-02-15 11:35:32,092 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 46 [2019-02-15 11:35:32,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:32,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:32,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:32,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:32,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:32,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:32,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 59 [2019-02-15 11:35:32,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:35:32,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:32,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:32,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:32,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:32,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:32,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:32,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:32,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:32,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:32,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:32,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:32,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:32,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:32,157 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:35:32,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 110 [2019-02-15 11:35:32,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:35:32,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:35:32,209 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-02-15 11:35:32,267 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:35:32,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:35:32,320 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:35:32,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:35:32,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-15 11:35:32,339 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:35:32,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 11:35:32,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 11:35:32,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:35:32,340 INFO L87 Difference]: Start difference. First operand 545 states and 2791 transitions. Second operand 13 states. [2019-02-15 11:35:34,280 WARN L181 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-02-15 11:35:35,591 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-02-15 11:35:49,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:35:49,265 INFO L93 Difference]: Finished difference Result 550 states and 2805 transitions. [2019-02-15 11:35:49,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:35:49,266 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-02-15 11:35:49,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:35:49,267 INFO L225 Difference]: With dead ends: 550 [2019-02-15 11:35:49,267 INFO L226 Difference]: Without dead ends: 543 [2019-02-15 11:35:49,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2019-02-15 11:35:49,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-02-15 11:35:52,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 38. [2019-02-15 11:35:52,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-15 11:35:52,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-02-15 11:35:52,250 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 9 [2019-02-15 11:35:52,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:35:52,250 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-02-15 11:35:52,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 11:35:52,250 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-02-15 11:35:52,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-15 11:35:52,250 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:35:52,250 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:35:52,250 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:35:52,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:35:52,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1518781026, now seen corresponding path program 1 times [2019-02-15 11:35:52,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:35:52,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:35:52,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:35:52,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:35:52,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:35:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:35:52,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 11:35:52,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:35:52,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:35:52,326 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-02-15 11:35:52,326 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [30], [31] [2019-02-15 11:35:52,326 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:35:52,327 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:35:52,682 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:35:52,682 INFO L272 AbstractInterpreter]: Visited 10 different actions 15 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 11:35:52,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:35:52,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:35:52,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:35:52,683 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 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:35:52,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:35:52,692 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:35:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:35:52,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:35:52,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:52,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 11:35:52,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:52,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:52,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:35:52,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:52,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:52,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:52,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:52,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:35:52,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:52,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:52,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:52,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:52,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:52,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:52,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:35:52,831 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:35:52,847 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:52,862 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:52,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:52,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:35:52,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:35:52,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-15 11:35:52,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-15 11:35:52,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-15 11:35:52,939 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:35:53,329 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:53,527 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:53,702 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:53,831 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:35:54,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:35:54,199 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-15 11:35:54,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:54,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-15 11:35:54,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:35:54,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:35:54,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-15 11:35:54,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:54,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:54,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:54,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:54,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:54,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:54,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:54,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 11:35:54,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:35:54,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:35:54,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-15 11:35:54,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:54,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:54,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:54,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:54,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:54,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:54,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:54,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:54,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:54,395 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:35:54,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:54,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-02-15 11:35:54,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:35:54,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:35:54,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-02-15 11:35:54,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:54,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:54,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:54,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:54,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:54,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:54,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:54,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:54,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:54,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:54,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:54,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:54,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:35:54,659 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:35:54,659 INFO L303 Elim1Store]: Index analysis took 204 ms [2019-02-15 11:35:54,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-02-15 11:35:54,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:35:54,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:35:54,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-15 11:35:55,033 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-02-15 11:35:55,037 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:35:55,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:35:55,128 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:35:55,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:35:55,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-02-15 11:35:55,148 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:35:55,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 11:35:55,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 11:35:55,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:35:55,149 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-02-15 11:36:01,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:36:01,045 INFO L93 Difference]: Finished difference Result 67 states and 277 transitions. [2019-02-15 11:36:01,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:36:01,045 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-02-15 11:36:01,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:36:01,046 INFO L225 Difference]: With dead ends: 67 [2019-02-15 11:36:01,046 INFO L226 Difference]: Without dead ends: 58 [2019-02-15 11:36:01,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-02-15 11:36:01,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-15 11:36:04,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2019-02-15 11:36:04,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-15 11:36:04,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 171 transitions. [2019-02-15 11:36:04,248 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 171 transitions. Word has length 10 [2019-02-15 11:36:04,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:36:04,248 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 171 transitions. [2019-02-15 11:36:04,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 11:36:04,248 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 171 transitions. [2019-02-15 11:36:04,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-15 11:36:04,248 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:36:04,248 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:36:04,248 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:36:04,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:36:04,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1744942188, now seen corresponding path program 1 times [2019-02-15 11:36:04,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:36:04,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:36:04,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:36:04,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:36:04,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:36:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:36:04,377 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-15 11:36:04,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:36:04,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:36:04,377 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-02-15 11:36:04,377 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [28], [30], [31] [2019-02-15 11:36:04,378 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:36:04,378 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:36:04,715 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:36:04,715 INFO L272 AbstractInterpreter]: Visited 10 different actions 15 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 11:36:04,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:36:04,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:36:04,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:36:04,715 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 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:36:04,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:36:04,725 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:36:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:36:04,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:36:04,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:36:04,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:04,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:04,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:36:04,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:04,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:04,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:04,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:04,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:36:04,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:04,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:04,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:04,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:04,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:04,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:04,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:36:04,830 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:36:04,845 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:04,859 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:04,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:04,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:36:04,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:36:04,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:36:04,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:36:04,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:36:04,907 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:36:04,926 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:04,938 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:04,947 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:04,956 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:04,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:04,982 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-02-15 11:36:05,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-15 11:36:05,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:36:05,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:36:05,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-02-15 11:36:05,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-02-15 11:36:05,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:36:05,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-15 11:36:05,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:68 [2019-02-15 11:36:05,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,240 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:36:05,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-02-15 11:36:05,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:36:05,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,303 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:36:05,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 104 [2019-02-15 11:36:05,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:36:05,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:36:05,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:64 [2019-02-15 11:36:05,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,413 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:36:05,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 109 [2019-02-15 11:36:05,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:36:05,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:05,480 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:36:05,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-02-15 11:36:05,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:36:05,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:36:05,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:84, output treesize:64 [2019-02-15 11:36:05,572 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:36:05,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:36:05,631 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:36:05,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:36:05,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 11:36:05,649 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:36:05,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:36:05,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:36:05,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:36:05,650 INFO L87 Difference]: Start difference. First operand 39 states and 171 transitions. Second operand 12 states. [2019-02-15 11:36:11,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:36:11,937 INFO L93 Difference]: Finished difference Result 74 states and 289 transitions. [2019-02-15 11:36:11,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:36:11,938 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-02-15 11:36:11,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:36:11,938 INFO L225 Difference]: With dead ends: 74 [2019-02-15 11:36:11,938 INFO L226 Difference]: Without dead ends: 59 [2019-02-15 11:36:11,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2019-02-15 11:36:11,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-15 11:36:15,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 38. [2019-02-15 11:36:15,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-15 11:36:15,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-02-15 11:36:15,467 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 10 [2019-02-15 11:36:15,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:36:15,467 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-02-15 11:36:15,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:36:15,467 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-02-15 11:36:15,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-15 11:36:15,468 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:36:15,468 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:36:15,468 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:36:15,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:36:15,468 INFO L82 PathProgramCache]: Analyzing trace with hash 854957070, now seen corresponding path program 1 times [2019-02-15 11:36:15,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:36:15,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:36:15,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:36:15,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:36:15,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:36:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:36:15,688 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 11:36:15,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:36:15,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:36:15,689 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-02-15 11:36:15,689 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [28], [30], [31] [2019-02-15 11:36:15,690 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:36:15,690 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:36:16,045 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:36:16,045 INFO L272 AbstractInterpreter]: Visited 10 different actions 15 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 11:36:16,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:36:16,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:36:16,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:36:16,046 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 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:36:16,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:36:16,053 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:36:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:36:16,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:36:16,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-15 11:36:16,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:36:16,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:36:16,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-15 11:36:16,166 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:36:16,180 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:16,194 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:16,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:16,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:36:16,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:36:16,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-15 11:36:16,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-15 11:36:16,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-15 11:36:16,241 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:36:16,261 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:16,273 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:16,282 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:16,291 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:16,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:36:16,318 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-15 11:36:16,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 11:36:16,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:36:16,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:36:16,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:36:16,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:36:16,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:36:16,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:36:16,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-02-15 11:36:16,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,528 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:36:16,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-02-15 11:36:16,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:36:16,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:36:16,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-15 11:36:16,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:16,583 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:36:16,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-02-15 11:36:16,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:36:16,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:36:16,605 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-15 11:36:16,624 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:36:16,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:36:16,662 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:36:16,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:36:16,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-15 11:36:16,680 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:36:16,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 11:36:16,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 11:36:16,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:36:16,681 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-02-15 11:36:23,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:36:23,959 INFO L93 Difference]: Finished difference Result 80 states and 341 transitions. [2019-02-15 11:36:23,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:36:23,959 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-02-15 11:36:23,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:36:23,960 INFO L225 Difference]: With dead ends: 80 [2019-02-15 11:36:23,960 INFO L226 Difference]: Without dead ends: 71 [2019-02-15 11:36:23,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-02-15 11:36:23,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-15 11:36:30,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2019-02-15 11:36:30,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-02-15 11:36:30,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 296 transitions. [2019-02-15 11:36:30,374 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 296 transitions. Word has length 10 [2019-02-15 11:36:30,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:36:30,374 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 296 transitions. [2019-02-15 11:36:30,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 11:36:30,374 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 296 transitions. [2019-02-15 11:36:30,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-02-15 11:36:30,375 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:36:30,375 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:36:30,375 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:36:30,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:36:30,375 INFO L82 PathProgramCache]: Analyzing trace with hash 997631658, now seen corresponding path program 2 times [2019-02-15 11:36:30,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:36:30,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:36:30,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:36:30,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:36:30,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:36:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:36:30,472 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-02-15 11:36:30,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:36:30,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:36:30,473 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:36:30,473 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:36:30,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:36:30,473 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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:36:30,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:36:30,484 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:36:30,490 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-15 11:36:30,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:36:30,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:36:30,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-15 11:36:30,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-15 11:36:30,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 23 treesize of output 25 [2019-02-15 11:36:30,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-15 11:36:30,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:36:30,527 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:36:30,543 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:30,552 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:30,562 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:30,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:30,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-02-15 11:36:30,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-15 11:36:30,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 22 treesize of output 24 [2019-02-15 11:36:30,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-02-15 11:36:30,610 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 11:36:30,617 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:30,624 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:30,631 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:36:30,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:36:30,647 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:36, output treesize:42 [2019-02-15 11:36:30,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2019-02-15 11:36:30,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:36:30,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-15 11:36:30,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:35 [2019-02-15 11:36:30,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2019-02-15 11:36:30,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:36:30,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 42 [2019-02-15 11:36:30,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:36:30,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-15 11:36:30,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:35 [2019-02-15 11:36:30,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 60 [2019-02-15 11:36:30,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:36:30,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-02-15 11:36:30,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:36:30,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-15 11:36:30,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:28 [2019-02-15 11:36:30,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-02-15 11:36:30,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:36:30,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 62 [2019-02-15 11:36:30,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:36:30,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-15 11:36:30,949 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2019-02-15 11:36:30,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,978 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:36:30,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:30,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 55 [2019-02-15 11:36:30,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:36:31,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:31,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:31,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:31,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:36:31,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-02-15 11:36:31,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:36:31,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-15 11:36:31,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:34 [2019-02-15 11:36:31,058 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:36:31,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:36:31,126 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:36:31,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:36:31,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-02-15 11:36:31,144 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:36:31,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 11:36:31,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 11:36:31,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:36:31,145 INFO L87 Difference]: Start difference. First operand 64 states and 296 transitions. Second operand 13 states. [2019-02-15 11:36:38,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:36:38,065 INFO L93 Difference]: Finished difference Result 71 states and 316 transitions. [2019-02-15 11:36:38,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:36:38,065 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2019-02-15 11:36:38,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:36:38,066 INFO L225 Difference]: With dead ends: 71 [2019-02-15 11:36:38,066 INFO L226 Difference]: Without dead ends: 0 [2019-02-15 11:36:38,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2019-02-15 11:36:38,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-15 11:36:38,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-15 11:36:38,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-15 11:36:38,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-15 11:36:38,067 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-02-15 11:36:38,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:36:38,068 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-15 11:36:38,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 11:36:38,068 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-15 11:36:38,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-15 11:36:38,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-15 11:36:38,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:36:38,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:36:38,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:36:38,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:36:43,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:36:49,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:36:51,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:36:52,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:36:53,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:36:55,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:37:15,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:37:25,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent.