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-fa1c628-m [2019-01-31 17:34:46,313 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 17:34:46,314 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 17:34:46,327 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 17:34:46,327 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 17:34:46,328 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 17:34:46,329 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 17:34:46,331 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 17:34:46,333 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 17:34:46,334 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 17:34:46,334 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 17:34:46,335 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 17:34:46,336 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 17:34:46,337 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 17:34:46,338 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 17:34:46,339 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 17:34:46,339 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 17:34:46,341 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 17:34:46,343 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 17:34:46,345 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 17:34:46,346 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 17:34:46,347 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 17:34:46,351 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 17:34:46,352 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 17:34:46,352 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 17:34:46,355 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 17:34:46,356 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 17:34:46,360 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 17:34:46,361 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 17:34:46,362 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 17:34:46,362 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 17:34:46,365 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 17:34:46,365 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 17:34:46,365 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 17:34:46,367 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 17:34:46,368 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 17:34:46,368 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-31 17:34:46,383 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 17:34:46,384 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 17:34:46,384 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 17:34:46,385 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 17:34:46,385 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 17:34:46,385 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 17:34:46,385 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 17:34:46,385 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 17:34:46,386 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 17:34:46,386 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-31 17:34:46,386 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-31 17:34:46,386 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 17:34:46,386 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 17:34:46,387 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 17:34:46,387 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 17:34:46,387 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 17:34:46,388 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 17:34:46,388 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 17:34:46,388 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 17:34:46,388 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 17:34:46,388 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 17:34:46,389 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 17:34:46,389 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 17:34:46,389 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 17:34:46,389 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 17:34:46,389 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 17:34:46,390 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 17:34:46,390 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 17:34:46,390 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 17:34:46,390 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 17:34:46,390 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:34:46,391 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 17:34:46,391 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 17:34:46,391 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 17:34:46,391 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 17:34:46,391 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 17:34:46,392 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 17:34:46,392 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 17:34:46,392 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 17:34:46,424 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 17:34:46,436 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 17:34:46,440 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 17:34:46,441 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 17:34:46,442 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 17:34:46,442 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-01-31 17:34:46,443 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl' [2019-01-31 17:34:46,479 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 17:34:46,480 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 17:34:46,481 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 17:34:46,481 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 17:34:46,481 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 17:34:46,497 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 31.01 05:34:46" (1/1) ... [2019-01-31 17:34:46,507 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 31.01 05:34:46" (1/1) ... [2019-01-31 17:34:46,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 17:34:46,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 17:34:46,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 17:34:46,535 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 17:34:46,546 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 31.01 05:34:46" (1/1) ... [2019-01-31 17:34:46,547 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 31.01 05:34:46" (1/1) ... [2019-01-31 17:34:46,548 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 31.01 05:34:46" (1/1) ... [2019-01-31 17:34:46,549 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 31.01 05:34:46" (1/1) ... [2019-01-31 17:34:46,556 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 31.01 05:34:46" (1/1) ... [2019-01-31 17:34:46,567 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 31.01 05:34:46" (1/1) ... [2019-01-31 17:34:46,568 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 31.01 05:34:46" (1/1) ... [2019-01-31 17:34:46,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 17:34:46,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 17:34:46,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 17:34:46,574 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 17:34:46,578 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 31.01 05:34:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:34:46,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 17:34:46,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 17:34:47,069 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 17:34:47,070 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-31 17:34:47,071 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:34:47 BoogieIcfgContainer [2019-01-31 17:34:47,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 17:34:47,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 17:34:47,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 17:34:47,075 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 17:34:47,075 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 31.01 05:34:46" (1/2) ... [2019-01-31 17:34:47,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259a7135 and model type speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:34:47, skipping insertion in model container [2019-01-31 17:34:47,076 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 31.01 05:34:47" (2/2) ... [2019-01-31 17:34:47,078 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-unlimited.bpl [2019-01-31 17:34:47,086 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 17:34:47,095 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-01-31 17:34:47,109 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-01-31 17:34:47,137 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 17:34:47,137 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 17:34:47,137 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 17:34:47,137 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 17:34:47,138 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 17:34:47,138 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 17:34:47,138 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 17:34:47,138 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 17:34:47,153 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-01-31 17:34:47,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-31 17:34:47,159 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:47,160 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-31 17:34:47,163 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:47,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:47,169 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-01-31 17:34:47,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:47,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:47,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:47,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:47,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:47,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:47,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:34:47,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:34:47,351 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:34:47,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:34:47,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:34:47,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:34:47,372 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-01-31 17:34:47,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:47,643 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-01-31 17:34:47,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:34:47,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 17:34:47,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:47,658 INFO L225 Difference]: With dead ends: 25 [2019-01-31 17:34:47,658 INFO L226 Difference]: Without dead ends: 20 [2019-01-31 17:34:47,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:34:47,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-31 17:34:47,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-01-31 17:34:47,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-31 17:34:47,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-01-31 17:34:47,692 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-01-31 17:34:47,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:47,694 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-01-31 17:34:47,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:34:47,694 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-01-31 17:34:47,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:34:47,695 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:47,696 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:34:47,696 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:47,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:47,697 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-01-31 17:34:47,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:47,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:47,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:47,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:47,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:47,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:47,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:47,863 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:47,865 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:34:47,866 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2019-01-31 17:34:47,923 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:47,923 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:48,892 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:48,894 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-01-31 17:34:48,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:48,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:48,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:48,901 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:48,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:48,918 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:48,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:49,141 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-31 17:34:49,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:49,202 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-01-31 17:34:49,413 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-31 17:34:49,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:49,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:49,477 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-01-31 17:34:49,781 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-01-31 17:34:49,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:49,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:49,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:49,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:49,804 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-01-31 17:34:49,805 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:49,829 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:49,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:49,986 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-01-31 17:34:50,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, 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-01-31 17:34:50,024 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-01-31 17:34:50,046 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-01-31 17:34:50,145 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-01-31 17:34:50,146 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:50,423 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:50,648 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:50,754 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:50,824 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:50,908 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-01-31 17:34:50,909 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-31 17:34:51,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:51,063 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-01-31 17:34:51,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:51,316 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-01-31 17:34:51,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-31 17:34:51,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:51,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:51,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:51,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:51,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:34:51,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:51,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:34:51,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:34:51,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:34:51,545 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2019-01-31 17:34:51,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:51,917 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2019-01-31 17:34:51,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:34:51,918 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 17:34:51,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:51,919 INFO L225 Difference]: With dead ends: 39 [2019-01-31 17:34:51,919 INFO L226 Difference]: Without dead ends: 37 [2019-01-31 17:34:51,921 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-01-31 17:34:51,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-31 17:34:51,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2019-01-31 17:34:51,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-31 17:34:51,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2019-01-31 17:34:51,926 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2019-01-31 17:34:51,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:51,927 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2019-01-31 17:34:51,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:34:51,927 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2019-01-31 17:34:51,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:34:51,928 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:51,928 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:34:51,928 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:51,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:51,929 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-01-31 17:34:51,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:51,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:51,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:51,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:51,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:52,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:52,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:52,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:52,105 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:34:52,105 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2019-01-31 17:34:52,106 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:52,107 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:55,450 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:55,451 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-01-31 17:34:55,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:55,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:55,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:55,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:55,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:55,469 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:55,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:55,652 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-31 17:34:55,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,693 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-01-31 17:34:55,832 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-31 17:34:55,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,838 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-01-31 17:34:55,958 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-01-31 17:34:55,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,969 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-01-31 17:34:55,970 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:55,987 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:55,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:56,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, 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-01-31 17:34:56,072 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-01-31 17:34:56,075 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-01-31 17:34:56,094 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-01-31 17:34:56,112 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-01-31 17:34:56,114 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:56,150 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:56,180 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:56,204 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:56,215 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:56,283 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-01-31 17:34:56,284 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-31 17:34:56,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:56,360 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-01-31 17:34:56,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-31 17:34:56,607 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-01-31 17:34:56,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:183 [2019-01-31 17:34:56,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:56,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:56,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:56,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:34:56,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-31 17:34:56,811 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:34:56,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:34:56,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:34:56,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:34:56,812 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2019-01-31 17:34:56,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:56,885 INFO L93 Difference]: Finished difference Result 18 states and 39 transitions. [2019-01-31 17:34:56,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:34:56,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 17:34:56,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:56,888 INFO L225 Difference]: With dead ends: 18 [2019-01-31 17:34:56,888 INFO L226 Difference]: Without dead ends: 17 [2019-01-31 17:34:56,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:34:56,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-31 17:34:56,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-31 17:34:56,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-31 17:34:56,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. [2019-01-31 17:34:56,895 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 38 transitions. Word has length 3 [2019-01-31 17:34:56,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:56,895 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 38 transitions. [2019-01-31 17:34:56,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:34:56,895 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 38 transitions. [2019-01-31 17:34:56,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:34:56,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:56,896 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:34:56,896 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:56,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:56,896 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2019-01-31 17:34:56,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:56,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:56,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:56,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:56,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:56,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:56,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:34:56,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:34:56,947 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:34:56,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:34:56,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:34:56,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:34:56,948 INFO L87 Difference]: Start difference. First operand 17 states and 38 transitions. Second operand 3 states. [2019-01-31 17:34:56,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:56,999 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-01-31 17:34:56,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:34:56,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 17:34:57,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:57,000 INFO L225 Difference]: With dead ends: 21 [2019-01-31 17:34:57,000 INFO L226 Difference]: Without dead ends: 20 [2019-01-31 17:34:57,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:34:57,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-31 17:34:57,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-01-31 17:34:57,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-31 17:34:57,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2019-01-31 17:34:57,005 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2019-01-31 17:34:57,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:57,005 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2019-01-31 17:34:57,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:34:57,006 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2019-01-31 17:34:57,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:34:57,006 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:57,006 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:34:57,007 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:57,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:57,007 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-01-31 17:34:57,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:57,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:57,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:57,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:57,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:57,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:57,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:57,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:57,063 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:34:57,064 INFO L207 CegarAbsIntRunner]: [0], [10], [23] [2019-01-31 17:34:57,066 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:57,066 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:57,379 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:57,379 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-01-31 17:34:57,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:57,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:57,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:57,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:57,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:57,403 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:57,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:57,580 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-31 17:34:57,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, 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-01-31 17:34:57,609 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-01-31 17:34:57,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:57,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:57,672 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-01-31 17:34:57,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:57,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:57,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:57,767 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-01-31 17:34:57,834 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-01-31 17:34:57,835 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:57,856 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:57,872 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:57,883 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:57,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:57,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:57,926 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-01-31 17:34:57,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:57,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:57,955 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-01-31 17:34:58,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,019 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-01-31 17:34:58,020 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:58,029 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:58,039 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:58,060 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-01-31 17:34:58,061 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-31 17:34:58,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,091 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-01-31 17:34:58,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:58,113 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-01-31 17:34:58,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-31 17:34:58,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:58,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:58,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:58,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:58,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:34:58,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:58,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:34:58,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:34:58,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:34:58,181 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 6 states. [2019-01-31 17:34:58,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:58,333 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2019-01-31 17:34:58,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:34:58,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 17:34:58,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:58,337 INFO L225 Difference]: With dead ends: 39 [2019-01-31 17:34:58,337 INFO L226 Difference]: Without dead ends: 38 [2019-01-31 17:34:58,338 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-01-31 17:34:58,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-31 17:34:58,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 18. [2019-01-31 17:34:58,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-31 17:34:58,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2019-01-31 17:34:58,343 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 3 [2019-01-31 17:34:58,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:58,343 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2019-01-31 17:34:58,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:34:58,343 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2019-01-31 17:34:58,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:34:58,343 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:58,343 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:34:58,344 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:58,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:58,344 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-01-31 17:34:58,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:58,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:58,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:58,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:58,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:58,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:58,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:58,415 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:34:58,415 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [23] [2019-01-31 17:34:58,419 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:58,419 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:58,778 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:58,778 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-01-31 17:34:58,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:58,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:58,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:58,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:58,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:58,791 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:58,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:58,826 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-01-31 17:34:58,831 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-01-31 17:34:58,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,839 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-01-31 17:34:58,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,870 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-01-31 17:34:58,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, 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-01-31 17:34:58,893 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:58,919 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:58,935 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:58,948 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:58,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:58,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,985 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-01-31 17:34:59,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,059 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-01-31 17:34:59,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,093 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-01-31 17:34:59,094 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:59,103 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:59,112 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:59,135 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-01-31 17:34:59,136 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-31 17:34:59,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,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, 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-01-31 17:34:59,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:34:59,265 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-01-31 17:34:59,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:74 [2019-01-31 17:34:59,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,409 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-01-31 17:34:59,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-31 17:34:59,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,791 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:34:59,792 INFO L303 Elim1Store]: Index analysis took 112 ms [2019-01-31 17:34:59,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 45 treesize of output 51 [2019-01-31 17:34:59,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:59,954 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-01-31 17:34:59,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:96, output treesize:167 [2019-01-31 17:35:00,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:00,086 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:00,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:00,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:00,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:35:00,179 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:00,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:35:00,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:35:00,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:35:00,180 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 8 states. [2019-01-31 17:35:00,545 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-01-31 17:35:00,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:00,803 INFO L93 Difference]: Finished difference Result 59 states and 105 transitions. [2019-01-31 17:35:00,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:35:00,803 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:35:00,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:00,806 INFO L225 Difference]: With dead ends: 59 [2019-01-31 17:35:00,806 INFO L226 Difference]: Without dead ends: 55 [2019-01-31 17:35:00,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:35:00,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-31 17:35:00,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 20. [2019-01-31 17:35:00,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-31 17:35:00,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2019-01-31 17:35:00,816 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 59 transitions. Word has length 4 [2019-01-31 17:35:00,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:00,816 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 59 transitions. [2019-01-31 17:35:00,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:35:00,816 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 59 transitions. [2019-01-31 17:35:00,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:35:00,817 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:00,817 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:35:00,817 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:00,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:00,818 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2019-01-31 17:35:00,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:00,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:00,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:00,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:00,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:00,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:00,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:00,863 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:00,864 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:35:00,864 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [25] [2019-01-31 17:35:00,865 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:00,865 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:01,132 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:01,132 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-01-31 17:35:01,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:01,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:01,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:01,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:01,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:01,154 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:01,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:01,197 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-01-31 17:35:01,238 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-01-31 17:35:01,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,286 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-01-31 17:35:01,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,303 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-01-31 17:35:01,318 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-01-31 17:35:01,319 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:01,343 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:01,356 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:01,368 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:01,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:01,396 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-01-31 17:35:01,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,412 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-01-31 17:35:01,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,443 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-01-31 17:35:01,444 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:01,456 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:01,465 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:01,486 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-01-31 17:35:01,487 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-31 17:35:01,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,547 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-01-31 17:35:01,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:01,566 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-01-31 17:35:01,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2019-01-31 17:35:01,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:01,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:01,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:01,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:35:01,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-31 17:35:01,622 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:35:01,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:35:01,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:35:01,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:35:01,623 INFO L87 Difference]: Start difference. First operand 20 states and 59 transitions. Second operand 4 states. [2019-01-31 17:35:01,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:01,749 INFO L93 Difference]: Finished difference Result 25 states and 74 transitions. [2019-01-31 17:35:01,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:35:01,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 17:35:01,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:01,751 INFO L225 Difference]: With dead ends: 25 [2019-01-31 17:35:01,751 INFO L226 Difference]: Without dead ends: 24 [2019-01-31 17:35:01,755 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-01-31 17:35:01,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-31 17:35:01,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-01-31 17:35:01,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-31 17:35:01,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 73 transitions. [2019-01-31 17:35:01,766 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 73 transitions. Word has length 4 [2019-01-31 17:35:01,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:01,767 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 73 transitions. [2019-01-31 17:35:01,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:35:01,767 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 73 transitions. [2019-01-31 17:35:01,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:35:01,767 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:01,768 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:35:01,768 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:01,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:01,768 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2019-01-31 17:35:01,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:01,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:01,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:01,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:01,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:01,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:01,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:01,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:01,913 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:35:01,913 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [23] [2019-01-31 17:35:01,914 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:01,915 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:02,273 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:02,273 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-01-31 17:35:02,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:02,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:02,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:02,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 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-01-31 17:35:02,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:02,294 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:02,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:02,351 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-01-31 17:35:02,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, 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-01-31 17:35:02,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,362 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-01-31 17:35:02,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,377 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-01-31 17:35:02,389 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-01-31 17:35:02,390 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:02,416 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:02,432 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:02,443 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:02,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:02,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,475 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-01-31 17:35:02,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,503 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-01-31 17:35:02,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,567 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-01-31 17:35:02,567 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:02,576 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:02,586 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:02,607 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-01-31 17:35:02,607 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-31 17:35:02,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,657 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-01-31 17:35:02,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:02,688 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-01-31 17:35:02,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:35:02,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,721 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:02,723 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-01-31 17:35:02,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:02,762 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-01-31 17:35:02,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:29 [2019-01-31 17:35:02,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:02,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:02,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:02,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:02,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:35:02,837 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:02,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:35:02,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:35:02,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:35:02,838 INFO L87 Difference]: Start difference. First operand 23 states and 73 transitions. Second operand 8 states. [2019-01-31 17:35:03,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:03,331 INFO L93 Difference]: Finished difference Result 56 states and 117 transitions. [2019-01-31 17:35:03,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:35:03,332 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:35:03,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:03,333 INFO L225 Difference]: With dead ends: 56 [2019-01-31 17:35:03,333 INFO L226 Difference]: Without dead ends: 55 [2019-01-31 17:35:03,334 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-01-31 17:35:03,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-31 17:35:03,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 24. [2019-01-31 17:35:03,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-31 17:35:03,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 79 transitions. [2019-01-31 17:35:03,342 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 79 transitions. Word has length 4 [2019-01-31 17:35:03,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:03,343 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 79 transitions. [2019-01-31 17:35:03,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:35:03,343 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 79 transitions. [2019-01-31 17:35:03,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:35:03,344 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:03,344 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:35:03,344 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:03,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:03,344 INFO L82 PathProgramCache]: Analyzing trace with hash 941276, now seen corresponding path program 1 times [2019-01-31 17:35:03,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:03,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:03,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:03,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:03,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:03,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:03,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:03,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:03,412 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:35:03,413 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [23] [2019-01-31 17:35:03,414 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:03,414 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:03,695 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:03,695 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-01-31 17:35:03,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:03,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:03,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:03,696 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-01-31 17:35:03,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:03,713 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:03,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:03,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:03,767 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-01-31 17:35:03,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:03,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:03,828 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-01-31 17:35:03,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:03,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:03,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:03,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:03,870 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-01-31 17:35:03,870 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:03,879 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:03,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:03,908 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-01-31 17:35:03,912 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-01-31 17:35:03,916 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-01-31 17:35:03,926 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-01-31 17:35:03,934 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-01-31 17:35:03,935 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:03,956 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:03,976 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:03,989 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:04,001 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:04,024 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-01-31 17:35:04,025 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-31 17:35:04,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:04,071 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-01-31 17:35:04,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:04,091 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-01-31 17:35:04,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:35:04,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:04,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:04,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:04,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:04,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:04,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:04,122 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-01-31 17:35:04,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:04,149 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-01-31 17:35:04,149 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-31 17:35:04,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:04,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:04,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:04,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:04,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:35:04,223 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:04,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:35:04,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:35:04,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:35:04,224 INFO L87 Difference]: Start difference. First operand 24 states and 79 transitions. Second operand 8 states. [2019-01-31 17:35:04,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:04,574 INFO L93 Difference]: Finished difference Result 52 states and 120 transitions. [2019-01-31 17:35:04,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:35:04,575 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:35:04,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:04,576 INFO L225 Difference]: With dead ends: 52 [2019-01-31 17:35:04,577 INFO L226 Difference]: Without dead ends: 48 [2019-01-31 17:35:04,578 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-01-31 17:35:04,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-31 17:35:04,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 26. [2019-01-31 17:35:04,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-31 17:35:04,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-01-31 17:35:04,586 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-01-31 17:35:04,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:04,586 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-01-31 17:35:04,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:35:04,586 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-01-31 17:35:04,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:35:04,587 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:04,587 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:35:04,587 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:04,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:04,588 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2019-01-31 17:35:04,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:04,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:04,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:04,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:04,589 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:04,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:04,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:04,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:04,625 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:35:04,625 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [25] [2019-01-31 17:35:04,628 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:04,628 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:06,149 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:06,150 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-01-31 17:35:06,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:06,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:06,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:06,151 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-01-31 17:35:06,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:06,162 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:06,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:06,182 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-01-31 17:35:06,186 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-01-31 17:35:06,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,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-01-31 17:35:06,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,232 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-01-31 17:35:06,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,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, 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-01-31 17:35:06,295 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:06,327 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:06,342 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:06,354 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:06,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:06,386 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-01-31 17:35:06,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,404 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-01-31 17:35:06,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,466 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-01-31 17:35:06,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,514 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-01-31 17:35:06,515 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:06,529 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:06,544 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:06,603 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:06,634 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-01-31 17:35:06,635 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-31 17:35:06,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,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, 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-01-31 17:35:06,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:06,683 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-01-31 17:35:06,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-31 17:35:06,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:06,705 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:06,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:06,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:06,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:35:06,737 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:06,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:35:06,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:35:06,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:35:06,738 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 6 states. [2019-01-31 17:35:06,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:06,898 INFO L93 Difference]: Finished difference Result 42 states and 110 transitions. [2019-01-31 17:35:06,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:35:06,899 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-31 17:35:06,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:06,900 INFO L225 Difference]: With dead ends: 42 [2019-01-31 17:35:06,900 INFO L226 Difference]: Without dead ends: 41 [2019-01-31 17:35:06,900 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-01-31 17:35:06,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-31 17:35:06,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2019-01-31 17:35:06,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-31 17:35:06,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-01-31 17:35:06,909 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-01-31 17:35:06,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:06,909 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-01-31 17:35:06,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:35:06,909 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-01-31 17:35:06,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:35:06,909 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:06,910 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:35:06,910 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:06,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:06,910 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2019-01-31 17:35:06,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:06,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:06,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:06,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:06,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:06,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:06,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:06,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:06,968 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:35:06,968 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [23] [2019-01-31 17:35:06,969 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:06,970 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:07,621 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:07,621 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-01-31 17:35:07,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:07,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:07,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:07,622 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-01-31 17:35:07,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:07,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:07,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:07,675 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-01-31 17:35:07,678 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-01-31 17:35:07,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:07,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:07,691 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-01-31 17:35:07,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:07,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:07,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:07,704 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-01-31 17:35:07,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:07,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:07,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:07,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:07,719 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-01-31 17:35:07,719 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:07,839 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:07,856 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:07,868 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:07,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:07,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:07,907 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-01-31 17:35:07,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:07,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:07,941 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-01-31 17:35:07,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:07,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:07,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:07,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:07,982 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-01-31 17:35:08,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,031 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-01-31 17:35:08,031 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:08,047 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:08,063 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:08,080 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:08,111 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-01-31 17:35:08,112 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-31 17:35:08,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,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, 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-01-31 17:35:08,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:08,173 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-01-31 17:35:08,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:35:08,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,201 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-01-31 17:35:08,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:08,236 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-01-31 17:35:08,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-31 17:35:08,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:08,255 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:08,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:08,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:08,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:35:08,296 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:08,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:35:08,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:35:08,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:35:08,297 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 8 states. [2019-01-31 17:35:08,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:08,768 INFO L93 Difference]: Finished difference Result 54 states and 131 transitions. [2019-01-31 17:35:08,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:35:08,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:35:08,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:08,770 INFO L225 Difference]: With dead ends: 54 [2019-01-31 17:35:08,770 INFO L226 Difference]: Without dead ends: 53 [2019-01-31 17:35:08,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 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-01-31 17:35:08,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-31 17:35:08,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 27. [2019-01-31 17:35:08,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-31 17:35:08,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 96 transitions. [2019-01-31 17:35:08,780 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 96 transitions. Word has length 4 [2019-01-31 17:35:08,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:08,780 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 96 transitions. [2019-01-31 17:35:08,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:35:08,780 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 96 transitions. [2019-01-31 17:35:08,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:35:08,781 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:08,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:35:08,781 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:08,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:08,782 INFO L82 PathProgramCache]: Analyzing trace with hash 929868, now seen corresponding path program 1 times [2019-01-31 17:35:08,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:08,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:08,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:08,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:08,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:08,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:08,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:08,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:08,887 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:35:08,888 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [23] [2019-01-31 17:35:08,889 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:08,889 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:09,124 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:09,124 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-01-31 17:35:09,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:09,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:09,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:09,125 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-01-31 17:35:09,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:09,137 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:09,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:09,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,194 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-01-31 17:35:09,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,228 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-01-31 17:35:09,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,262 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-01-31 17:35:09,263 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:09,274 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:09,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:09,298 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-01-31 17:35:09,301 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-01-31 17:35:09,304 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-01-31 17:35:09,307 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-01-31 17:35:09,316 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-01-31 17:35:09,317 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:09,336 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:09,350 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:09,362 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:09,372 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:09,394 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-01-31 17:35:09,395 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-31 17:35:09,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,446 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-01-31 17:35:09,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:09,468 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-01-31 17:35:09,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:35:09,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,490 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-01-31 17:35:09,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:09,523 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-01-31 17:35:09,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-31 17:35:09,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:09,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:09,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:09,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:09,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:35:09,579 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:09,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:35:09,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:35:09,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:35:09,580 INFO L87 Difference]: Start difference. First operand 27 states and 96 transitions. Second operand 8 states. [2019-01-31 17:35:09,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:09,897 INFO L93 Difference]: Finished difference Result 63 states and 165 transitions. [2019-01-31 17:35:09,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:35:09,898 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:35:09,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:09,899 INFO L225 Difference]: With dead ends: 63 [2019-01-31 17:35:09,899 INFO L226 Difference]: Without dead ends: 61 [2019-01-31 17:35:09,900 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-01-31 17:35:09,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-31 17:35:09,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 32. [2019-01-31 17:35:09,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-31 17:35:09,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 113 transitions. [2019-01-31 17:35:09,912 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 113 transitions. Word has length 4 [2019-01-31 17:35:09,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:09,912 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 113 transitions. [2019-01-31 17:35:09,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:35:09,912 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 113 transitions. [2019-01-31 17:35:09,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:35:09,913 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:09,913 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:35:09,913 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:09,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:09,914 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2019-01-31 17:35:09,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:09,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:09,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:09,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:09,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:09,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:35:09,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:35:09,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 17:35:09,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:35:09,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:35:09,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:35:09,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:35:09,964 INFO L87 Difference]: Start difference. First operand 32 states and 113 transitions. Second operand 4 states. [2019-01-31 17:35:10,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:10,035 INFO L93 Difference]: Finished difference Result 41 states and 126 transitions. [2019-01-31 17:35:10,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:35:10,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 17:35:10,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:10,037 INFO L225 Difference]: With dead ends: 41 [2019-01-31 17:35:10,037 INFO L226 Difference]: Without dead ends: 40 [2019-01-31 17:35:10,038 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-01-31 17:35:10,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-31 17:35:10,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-01-31 17:35:10,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-31 17:35:10,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 118 transitions. [2019-01-31 17:35:10,047 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 118 transitions. Word has length 4 [2019-01-31 17:35:10,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:10,047 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 118 transitions. [2019-01-31 17:35:10,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:35:10,047 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 118 transitions. [2019-01-31 17:35:10,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:35:10,048 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:10,048 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:35:10,048 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:10,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:10,048 INFO L82 PathProgramCache]: Analyzing trace with hash 933712, now seen corresponding path program 2 times [2019-01-31 17:35:10,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:10,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:10,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:10,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:10,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:10,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:10,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:10,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:10,134 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:35:10,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:35:10,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:10,135 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-01-31 17:35:10,144 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:35:10,145 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:35:10,153 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-31 17:35:10,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:35:10,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:10,184 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-01-31 17:35:10,187 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-01-31 17:35:10,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,196 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-01-31 17:35:10,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,203 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-01-31 17:35:10,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,217 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-01-31 17:35:10,218 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:10,246 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:10,263 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:10,277 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:10,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:10,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,316 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-01-31 17:35:10,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,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 41 treesize of output 53 [2019-01-31 17:35:10,616 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-01-31 17:35:10,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,621 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-01-31 17:35:10,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,673 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-01-31 17:35:10,674 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:10,691 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:10,706 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:10,723 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:10,755 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-01-31 17:35:10,755 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-31 17:35:10,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,782 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-01-31 17:35:10,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:10,816 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-01-31 17:35:10,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:35:10,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,865 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:10,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-01-31 17:35:10,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:10,900 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-01-31 17:35:10,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:44 [2019-01-31 17:35:10,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-01-31 17:35:10,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:10,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:10,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:10,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:35:10,962 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:10,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:35:10,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:35:10,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:35:10,963 INFO L87 Difference]: Start difference. First operand 33 states and 118 transitions. Second operand 8 states. [2019-01-31 17:35:11,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:11,340 INFO L93 Difference]: Finished difference Result 57 states and 149 transitions. [2019-01-31 17:35:11,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:35:11,341 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:35:11,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:11,342 INFO L225 Difference]: With dead ends: 57 [2019-01-31 17:35:11,342 INFO L226 Difference]: Without dead ends: 55 [2019-01-31 17:35:11,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 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-01-31 17:35:11,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-31 17:35:11,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2019-01-31 17:35:11,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-31 17:35:11,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 117 transitions. [2019-01-31 17:35:11,353 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 117 transitions. Word has length 4 [2019-01-31 17:35:11,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:11,353 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 117 transitions. [2019-01-31 17:35:11,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:35:11,354 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 117 transitions. [2019-01-31 17:35:11,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:35:11,354 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:11,354 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:35:11,355 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:11,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:11,355 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2019-01-31 17:35:11,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:11,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:11,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:35:11,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:11,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:11,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:11,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:11,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:11,452 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:35:11,452 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [23] [2019-01-31 17:35:11,455 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:11,455 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:11,682 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:11,682 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-01-31 17:35:11,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:11,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:11,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:11,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 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-01-31 17:35:11,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:11,692 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:11,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:11,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:11,724 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-01-31 17:35:11,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:11,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:11,768 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-01-31 17:35:11,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:11,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:11,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:11,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:11,803 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-01-31 17:35:11,804 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:11,815 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:11,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:11,846 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-01-31 17:35:11,850 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-01-31 17:35:11,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, 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-01-31 17:35:11,855 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-01-31 17:35:11,864 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-01-31 17:35:11,865 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:11,884 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:11,899 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:11,910 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:11,920 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:11,943 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-01-31 17:35:11,943 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-31 17:35:11,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:11,975 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-01-31 17:35:11,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:11,996 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-01-31 17:35:11,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-31 17:35:12,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,022 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-01-31 17:35:12,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:12,044 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-01-31 17:35:12,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-31 17:35:12,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-01-31 17:35:12,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:12,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:12,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:12,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:35:12,102 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:12,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:35:12,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:35:12,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:35:12,103 INFO L87 Difference]: Start difference. First operand 33 states and 117 transitions. Second operand 8 states. [2019-01-31 17:35:12,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:12,436 INFO L93 Difference]: Finished difference Result 61 states and 173 transitions. [2019-01-31 17:35:12,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:35:12,437 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:35:12,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:12,438 INFO L225 Difference]: With dead ends: 61 [2019-01-31 17:35:12,438 INFO L226 Difference]: Without dead ends: 60 [2019-01-31 17:35:12,439 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-01-31 17:35:12,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-31 17:35:12,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-01-31 17:35:12,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-31 17:35:12,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 135 transitions. [2019-01-31 17:35:12,452 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 135 transitions. Word has length 4 [2019-01-31 17:35:12,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:12,452 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 135 transitions. [2019-01-31 17:35:12,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:35:12,453 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 135 transitions. [2019-01-31 17:35:12,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:35:12,453 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:12,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:35:12,454 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:12,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:12,454 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2019-01-31 17:35:12,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:12,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:12,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:12,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:12,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:12,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:12,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:12,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:12,527 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:35:12,527 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [25] [2019-01-31 17:35:12,529 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:12,529 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:12,685 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:12,685 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-01-31 17:35:12,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:12,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:12,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:12,686 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-01-31 17:35:12,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:12,696 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:12,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:12,711 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-01-31 17:35:12,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, 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-01-31 17:35:12,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,732 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-01-31 17:35:12,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,756 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-01-31 17:35:12,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,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 27 treesize of output 62 [2019-01-31 17:35:12,768 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:12,798 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:12,813 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:12,824 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:12,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:12,856 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-01-31 17:35:12,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,874 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-01-31 17:35:12,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,935 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-01-31 17:35:12,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,987 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-01-31 17:35:12,988 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:13,001 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:13,016 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:13,033 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:13,160 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-01-31 17:35:13,161 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-31 17:35:13,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:13,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, 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-01-31 17:35:13,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:13,207 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-01-31 17:35:13,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-31 17:35:13,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:13,224 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:13,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:13,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:13,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:35:13,257 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:13,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:35:13,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:35:13,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:35:13,258 INFO L87 Difference]: Start difference. First operand 36 states and 135 transitions. Second operand 6 states. [2019-01-31 17:35:13,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:13,406 INFO L93 Difference]: Finished difference Result 53 states and 161 transitions. [2019-01-31 17:35:13,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:35:13,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-31 17:35:13,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:13,407 INFO L225 Difference]: With dead ends: 53 [2019-01-31 17:35:13,407 INFO L226 Difference]: Without dead ends: 52 [2019-01-31 17:35:13,408 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-01-31 17:35:13,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-31 17:35:13,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2019-01-31 17:35:13,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-31 17:35:13,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 141 transitions. [2019-01-31 17:35:13,420 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 141 transitions. Word has length 4 [2019-01-31 17:35:13,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:13,420 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 141 transitions. [2019-01-31 17:35:13,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:35:13,420 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 141 transitions. [2019-01-31 17:35:13,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:35:13,421 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:13,421 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:35:13,421 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:13,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:13,422 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2019-01-31 17:35:13,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:13,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:13,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:13,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:13,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:13,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:13,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:13,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:13,608 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:35:13,609 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [23] [2019-01-31 17:35:13,610 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:13,610 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:13,840 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:13,840 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-01-31 17:35:13,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:13,840 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:13,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:13,841 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-01-31 17:35:13,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:13,857 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:13,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:14,048 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-31 17:35:14,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, 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-01-31 17:35:14,077 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-01-31 17:35:14,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:14,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:14,142 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-01-31 17:35:14,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:14,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:14,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:14,233 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-01-31 17:35:14,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:14,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:14,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:14,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:14,269 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-01-31 17:35:14,269 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:14,339 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:14,353 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:14,366 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:14,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:14,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:14,405 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-01-31 17:35:14,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:14,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:14,440 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-01-31 17:35:14,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:14,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:14,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:14,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:14,496 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-01-31 17:35:14,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:14,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:14,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:14,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:14,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:14,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:14,545 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-01-31 17:35:14,545 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:14,562 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:14,579 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:14,596 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:14,686 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-01-31 17:35:14,687 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-31 17:35:14,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:14,709 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-01-31 17:35:14,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:14,740 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-01-31 17:35:14,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:35:14,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:14,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:14,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:14,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:14,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:14,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:14,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:14,890 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-01-31 17:35:14,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:14,965 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-01-31 17:35:14,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-31 17:35:14,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:14,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:15,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:15,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:15,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:35:15,043 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:15,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:35:15,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:35:15,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:35:15,044 INFO L87 Difference]: Start difference. First operand 37 states and 141 transitions. Second operand 8 states. [2019-01-31 17:35:15,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:15,430 INFO L93 Difference]: Finished difference Result 69 states and 192 transitions. [2019-01-31 17:35:15,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:35:15,430 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:35:15,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:15,431 INFO L225 Difference]: With dead ends: 69 [2019-01-31 17:35:15,431 INFO L226 Difference]: Without dead ends: 68 [2019-01-31 17:35:15,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:35:15,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-31 17:35:15,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 39. [2019-01-31 17:35:15,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-31 17:35:15,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 153 transitions. [2019-01-31 17:35:15,444 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 153 transitions. Word has length 4 [2019-01-31 17:35:15,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:15,444 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 153 transitions. [2019-01-31 17:35:15,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:35:15,444 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 153 transitions. [2019-01-31 17:35:15,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:35:15,445 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:15,445 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-31 17:35:15,446 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:15,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:15,446 INFO L82 PathProgramCache]: Analyzing trace with hash 29182896, now seen corresponding path program 2 times [2019-01-31 17:35:15,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:15,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:15,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:15,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:15,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:15,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:35:15,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:15,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:15,535 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:35:15,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:35:15,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:15,535 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-01-31 17:35:15,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:35:15,546 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:35:15,552 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:35:15,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:35:15,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:15,582 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-01-31 17:35:15,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, 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-01-31 17:35:15,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,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 23 treesize of output 37 [2019-01-31 17:35:15,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,607 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-01-31 17:35:15,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,619 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-01-31 17:35:15,620 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:15,881 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:15,898 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:15,910 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:15,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:15,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,947 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-01-31 17:35:15,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,981 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-01-31 17:35:16,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:16,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:16,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:16,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:16,018 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-01-31 17:35:16,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:16,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:16,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:16,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:16,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:16,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:16,082 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-01-31 17:35:16,082 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:16,099 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:16,115 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:16,132 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:16,161 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-01-31 17:35:16,162 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:69, output treesize:66 [2019-01-31 17:35:16,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:16,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, 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-01-31 17:35:16,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:16,217 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-01-31 17:35:16,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:35:16,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:16,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:16,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:16,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:16,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:16,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:16,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:16,241 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-01-31 17:35:16,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:16,274 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-01-31 17:35:16,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:50 [2019-01-31 17:35:16,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:16,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:16,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:16,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:16,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:16,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:16,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:16,308 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-01-31 17:35:16,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:16,341 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-01-31 17:35:16,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-31 17:35:16,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:16,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:16,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:16,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:16,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-31 17:35:16,400 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:16,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:35:16,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:35:16,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:35:16,401 INFO L87 Difference]: Start difference. First operand 39 states and 153 transitions. Second operand 9 states. [2019-01-31 17:35:16,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:16,773 INFO L93 Difference]: Finished difference Result 73 states and 219 transitions. [2019-01-31 17:35:16,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:35:16,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-31 17:35:16,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:16,775 INFO L225 Difference]: With dead ends: 73 [2019-01-31 17:35:16,776 INFO L226 Difference]: Without dead ends: 71 [2019-01-31 17:35:16,776 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-01-31 17:35:16,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-31 17:35:16,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 42. [2019-01-31 17:35:16,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-31 17:35:16,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 171 transitions. [2019-01-31 17:35:16,790 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 171 transitions. Word has length 5 [2019-01-31 17:35:16,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:16,790 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 171 transitions. [2019-01-31 17:35:16,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:35:16,791 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 171 transitions. [2019-01-31 17:35:16,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:35:16,791 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:16,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:35:16,792 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:16,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:16,792 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2019-01-31 17:35:16,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:16,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:16,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:35:16,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:16,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:16,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:16,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:16,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:16,903 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:35:16,903 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [25] [2019-01-31 17:35:16,904 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:16,905 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:17,185 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:17,186 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-01-31 17:35:17,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:17,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:17,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:17,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-31 17:35:17,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:17,198 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:17,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:17,209 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-01-31 17:35:17,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, 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-01-31 17:35:17,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,233 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-01-31 17:35:17,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,247 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-01-31 17:35:17,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,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 27 treesize of output 62 [2019-01-31 17:35:17,264 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:17,293 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:17,308 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:17,320 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:17,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:17,350 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-01-31 17:35:17,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,367 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-01-31 17:35:17,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,411 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-01-31 17:35:17,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,460 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-01-31 17:35:17,460 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:17,475 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:17,490 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:17,506 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:17,534 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-01-31 17:35:17,535 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:35:17,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,636 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-01-31 17:35:17,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:17,671 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-01-31 17:35:17,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:35:17,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,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, 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-01-31 17:35:17,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:17,731 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-01-31 17:35:17,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:36 [2019-01-31 17:35:17,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:17,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:17,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:17,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:17,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:35:17,788 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:17,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:35:17,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:35:17,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:35:17,789 INFO L87 Difference]: Start difference. First operand 42 states and 171 transitions. Second operand 8 states. [2019-01-31 17:35:18,235 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-01-31 17:35:18,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:18,447 INFO L93 Difference]: Finished difference Result 84 states and 258 transitions. [2019-01-31 17:35:18,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:35:18,448 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:35:18,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:18,450 INFO L225 Difference]: With dead ends: 84 [2019-01-31 17:35:18,450 INFO L226 Difference]: Without dead ends: 78 [2019-01-31 17:35:18,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:35:18,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-31 17:35:18,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 48. [2019-01-31 17:35:18,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-31 17:35:18,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 218 transitions. [2019-01-31 17:35:18,467 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 218 transitions. Word has length 5 [2019-01-31 17:35:18,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:18,467 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 218 transitions. [2019-01-31 17:35:18,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:35:18,467 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 218 transitions. [2019-01-31 17:35:18,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:35:18,468 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:18,468 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:35:18,469 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:18,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:18,469 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2019-01-31 17:35:18,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:18,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:18,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:18,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:18,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:18,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:18,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:18,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:18,603 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:35:18,603 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [23] [2019-01-31 17:35:18,606 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:18,606 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:18,907 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:18,907 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-01-31 17:35:18,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:18,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:18,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:18,908 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-01-31 17:35:18,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:18,917 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:18,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:18,948 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-01-31 17:35:18,952 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-01-31 17:35:18,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:18,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:18,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 23 treesize of output 37 [2019-01-31 17:35:18,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:18,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:18,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:18,975 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-01-31 17:35:18,988 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-01-31 17:35:18,989 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:19,008 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:19,023 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:19,035 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:19,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:19,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:19,070 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-01-31 17:35:19,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:19,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:19,098 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-01-31 17:35:19,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:19,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:19,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:19,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:19,133 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-01-31 17:35:19,133 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:19,142 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:19,152 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:19,174 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-01-31 17:35:19,174 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-31 17:35:19,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:19,214 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-01-31 17:35:19,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:35:19,280 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-01-31 17:35:19,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:74 [2019-01-31 17:35:19,802 WARN L181 SmtUtils]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-31 17:35:19,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:19,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:19,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:19,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:20,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:20,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:20,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:20,135 INFO L303 Elim1Store]: Index analysis took 326 ms [2019-01-31 17:35:20,487 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-01-31 17:35:20,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-31 17:35:21,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,202 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:21,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, 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-01-31 17:35:21,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:21,324 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-01-31 17:35:21,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:96, output treesize:167 [2019-01-31 17:35:21,459 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-01-31 17:35:21,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,475 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:21,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 37 treesize of output 86 [2019-01-31 17:35:21,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:21,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,577 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-01-31 17:35:21,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:21,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,659 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:21,660 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-01-31 17:35:21,660 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:21,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,748 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:21,749 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-01-31 17:35:21,750 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:21,818 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-01-31 17:35:21,818 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:121 [2019-01-31 17:35:21,943 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:21,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:22,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:22,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:22,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:35:22,024 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:22,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:35:22,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:35:22,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:35:22,024 INFO L87 Difference]: Start difference. First operand 48 states and 218 transitions. Second operand 10 states. [2019-01-31 17:35:22,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:22,899 INFO L93 Difference]: Finished difference Result 109 states and 322 transitions. [2019-01-31 17:35:22,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:35:22,900 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:35:22,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:22,901 INFO L225 Difference]: With dead ends: 109 [2019-01-31 17:35:22,902 INFO L226 Difference]: Without dead ends: 107 [2019-01-31 17:35:22,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:35:22,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-31 17:35:22,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 51. [2019-01-31 17:35:22,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-31 17:35:22,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 236 transitions. [2019-01-31 17:35:22,918 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 236 transitions. Word has length 5 [2019-01-31 17:35:22,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:22,918 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 236 transitions. [2019-01-31 17:35:22,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:35:22,918 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 236 transitions. [2019-01-31 17:35:22,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:35:22,919 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:22,919 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:35:22,920 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:22,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:22,920 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2019-01-31 17:35:22,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:22,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:22,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:22,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:22,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:23,167 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2019-01-31 17:35:23,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:35:23,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:23,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:23,184 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:35:23,184 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [25] [2019-01-31 17:35:23,185 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:23,185 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:23,391 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:23,391 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-01-31 17:35:23,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:23,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:23,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:23,392 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-01-31 17:35:23,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:23,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:23,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:23,428 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-01-31 17:35:23,432 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-01-31 17:35:23,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:23,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:23,444 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-01-31 17:35:23,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:23,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:23,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:23,455 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-01-31 17:35:23,464 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-01-31 17:35:23,465 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:23,489 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:23,503 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:23,515 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:23,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:23,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:23,549 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-01-31 17:35:23,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:23,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:23,578 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-01-31 17:35:23,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:23,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:23,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:23,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:23,609 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-01-31 17:35:23,610 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:23,620 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:23,630 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:23,651 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-01-31 17:35:23,652 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-31 17:35:23,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:23,733 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-01-31 17:35:23,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:23,954 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-01-31 17:35:23,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:35:23,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:23,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:23,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:23,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:23,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:23,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:23,998 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-01-31 17:35:23,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:24,020 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-01-31 17:35:24,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-31 17:35:24,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:24,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:24,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:24,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:24,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:35:24,078 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:24,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:35:24,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:35:24,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:35:24,079 INFO L87 Difference]: Start difference. First operand 51 states and 236 transitions. Second operand 8 states. [2019-01-31 17:35:24,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:24,443 INFO L93 Difference]: Finished difference Result 77 states and 292 transitions. [2019-01-31 17:35:24,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:35:24,444 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:35:24,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:24,445 INFO L225 Difference]: With dead ends: 77 [2019-01-31 17:35:24,446 INFO L226 Difference]: Without dead ends: 76 [2019-01-31 17:35:24,446 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-01-31 17:35:24,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-31 17:35:24,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-01-31 17:35:24,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-31 17:35:24,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 261 transitions. [2019-01-31 17:35:24,469 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 261 transitions. Word has length 5 [2019-01-31 17:35:24,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:24,470 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 261 transitions. [2019-01-31 17:35:24,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:35:24,470 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 261 transitions. [2019-01-31 17:35:24,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:35:24,470 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:24,470 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:35:24,471 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:24,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:24,471 INFO L82 PathProgramCache]: Analyzing trace with hash 29175642, now seen corresponding path program 2 times [2019-01-31 17:35:24,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:24,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:24,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:24,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:24,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:24,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:24,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:24,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:24,592 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:35:24,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:35:24,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:24,593 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-01-31 17:35:24,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:35:24,604 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:35:24,610 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:35:24,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:35:24,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:24,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:24,637 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-01-31 17:35:24,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:24,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:24,673 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-01-31 17:35:24,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:24,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:24,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:24,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:24,713 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-01-31 17:35:24,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:24,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:24,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:24,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:24,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:24,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:24,761 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-01-31 17:35:24,762 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:24,778 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:24,794 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:24,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:24,832 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-01-31 17:35:24,835 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-01-31 17:35:24,837 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-01-31 17:35:24,840 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-01-31 17:35:24,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, 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-01-31 17:35:24,844 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:24,870 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:24,884 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:24,896 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:24,904 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:24,933 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-01-31 17:35:24,934 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-31 17:35:24,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:24,967 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-01-31 17:35:24,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:24,996 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-01-31 17:35:24,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-31 17:35:25,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:25,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:25,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:25,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:25,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:25,028 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:25,029 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-01-31 17:35:25,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:25,061 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-01-31 17:35:25,062 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:42 [2019-01-31 17:35:25,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:25,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:25,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:25,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:25,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:25,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:25,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:25,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:25,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:25,100 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-01-31 17:35:25,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:25,142 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-01-31 17:35:25,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-31 17:35:25,162 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:25,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:25,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:25,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:25,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:35:25,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:25,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:35:25,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:35:25,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:35:25,273 INFO L87 Difference]: Start difference. First operand 55 states and 261 transitions. Second operand 10 states. [2019-01-31 17:35:25,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:25,850 INFO L93 Difference]: Finished difference Result 88 states and 340 transitions. [2019-01-31 17:35:25,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:35:25,855 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:35:25,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:25,856 INFO L225 Difference]: With dead ends: 88 [2019-01-31 17:35:25,856 INFO L226 Difference]: Without dead ends: 83 [2019-01-31 17:35:25,857 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-01-31 17:35:25,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-31 17:35:25,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2019-01-31 17:35:25,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-31 17:35:25,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-01-31 17:35:25,879 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-01-31 17:35:25,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:25,879 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-01-31 17:35:25,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:35:25,879 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-01-31 17:35:25,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:35:25,880 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:25,880 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:35:25,880 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:25,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:25,881 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2019-01-31 17:35:25,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:25,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:25,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:35:25,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:25,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:25,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:25,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:25,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:25,935 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:35:25,935 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [25] [2019-01-31 17:35:25,936 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:25,937 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:26,214 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:26,214 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-01-31 17:35:26,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:26,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:26,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:26,215 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-01-31 17:35:26,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:26,230 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:26,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:26,267 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-01-31 17:35:26,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, 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-01-31 17:35:26,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:26,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35: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, 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-01-31 17:35:26,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:26,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:26,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:26,485 INFO L303 Elim1Store]: Index analysis took 105 ms [2019-01-31 17:35:26,486 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-01-31 17:35:26,614 INFO L303 Elim1Store]: Index analysis took 125 ms [2019-01-31 17:35:26,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, 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-01-31 17:35:26,616 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:26,853 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:26,865 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:26,874 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:26,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:26,902 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-01-31 17:35:26,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:26,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:26,916 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-01-31 17:35:26,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:26,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:26,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:26,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:26,944 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-01-31 17:35:26,945 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:26,954 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:26,963 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:26,983 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-01-31 17:35:26,983 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-31 17:35:27,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:27,013 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-01-31 17:35:27,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:27,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:27,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-31 17:35:27,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:27,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:27,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:27,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:27,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:27,051 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-01-31 17:35:27,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:27,066 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-01-31 17:35:27,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-01-31 17:35:27,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:27,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:27,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:27,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:27,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:35:27,121 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:27,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:35:27,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:35:27,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:35:27,122 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 8 states. [2019-01-31 17:35:27,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:27,386 INFO L93 Difference]: Finished difference Result 81 states and 298 transitions. [2019-01-31 17:35:27,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:35:27,387 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:35:27,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:27,388 INFO L225 Difference]: With dead ends: 81 [2019-01-31 17:35:27,388 INFO L226 Difference]: Without dead ends: 80 [2019-01-31 17:35:27,389 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-01-31 17:35:27,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-31 17:35:27,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 61. [2019-01-31 17:35:27,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-31 17:35:27,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-01-31 17:35:27,404 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-01-31 17:35:27,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:27,404 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-01-31 17:35:27,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:35:27,405 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-01-31 17:35:27,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:35:27,405 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:27,405 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:35:27,405 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:27,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:27,406 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2019-01-31 17:35:27,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:27,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:27,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:27,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:27,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:27,579 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:27,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:27,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:27,580 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:35:27,580 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [23] [2019-01-31 17:35:27,581 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:27,581 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:28,006 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:28,007 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-01-31 17:35:28,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:28,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:28,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:28,007 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-01-31 17:35:28,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:28,021 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:28,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:28,157 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-31 17:35:28,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,159 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-01-31 17:35:28,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,197 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-01-31 17:35:28,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,229 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-01-31 17:35:28,229 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:28,238 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:28,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:28,262 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-01-31 17:35:28,265 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-01-31 17:35:28,268 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-01-31 17:35:28,270 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-01-31 17:35:28,275 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-01-31 17:35:28,275 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:28,293 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:28,307 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:28,319 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:28,329 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:28,350 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-01-31 17:35:28,350 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-31 17:35:28,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,420 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-01-31 17:35:28,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:28,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:28,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:35:28,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,466 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-01-31 17:35:28,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:28,488 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-01-31 17:35:28,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:35:28,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,514 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:28,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,516 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-01-31 17:35:28,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:28,541 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-01-31 17:35:28,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-31 17:35:28,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:28,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:28,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:28,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:28,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:35:28,624 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:28,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:35:28,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:35:28,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:35:28,624 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 10 states. [2019-01-31 17:35:29,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:29,127 INFO L93 Difference]: Finished difference Result 113 states and 415 transitions. [2019-01-31 17:35:29,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:35:29,128 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:35:29,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:29,130 INFO L225 Difference]: With dead ends: 113 [2019-01-31 17:35:29,130 INFO L226 Difference]: Without dead ends: 112 [2019-01-31 17:35:29,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:35:29,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-31 17:35:29,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 60. [2019-01-31 17:35:29,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-31 17:35:29,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 267 transitions. [2019-01-31 17:35:29,151 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 267 transitions. Word has length 5 [2019-01-31 17:35:29,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:29,151 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 267 transitions. [2019-01-31 17:35:29,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:35:29,151 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 267 transitions. [2019-01-31 17:35:29,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:35:29,151 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:29,151 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:35:29,152 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:29,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:29,152 INFO L82 PathProgramCache]: Analyzing trace with hash 29242478, now seen corresponding path program 1 times [2019-01-31 17:35:29,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:29,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:29,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:29,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:29,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:29,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:29,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:29,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:29,286 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:35:29,286 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [23] [2019-01-31 17:35:29,288 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:29,288 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:29,677 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:29,677 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-01-31 17:35:29,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:29,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:29,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:29,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 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-01-31 17:35:29,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:29,694 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:29,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:29,760 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-01-31 17:35:29,763 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-01-31 17:35:29,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:29,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:29,770 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-01-31 17:35:29,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:29,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:29,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:29,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, 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-01-31 17:35:29,811 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-01-31 17:35:29,812 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:29,830 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:29,846 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:29,856 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:29,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:29,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:29,891 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-01-31 17:35:29,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:29,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:29,935 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-01-31 17:35:29,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:29,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:29,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:29,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:29,967 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-01-31 17:35:29,968 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:29,978 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:29,987 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:30,009 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-01-31 17:35:30,010 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-31 17:35:30,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,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-01-31 17:35:30,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-31 17:35:30,287 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-01-31 17:35:30,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:183 [2019-01-31 17:35:30,802 WARN L181 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 58 [2019-01-31 17:35:30,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,812 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:30,813 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-01-31 17:35:30,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:30,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,888 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 57 [2019-01-31 17:35:30,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:30,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,974 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-01-31 17:35:30,975 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:31,035 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-01-31 17:35:31,035 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:130, output treesize:96 [2019-01-31 17:35:31,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,110 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-01-31 17:35:31,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:31,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,174 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:31,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, 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-01-31 17:35:31,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:31,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,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, 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-01-31 17:35:31,264 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:31,333 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-01-31 17:35:31,333 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:130, output treesize:88 [2019-01-31 17:35:31,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:31,380 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:31,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:31,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:31,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-31 17:35:31,415 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:31,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:35:31,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:35:31,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:35:31,416 INFO L87 Difference]: Start difference. First operand 60 states and 267 transitions. Second operand 10 states. [2019-01-31 17:35:31,850 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-01-31 17:35:32,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:32,314 INFO L93 Difference]: Finished difference Result 137 states and 516 transitions. [2019-01-31 17:35:32,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:35:32,315 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:35:32,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:32,317 INFO L225 Difference]: With dead ends: 137 [2019-01-31 17:35:32,317 INFO L226 Difference]: Without dead ends: 136 [2019-01-31 17:35:32,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:35:32,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-31 17:35:32,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-01-31 17:35:32,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-31 17:35:32,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 468 transitions. [2019-01-31 17:35:32,350 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 468 transitions. Word has length 5 [2019-01-31 17:35:32,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:32,351 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 468 transitions. [2019-01-31 17:35:32,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:35:32,351 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 468 transitions. [2019-01-31 17:35:32,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:35:32,351 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:32,352 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:35:32,352 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:32,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:32,352 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2019-01-31 17:35:32,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:32,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:32,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:32,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:32,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:32,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:35:32,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:32,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:32,461 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:35:32,461 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [25] [2019-01-31 17:35:32,462 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:32,462 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:33,098 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:33,098 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-01-31 17:35:33,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:33,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:33,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:33,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 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-01-31 17:35:33,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:33,113 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:33,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:33,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,212 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-01-31 17:35:33,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,249 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-01-31 17:35:33,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,289 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-01-31 17:35:33,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,339 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-01-31 17:35:33,340 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:33,356 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:33,372 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:33,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:33,413 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-01-31 17:35:33,416 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-01-31 17:35:33,419 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-01-31 17:35:33,426 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-01-31 17:35:33,429 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-01-31 17:35:33,429 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:33,453 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:33,467 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:33,479 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:33,489 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:33,520 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-01-31 17:35:33,520 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-31 17:35:33,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,545 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-01-31 17:35:33,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:33,596 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-01-31 17:35:33,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:35:33,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,651 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:33,652 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-01-31 17:35:33,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:33,685 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-01-31 17:35:33,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-01-31 17:35:33,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:33,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:33,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:33,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:33,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:35:33,749 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:33,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:35:33,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:35:33,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:35:33,750 INFO L87 Difference]: Start difference. First operand 93 states and 468 transitions. Second operand 8 states. [2019-01-31 17:35:34,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:34,189 INFO L93 Difference]: Finished difference Result 120 states and 513 transitions. [2019-01-31 17:35:34,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:35:34,189 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:35:34,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:34,191 INFO L225 Difference]: With dead ends: 120 [2019-01-31 17:35:34,191 INFO L226 Difference]: Without dead ends: 119 [2019-01-31 17:35:34,192 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-01-31 17:35:34,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-31 17:35:34,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2019-01-31 17:35:34,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-31 17:35:34,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 486 transitions. [2019-01-31 17:35:34,235 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 486 transitions. Word has length 5 [2019-01-31 17:35:34,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:34,236 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 486 transitions. [2019-01-31 17:35:34,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:35:34,236 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 486 transitions. [2019-01-31 17:35:34,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:35:34,236 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:34,237 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:35:34,237 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:34,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:34,237 INFO L82 PathProgramCache]: Analyzing trace with hash 29248868, now seen corresponding path program 1 times [2019-01-31 17:35:34,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:34,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:34,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:34,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:34,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:34,454 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-31 17:35:34,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:34,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:34,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:34,581 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:35:34,581 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [27] [2019-01-31 17:35:34,582 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:34,582 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:36,414 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:36,414 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-01-31 17:35:36,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:36,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:36,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:36,415 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-01-31 17:35:36,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:36,423 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:36,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:36,434 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-01-31 17:35:36,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, 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-01-31 17:35:36,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,450 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-01-31 17:35:36,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,463 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-01-31 17:35:36,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,477 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-01-31 17:35:36,478 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:36,511 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:36,526 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:36,536 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:36,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:36,569 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-01-31 17:35:36,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,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 36 treesize of output 49 [2019-01-31 17:35:36,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,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, 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-01-31 17:35:36,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,669 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-01-31 17:35:36,670 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:36,683 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:36,698 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:36,715 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:36,743 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-01-31 17:35:36,744 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-31 17:35:36,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,762 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-01-31 17:35:36,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:36,790 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-01-31 17:35:36,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-31 17:35:36,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:36,954 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:36,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:36,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:35:36,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-31 17:35:36,980 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:35:36,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:35:36,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:35:36,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:35:36,981 INFO L87 Difference]: Start difference. First operand 96 states and 486 transitions. Second operand 4 states. [2019-01-31 17:35:37,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:37,131 INFO L93 Difference]: Finished difference Result 105 states and 515 transitions. [2019-01-31 17:35:37,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:35:37,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-31 17:35:37,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:37,133 INFO L225 Difference]: With dead ends: 105 [2019-01-31 17:35:37,133 INFO L226 Difference]: Without dead ends: 104 [2019-01-31 17:35:37,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:35:37,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-31 17:35:37,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-01-31 17:35:37,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-31 17:35:37,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 513 transitions. [2019-01-31 17:35:37,185 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 513 transitions. Word has length 5 [2019-01-31 17:35:37,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:37,185 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 513 transitions. [2019-01-31 17:35:37,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:35:37,186 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 513 transitions. [2019-01-31 17:35:37,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:35:37,186 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:37,186 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:35:37,187 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:37,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:37,187 INFO L82 PathProgramCache]: Analyzing trace with hash 29235162, now seen corresponding path program 3 times [2019-01-31 17:35:37,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:37,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:37,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:37,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:37,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:37,736 WARN L181 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2019-01-31 17:35:38,068 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-01-31 17:35:38,102 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:38,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:38,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:38,103 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:35:38,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:35:38,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:38,104 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-01-31 17:35:38,114 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:35:38,114 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:35:38,119 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:35:38,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:35:38,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:38,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, 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-01-31 17:35:38,142 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-01-31 17:35:38,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,149 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-01-31 17:35:38,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,155 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-01-31 17:35:38,163 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-01-31 17:35:38,164 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:38,183 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:38,199 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:38,211 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:38,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:38,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,245 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-01-31 17:35:38,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,273 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-01-31 17:35:38,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,305 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-01-31 17:35:38,305 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:38,315 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:38,325 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:38,347 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-01-31 17:35:38,347 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-31 17:35:38,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,412 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-01-31 17:35:38,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-31 17:35:38,588 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-01-31 17:35:38,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:183 [2019-01-31 17:35:38,721 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-01-31 17:35:38,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,734 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-01-31 17:35:38,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:38,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,830 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-01-31 17:35:38,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:38,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,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 43 treesize of output 65 [2019-01-31 17:35:38,918 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:38,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:38,996 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:38,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, 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-01-31 17:35:38,997 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:39,058 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-01-31 17:35:39,058 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:173, output treesize:121 [2019-01-31 17:35:39,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:39,135 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-01-31 17:35:39,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:39,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:39,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:39,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:39,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:39,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:39,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:39,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:39,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:39,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:39,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:39,228 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:39,229 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-01-31 17:35:39,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:39,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:39,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:39,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:39,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:39,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:39,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:39,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:39,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:39,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:39,322 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:39,323 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-01-31 17:35:39,324 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:39,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:39,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:39,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:39,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:39,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:39,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:39,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:39,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:39,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:39,410 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:39,411 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 72 [2019-01-31 17:35:39,412 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:39,480 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-01-31 17:35:39,480 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:123 [2019-01-31 17:35:39,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:39,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:39,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:39,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:39,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:35:39,627 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:39,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:35:39,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:35:39,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:35:39,628 INFO L87 Difference]: Start difference. First operand 103 states and 513 transitions. Second operand 10 states. [2019-01-31 17:35:40,033 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-01-31 17:35:40,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:40,383 INFO L93 Difference]: Finished difference Result 131 states and 560 transitions. [2019-01-31 17:35:40,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:35:40,384 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:35:40,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:40,386 INFO L225 Difference]: With dead ends: 131 [2019-01-31 17:35:40,386 INFO L226 Difference]: Without dead ends: 130 [2019-01-31 17:35:40,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:35:40,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-31 17:35:40,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 41. [2019-01-31 17:35:40,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-31 17:35:40,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 140 transitions. [2019-01-31 17:35:40,409 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 140 transitions. Word has length 5 [2019-01-31 17:35:40,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:40,409 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 140 transitions. [2019-01-31 17:35:40,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:35:40,410 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 140 transitions. [2019-01-31 17:35:40,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:35:40,410 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:40,410 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:35:40,411 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:40,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:40,411 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2019-01-31 17:35:40,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:40,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:40,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:35:40,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:40,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:40,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:40,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:40,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:40,513 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:35:40,513 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [25] [2019-01-31 17:35:40,514 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:40,514 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:41,035 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:41,035 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-01-31 17:35:41,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:41,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:41,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:41,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 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-01-31 17:35:41,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:41,047 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:41,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:41,058 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-01-31 17:35:41,063 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-01-31 17:35:41,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,072 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-01-31 17:35:41,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,089 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-01-31 17:35:41,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,110 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-01-31 17:35:41,110 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:41,143 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:41,157 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:41,169 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:41,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:41,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 43 treesize of output 39 [2019-01-31 17:35:41,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,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 36 treesize of output 49 [2019-01-31 17:35:41,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,262 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-01-31 17:35:41,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,311 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-01-31 17:35:41,311 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:41,327 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:41,342 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:41,358 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:41,387 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-01-31 17:35:41,388 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:35:41,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,413 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-01-31 17:35:41,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:41,442 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-01-31 17:35:41,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:35:41,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,516 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:41,517 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-01-31 17:35:41,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:41,547 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-01-31 17:35:41,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-31 17:35:41,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:41,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:41,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:41,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:41,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:35:41,611 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:41,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:35:41,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:35:41,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:35:41,612 INFO L87 Difference]: Start difference. First operand 41 states and 140 transitions. Second operand 8 states. [2019-01-31 17:35:42,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:42,091 INFO L93 Difference]: Finished difference Result 71 states and 187 transitions. [2019-01-31 17:35:42,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:35:42,092 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:35:42,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:42,093 INFO L225 Difference]: With dead ends: 71 [2019-01-31 17:35:42,093 INFO L226 Difference]: Without dead ends: 68 [2019-01-31 17:35:42,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:35:42,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-31 17:35:42,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2019-01-31 17:35:42,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-31 17:35:42,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 160 transitions. [2019-01-31 17:35:42,122 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 160 transitions. Word has length 5 [2019-01-31 17:35:42,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:42,122 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 160 transitions. [2019-01-31 17:35:42,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:35:42,122 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 160 transitions. [2019-01-31 17:35:42,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:35:42,123 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:42,123 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:35:42,123 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:42,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:42,123 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2019-01-31 17:35:42,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:42,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:42,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:42,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:42,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:42,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:42,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:35:42,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:42,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:42,284 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:35:42,285 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [25] [2019-01-31 17:35:42,287 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:42,287 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:42,518 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:42,519 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-01-31 17:35:42,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:42,519 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:42,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:42,519 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-01-31 17:35:42,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:42,528 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:42,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:42,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,556 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-01-31 17:35:42,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,602 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-01-31 17:35:42,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,636 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-01-31 17:35:42,636 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:42,647 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:42,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:42,672 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-01-31 17:35:42,675 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-01-31 17:35:42,678 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-01-31 17:35:42,680 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-01-31 17:35:42,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-31 17:35:42,712 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:42,730 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:42,745 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:42,756 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:42,766 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:42,788 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-01-31 17:35:42,788 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-31 17:35:42,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,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, 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-01-31 17:35:42,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:42,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-01-31 17:35:42,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-31 17:35:42,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,856 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-01-31 17:35:42,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:42,879 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-01-31 17:35:42,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-31 17:35:42,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:42,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:42,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:42,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:42,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:35:42,924 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:42,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:35:42,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:35:42,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:35:42,925 INFO L87 Difference]: Start difference. First operand 46 states and 160 transitions. Second operand 8 states. [2019-01-31 17:35:43,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:43,207 INFO L93 Difference]: Finished difference Result 73 states and 194 transitions. [2019-01-31 17:35:43,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:35:43,207 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:35:43,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:43,208 INFO L225 Difference]: With dead ends: 73 [2019-01-31 17:35:43,208 INFO L226 Difference]: Without dead ends: 72 [2019-01-31 17:35:43,209 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-01-31 17:35:43,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-31 17:35:43,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 47. [2019-01-31 17:35:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-31 17:35:43,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 166 transitions. [2019-01-31 17:35:43,237 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 166 transitions. Word has length 5 [2019-01-31 17:35:43,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:43,237 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 166 transitions. [2019-01-31 17:35:43,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:35:43,237 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 166 transitions. [2019-01-31 17:35:43,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:35:43,238 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:43,238 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:35:43,238 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:43,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:43,239 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2019-01-31 17:35:43,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:43,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:43,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:43,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:43,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:43,392 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2019-01-31 17:35:43,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:43,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:43,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:43,421 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:35:43,422 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [25] [2019-01-31 17:35:43,423 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:43,423 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:43,640 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:43,640 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-01-31 17:35:43,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:43,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:43,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:43,641 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-01-31 17:35:43,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:43,651 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:43,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:43,677 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-01-31 17:35:43,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, 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-01-31 17:35:43,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:43,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:43,692 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-01-31 17:35:43,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:43,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:43,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:43,702 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-01-31 17:35:43,718 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-01-31 17:35:43,719 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:43,738 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:43,754 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:43,765 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:43,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:43,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:43,798 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-01-31 17:35:43,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:43,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:43,827 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-01-31 17:35:43,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:43,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:43,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:43,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:43,868 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-01-31 17:35:43,868 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:43,879 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:43,888 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:43,910 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-01-31 17:35:43,911 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-31 17:35:43,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:43,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 51 [2019-01-31 17:35:43,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:43,968 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-01-31 17:35:43,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:35:43,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:43,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:44,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:44,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:44,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:44,003 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:44,003 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-01-31 17:35:44,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:44,025 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-01-31 17:35:44,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-31 17:35:44,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:44,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:44,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-01-31 17:35:44,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:44,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-01-31 17:35:44,086 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:44,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:35:44,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:35:44,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:35:44,086 INFO L87 Difference]: Start difference. First operand 47 states and 166 transitions. Second operand 9 states. [2019-01-31 17:35:44,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:44,329 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-01-31 17:35:44,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:35:44,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-31 17:35:44,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:44,331 INFO L225 Difference]: With dead ends: 66 [2019-01-31 17:35:44,331 INFO L226 Difference]: Without dead ends: 65 [2019-01-31 17:35:44,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:35:44,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-31 17:35:44,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 48. [2019-01-31 17:35:44,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-31 17:35:44,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 172 transitions. [2019-01-31 17:35:44,361 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 172 transitions. Word has length 5 [2019-01-31 17:35:44,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:44,361 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 172 transitions. [2019-01-31 17:35:44,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:35:44,361 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 172 transitions. [2019-01-31 17:35:44,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:35:44,362 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:44,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:35:44,362 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:44,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:44,362 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2019-01-31 17:35:44,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:44,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:44,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:44,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:44,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:44,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:35:44,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:35:44,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 17:35:44,459 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:35:44,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:35:44,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:35:44,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:35:44,460 INFO L87 Difference]: Start difference. First operand 48 states and 172 transitions. Second operand 4 states. [2019-01-31 17:35:44,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:44,524 INFO L93 Difference]: Finished difference Result 54 states and 182 transitions. [2019-01-31 17:35:44,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:35:44,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-31 17:35:44,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:44,526 INFO L225 Difference]: With dead ends: 54 [2019-01-31 17:35:44,526 INFO L226 Difference]: Without dead ends: 51 [2019-01-31 17:35:44,527 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-01-31 17:35:44,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-31 17:35:44,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-01-31 17:35:44,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-31 17:35:44,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 175 transitions. [2019-01-31 17:35:44,567 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 175 transitions. Word has length 5 [2019-01-31 17:35:44,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:44,568 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 175 transitions. [2019-01-31 17:35:44,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:35:44,568 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 175 transitions. [2019-01-31 17:35:44,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:35:44,568 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:44,569 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:35:44,569 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:44,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:44,569 INFO L82 PathProgramCache]: Analyzing trace with hash 28941284, now seen corresponding path program 1 times [2019-01-31 17:35:44,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:44,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:44,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:44,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:44,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:44,791 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-01-31 17:35:44,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:44,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:44,859 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:44,859 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:35:44,859 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [25] [2019-01-31 17:35:44,860 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:44,860 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:45,081 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:45,081 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-01-31 17:35:45,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:45,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:45,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:45,082 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-01-31 17:35:45,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:45,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:45,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:45,101 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-01-31 17:35:45,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:45,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:45,129 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-01-31 17:35:45,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:45,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:45,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:45,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:45,169 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-01-31 17:35:45,170 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:45,179 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:45,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:45,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, 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-01-31 17:35:45,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, 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-01-31 17:35:45,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, 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-01-31 17:35:45,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-01-31 17:35:45,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, 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-01-31 17:35:45,225 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:45,242 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:45,255 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:45,263 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:45,273 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:45,293 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-01-31 17:35:45,294 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-31 17:35:45,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:45,331 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-01-31 17:35:45,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:35:45,389 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-01-31 17:35:45,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:62 [2019-01-31 17:35:45,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:45,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:45,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:45,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:45,423 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-01-31 17:35:45,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:45,442 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-01-31 17:35:45,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-01-31 17:35:45,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:45,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:45,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:45,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:45,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:35:45,487 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:45,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:35:45,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:35:45,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:35:45,488 INFO L87 Difference]: Start difference. First operand 47 states and 175 transitions. Second operand 8 states. [2019-01-31 17:35:45,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:45,802 INFO L93 Difference]: Finished difference Result 83 states and 276 transitions. [2019-01-31 17:35:45,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:35:45,802 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:35:45,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:45,803 INFO L225 Difference]: With dead ends: 83 [2019-01-31 17:35:45,803 INFO L226 Difference]: Without dead ends: 82 [2019-01-31 17:35:45,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:35:45,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-31 17:35:45,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-01-31 17:35:45,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-31 17:35:45,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 241 transitions. [2019-01-31 17:35:45,851 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 241 transitions. Word has length 5 [2019-01-31 17:35:45,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:45,852 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 241 transitions. [2019-01-31 17:35:45,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:35:45,852 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 241 transitions. [2019-01-31 17:35:45,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:35:45,852 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:45,853 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-31 17:35:45,853 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:45,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:45,853 INFO L82 PathProgramCache]: Analyzing trace with hash 904687194, now seen corresponding path program 1 times [2019-01-31 17:35:45,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:45,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:45,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:45,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:45,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:45,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:35:45,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:45,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:45,966 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:35:45,966 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [27] [2019-01-31 17:35:45,966 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:45,967 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:46,105 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:46,105 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-01-31 17:35:46,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:46,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:46,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:46,105 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-01-31 17:35:46,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:46,114 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:46,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:46,123 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-01-31 17:35:46,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:46,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:46,152 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-01-31 17:35:46,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:46,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:46,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:46,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:46,195 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-01-31 17:35:46,196 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:46,206 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:46,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:46,236 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-01-31 17:35:46,239 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-01-31 17:35:46,242 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-01-31 17:35:46,244 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-01-31 17:35:46,251 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-01-31 17:35:46,252 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:46,269 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:46,282 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:46,292 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:46,302 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:46,321 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-01-31 17:35:46,322 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-31 17:35:46,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:46,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-31 17:35:46,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:46,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:46,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-31 17:35:46,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:46,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:46,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:46,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:46,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:46,380 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-01-31 17:35:46,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:46,394 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-01-31 17:35:46,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:20 [2019-01-31 17:35:46,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:46,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:46,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:46,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:46,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:35:46,448 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:46,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:35:46,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:35:46,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:35:46,449 INFO L87 Difference]: Start difference. First operand 58 states and 241 transitions. Second operand 8 states. [2019-01-31 17:35:46,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:46,806 INFO L93 Difference]: Finished difference Result 86 states and 325 transitions. [2019-01-31 17:35:46,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:35:46,806 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:35:46,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:46,808 INFO L225 Difference]: With dead ends: 86 [2019-01-31 17:35:46,808 INFO L226 Difference]: Without dead ends: 85 [2019-01-31 17:35:46,808 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-01-31 17:35:46,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-31 17:35:46,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 66. [2019-01-31 17:35:46,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-31 17:35:46,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 289 transitions. [2019-01-31 17:35:46,870 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 289 transitions. Word has length 6 [2019-01-31 17:35:46,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:46,871 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 289 transitions. [2019-01-31 17:35:46,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:35:46,871 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 289 transitions. [2019-01-31 17:35:46,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:35:46,871 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:46,871 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:35:46,872 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:46,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:46,872 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2019-01-31 17:35:46,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:46,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:46,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:46,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:46,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:46,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:35:46,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:46,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:46,997 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:35:46,997 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [25] [2019-01-31 17:35:46,998 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:46,998 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:47,300 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:47,300 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-01-31 17:35:47,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:47,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:47,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:47,301 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-01-31 17:35:47,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:47,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:47,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:47,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,345 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-01-31 17:35:47,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,391 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-01-31 17:35:47,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,432 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-01-31 17:35:47,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,482 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-01-31 17:35:47,482 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:47,499 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:47,516 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:47,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:47,561 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-01-31 17:35:47,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, 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-01-31 17:35:47,565 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-01-31 17:35:47,567 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-01-31 17:35:47,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, 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-01-31 17:35:47,571 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:47,597 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:47,611 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:47,623 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:47,633 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:47,662 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-01-31 17:35:47,662 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-31 17:35:47,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,696 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-01-31 17:35:47,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:47,735 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-01-31 17:35:47,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-31 17:35:47,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,801 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-01-31 17:35:47,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:47,832 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-01-31 17:35:47,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-31 17:35:47,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:47,868 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:47,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, 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-01-31 17:35:47,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:47,906 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-01-31 17:35:47,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-31 17:35:47,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:47,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:48,124 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:48,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:48,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:35:48,145 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:48,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:35:48,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:35:48,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:35:48,146 INFO L87 Difference]: Start difference. First operand 66 states and 289 transitions. Second operand 10 states. [2019-01-31 17:35:48,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:48,679 INFO L93 Difference]: Finished difference Result 100 states and 357 transitions. [2019-01-31 17:35:48,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:35:48,680 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:35:48,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:48,681 INFO L225 Difference]: With dead ends: 100 [2019-01-31 17:35:48,681 INFO L226 Difference]: Without dead ends: 99 [2019-01-31 17:35:48,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:35:48,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-31 17:35:48,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 68. [2019-01-31 17:35:48,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-31 17:35:48,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 301 transitions. [2019-01-31 17:35:48,758 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 301 transitions. Word has length 6 [2019-01-31 17:35:48,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:48,758 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 301 transitions. [2019-01-31 17:35:48,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:35:48,758 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 301 transitions. [2019-01-31 17:35:48,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:35:48,758 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:48,758 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:35:48,759 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:48,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:48,759 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2019-01-31 17:35:48,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:48,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:48,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:48,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:48,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:48,902 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-31 17:35:48,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:48,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:48,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:48,982 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:35:48,983 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [25] [2019-01-31 17:35:48,984 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:48,984 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:49,289 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:49,290 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-01-31 17:35:49,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:49,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:49,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:49,290 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-01-31 17:35:49,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:49,300 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:49,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:49,309 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-01-31 17:35:49,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,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, 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-01-31 17:35:49,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,395 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-01-31 17:35:49,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,446 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-01-31 17:35:49,447 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:49,463 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:49,481 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:49,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:49,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, 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-01-31 17:35:49,526 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-01-31 17:35:49,529 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-01-31 17:35:49,532 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-01-31 17:35:49,536 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-01-31 17:35:49,537 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:49,558 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:49,571 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:49,581 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:49,591 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:49,617 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-01-31 17:35:49,618 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-31 17:35:49,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:35:49,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:49,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:49,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:35:49,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,712 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-01-31 17:35:49,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:49,731 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-01-31 17:35:49,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:35:49,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,759 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:49,760 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-01-31 17:35:49,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:49,783 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-01-31 17:35:49,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-31 17:35:49,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:49,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:49,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:49,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:49,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:35:49,859 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:49,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:35:49,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:35:49,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:35:49,860 INFO L87 Difference]: Start difference. First operand 68 states and 301 transitions. Second operand 10 states. [2019-01-31 17:35:50,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:50,346 INFO L93 Difference]: Finished difference Result 104 states and 381 transitions. [2019-01-31 17:35:50,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:35:50,347 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:35:50,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:50,348 INFO L225 Difference]: With dead ends: 104 [2019-01-31 17:35:50,349 INFO L226 Difference]: Without dead ends: 103 [2019-01-31 17:35:50,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:35:50,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-31 17:35:50,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 74. [2019-01-31 17:35:50,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-31 17:35:50,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-01-31 17:35:50,447 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-01-31 17:35:50,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:50,447 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-01-31 17:35:50,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:35:50,447 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-01-31 17:35:50,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:35:50,448 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:50,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:35:50,448 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:50,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:50,448 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2019-01-31 17:35:50,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:50,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:50,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:50,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:50,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:50,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:35:50,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:50,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:50,515 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:35:50,516 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [25] [2019-01-31 17:35:50,516 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:50,517 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:50,839 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:50,839 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-01-31 17:35:50,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:50,840 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:50,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:50,840 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-01-31 17:35:50,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:50,848 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:50,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:50,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:50,931 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-01-31 17:35:50,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:50,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:50,966 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-01-31 17:35:51,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:51,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:51,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:51,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:51,019 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-01-31 17:35:51,020 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:51,035 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:51,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:51,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, 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-01-31 17:35:51,067 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-01-31 17:35:51,070 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-01-31 17:35:51,072 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-01-31 17:35:51,077 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-01-31 17:35:51,077 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:51,092 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:51,106 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:51,118 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:51,128 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:51,149 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-01-31 17:35:51,150 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-31 17:35:51,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:51,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, 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-01-31 17:35:51,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:51,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:51,215 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:35:51,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:51,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:51,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:51,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:51,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:51,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:51,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 33 treesize of output 59 [2019-01-31 17:35:51,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:51,264 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-01-31 17:35:51,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:35:51,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:51,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:51,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:51,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:51,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:51,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:51,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:51,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:51,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:51,340 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:51,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, 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-01-31 17:35:51,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:51,366 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-01-31 17:35:51,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-31 17:35:51,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:51,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:51,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:51,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:35:51,443 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:51,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:35:51,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:35:51,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:35:51,443 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 10 states. [2019-01-31 17:35:52,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:52,055 INFO L93 Difference]: Finished difference Result 107 states and 399 transitions. [2019-01-31 17:35:52,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:35:52,056 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:35:52,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:52,057 INFO L225 Difference]: With dead ends: 107 [2019-01-31 17:35:52,058 INFO L226 Difference]: Without dead ends: 106 [2019-01-31 17:35:52,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:35:52,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-31 17:35:52,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 74. [2019-01-31 17:35:52,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-31 17:35:52,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-01-31 17:35:52,157 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-01-31 17:35:52,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:52,157 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-01-31 17:35:52,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:35:52,157 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-01-31 17:35:52,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:35:52,158 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:52,158 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:35:52,158 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:52,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:52,159 INFO L82 PathProgramCache]: Analyzing trace with hash 906534236, now seen corresponding path program 1 times [2019-01-31 17:35:52,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:52,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:52,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:52,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:52,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:52,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:52,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:52,293 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:52,293 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:35:52,294 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [27] [2019-01-31 17:35:52,296 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:52,297 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:52,520 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:52,521 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-01-31 17:35:52,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:52,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:52,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:52,521 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-01-31 17:35:52,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:52,530 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:52,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:52,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-01-31 17:35:52,547 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-01-31 17:35:52,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:52,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:52,575 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-01-31 17:35:52,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:52,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:52,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:52,585 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-01-31 17:35:52,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:52,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:52,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:52,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:52,599 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-01-31 17:35:52,599 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:52,628 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:52,643 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:52,653 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:52,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:52,684 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-01-31 17:35:52,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:52,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:52,701 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-01-31 17:35:52,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:52,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:52,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:52,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:52,738 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-01-31 17:35:52,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:52,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:52,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:52,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:52,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:52,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:52,783 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-01-31 17:35:52,784 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:52,799 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:52,813 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:52,830 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:52,876 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-01-31 17:35:52,877 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:35:52,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:52,913 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-01-31 17:35:52,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:52,933 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-01-31 17:35:52,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:35:52,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:52,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:52,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:52,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:52,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:52,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:52,963 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-01-31 17:35:52,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:52,982 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-01-31 17:35:52,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-31 17:35:53,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:53,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:53,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:53,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:53,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:35:53,043 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:53,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:35:53,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:35:53,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:35:53,044 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 8 states. [2019-01-31 17:35:53,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:53,431 INFO L93 Difference]: Finished difference Result 100 states and 371 transitions. [2019-01-31 17:35:53,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:35:53,431 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:35:53,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:53,433 INFO L225 Difference]: With dead ends: 100 [2019-01-31 17:35:53,433 INFO L226 Difference]: Without dead ends: 98 [2019-01-31 17:35:53,434 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-01-31 17:35:53,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-31 17:35:53,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 75. [2019-01-31 17:35:53,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-31 17:35:53,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 343 transitions. [2019-01-31 17:35:53,544 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 343 transitions. Word has length 6 [2019-01-31 17:35:53,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:53,544 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 343 transitions. [2019-01-31 17:35:53,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:35:53,544 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 343 transitions. [2019-01-31 17:35:53,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:35:53,544 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:53,544 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:35:53,545 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:53,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:53,545 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2019-01-31 17:35:53,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:53,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:53,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:53,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:53,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:53,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:53,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:53,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:53,640 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:35:53,640 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [25] [2019-01-31 17:35:53,641 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:53,641 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:54,250 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:54,250 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-01-31 17:35:54,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:54,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:54,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:54,251 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-01-31 17:35:54,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:54,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:54,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:54,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,290 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-01-31 17:35:54,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,328 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-01-31 17:35:54,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,367 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-01-31 17:35:54,367 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:54,381 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:54,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:54,408 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-01-31 17:35:54,410 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-01-31 17:35:54,412 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-01-31 17:35:54,414 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-01-31 17:35:54,419 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-01-31 17:35:54,419 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:54,436 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:54,450 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:54,461 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:54,471 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:54,492 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-01-31 17:35:54,493 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-31 17:35:54,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,550 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-01-31 17:35:54,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-31 17:35:54,724 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-01-31 17:35:54,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:183 [2019-01-31 17:35:54,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,820 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:54,820 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 67 [2019-01-31 17:35:54,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:54,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,896 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-01-31 17:35:54,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:54,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,962 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:54,963 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-01-31 17:35:54,963 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:55,015 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-01-31 17:35:55,016 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:130, output treesize:92 [2019-01-31 17:35:55,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:55,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:55,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:55,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:55,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:55,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:55,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:55,080 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 65 [2019-01-31 17:35:55,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:55,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:55,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:55,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:55,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:55,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:55,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:55,146 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-01-31 17:35:55,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:55,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:55,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:55,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:55,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:55,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:55,209 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:55,210 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-01-31 17:35:55,210 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:55,257 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-01-31 17:35:55,257 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:122, output treesize:84 [2019-01-31 17:35:55,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:55,311 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:55,368 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:55,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:55,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:35:55,389 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:55,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:35:55,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:35:55,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:35:55,390 INFO L87 Difference]: Start difference. First operand 75 states and 343 transitions. Second operand 10 states. [2019-01-31 17:35:56,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:56,432 INFO L93 Difference]: Finished difference Result 124 states and 454 transitions. [2019-01-31 17:35:56,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:35:56,433 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:35:56,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:56,435 INFO L225 Difference]: With dead ends: 124 [2019-01-31 17:35:56,435 INFO L226 Difference]: Without dead ends: 123 [2019-01-31 17:35:56,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:35:56,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-31 17:35:56,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 78. [2019-01-31 17:35:56,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-31 17:35:56,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 361 transitions. [2019-01-31 17:35:56,567 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 361 transitions. Word has length 6 [2019-01-31 17:35:56,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:56,567 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 361 transitions. [2019-01-31 17:35:56,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:35:56,568 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 361 transitions. [2019-01-31 17:35:56,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:35:56,568 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:56,568 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:35:56,568 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:56,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:56,568 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2019-01-31 17:35:56,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:56,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:56,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:56,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:56,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:56,713 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-31 17:35:57,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:35:57,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:57,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:57,013 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:35:57,013 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [25] [2019-01-31 17:35:57,015 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:57,016 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:57,780 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:57,780 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-01-31 17:35:57,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:57,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:57,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:57,780 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-01-31 17:35:57,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:57,790 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:57,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:57,876 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-01-31 17:35:57,880 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-01-31 17:35:57,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:57,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:57,884 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-01-31 17:35:57,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:57,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:57,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:57,892 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-01-31 17:35:57,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:57,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:57,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:57,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:57,899 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-01-31 17:35:57,900 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:57,928 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:57,943 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:57,954 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:57,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:57,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:57,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, 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-01-31 17:35:58,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,025 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-01-31 17:35:58,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,065 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-01-31 17:35:58,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,115 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-01-31 17:35:58,115 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:58,132 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:58,148 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:58,164 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:58,195 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-01-31 17:35:58,196 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-31 17:35:58,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,227 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-01-31 17:35:58,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:58,258 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-01-31 17:35:58,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-31 17:35:58,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,288 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:58,289 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-01-31 17:35:58,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:58,320 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-01-31 17:35:58,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-31 17:35:58,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,364 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:58,364 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-01-31 17:35:58,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:58,397 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-01-31 17:35:58,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-31 17:36:08,669 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:08,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:08,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:08,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:08,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-31 17:36:08,721 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:08,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:36:08,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:36:08,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=98, Unknown=1, NotChecked=0, Total=156 [2019-01-31 17:36:08,722 INFO L87 Difference]: Start difference. First operand 78 states and 361 transitions. Second operand 9 states. [2019-01-31 17:36:09,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:09,365 INFO L93 Difference]: Finished difference Result 114 states and 434 transitions. [2019-01-31 17:36:09,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:36:09,365 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-31 17:36:09,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:09,367 INFO L225 Difference]: With dead ends: 114 [2019-01-31 17:36:09,367 INFO L226 Difference]: Without dead ends: 113 [2019-01-31 17:36:09,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=87, Invalid=152, Unknown=1, NotChecked=0, Total=240 [2019-01-31 17:36:09,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-31 17:36:09,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 84. [2019-01-31 17:36:09,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-31 17:36:09,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 397 transitions. [2019-01-31 17:36:09,517 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 397 transitions. Word has length 6 [2019-01-31 17:36:09,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:09,517 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 397 transitions. [2019-01-31 17:36:09,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:36:09,517 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 397 transitions. [2019-01-31 17:36:09,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:36:09,518 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:09,518 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:36:09,518 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:09,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:09,518 INFO L82 PathProgramCache]: Analyzing trace with hash 906278546, now seen corresponding path program 2 times [2019-01-31 17:36:09,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:09,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:09,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:09,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:09,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:09,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:09,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:09,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:09,630 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:36:09,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:36:09,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:09,631 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-01-31 17:36:09,640 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:36:09,640 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:36:09,647 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:36:09,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:36:09,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:09,669 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-01-31 17:36:09,676 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-01-31 17:36:09,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:09,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:09,685 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-01-31 17:36:09,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:09,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:09,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:09,695 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-01-31 17:36:09,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:09,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:09,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:09,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:09,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, 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-01-31 17:36:09,704 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:09,731 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:09,747 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:09,760 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:09,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:09,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:09,796 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-01-31 17:36:09,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:09,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:09,830 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-01-31 17:36:09,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:09,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:09,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:09,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:09,871 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-01-31 17:36:09,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:09,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:09,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:09,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:09,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:09,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:09,921 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-01-31 17:36:09,921 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:09,938 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:09,954 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:09,970 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:09,999 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-01-31 17:36:09,999 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-31 17:36:10,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,021 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-01-31 17:36:10,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:10,051 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-01-31 17:36:10,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:36:10,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,079 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-01-31 17:36:10,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:10,115 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-01-31 17:36:10,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-31 17:36:10,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,146 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:36:10,147 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-01-31 17:36:10,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:10,183 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-01-31 17:36:10,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-31 17:36:10,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:10,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:10,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:10,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:10,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:36:10,533 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:10,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:36:10,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:36:10,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:36:10,534 INFO L87 Difference]: Start difference. First operand 84 states and 397 transitions. Second operand 10 states. [2019-01-31 17:36:11,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:11,188 INFO L93 Difference]: Finished difference Result 164 states and 664 transitions. [2019-01-31 17:36:11,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:36:11,189 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:36:11,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:11,191 INFO L225 Difference]: With dead ends: 164 [2019-01-31 17:36:11,191 INFO L226 Difference]: Without dead ends: 163 [2019-01-31 17:36:11,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:36:11,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-31 17:36:11,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 117. [2019-01-31 17:36:11,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-31 17:36:11,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 595 transitions. [2019-01-31 17:36:11,399 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 595 transitions. Word has length 6 [2019-01-31 17:36:11,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:11,399 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 595 transitions. [2019-01-31 17:36:11,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:36:11,399 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 595 transitions. [2019-01-31 17:36:11,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:36:11,400 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:11,400 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:36:11,400 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:11,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:11,400 INFO L82 PathProgramCache]: Analyzing trace with hash 906295908, now seen corresponding path program 1 times [2019-01-31 17:36:11,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:11,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:11,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:36:11,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:11,401 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:11,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:36:11,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:11,494 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:11,494 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:36:11,494 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [27] [2019-01-31 17:36:11,497 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:11,497 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:11,991 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:11,991 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-01-31 17:36:11,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:11,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:11,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:11,992 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-01-31 17:36:12,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:12,002 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:12,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:12,014 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-01-31 17:36:12,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,049 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-01-31 17:36:12,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,090 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-01-31 17:36:12,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,138 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-01-31 17:36:12,138 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:12,154 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:12,167 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:12,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:12,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, 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-01-31 17:36:12,208 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-01-31 17:36:12,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, 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-01-31 17:36:12,214 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-01-31 17:36:12,216 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-01-31 17:36:12,217 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:12,240 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:12,253 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:12,263 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:12,273 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:12,301 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-01-31 17:36:12,301 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:36:12,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,326 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-01-31 17:36:12,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:12,354 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-01-31 17:36:12,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:36:12,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,390 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-01-31 17:36:12,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:36:12,492 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-01-31 17:36:12,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-31 17:36:12,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:12,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:12,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:12,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:12,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:36:12,563 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:12,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:36:12,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:36:12,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:36:12,564 INFO L87 Difference]: Start difference. First operand 117 states and 595 transitions. Second operand 8 states. [2019-01-31 17:36:13,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:13,071 INFO L93 Difference]: Finished difference Result 160 states and 722 transitions. [2019-01-31 17:36:13,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:36:13,072 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:36:13,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:13,074 INFO L225 Difference]: With dead ends: 160 [2019-01-31 17:36:13,074 INFO L226 Difference]: Without dead ends: 159 [2019-01-31 17:36:13,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:36:13,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-31 17:36:13,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2019-01-31 17:36:13,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-31 17:36:13,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 697 transitions. [2019-01-31 17:36:13,312 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 697 transitions. Word has length 6 [2019-01-31 17:36:13,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:13,312 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 697 transitions. [2019-01-31 17:36:13,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:36:13,313 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 697 transitions. [2019-01-31 17:36:13,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:36:13,313 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:13,314 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:36:13,314 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:13,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:13,314 INFO L82 PathProgramCache]: Analyzing trace with hash 893604942, now seen corresponding path program 1 times [2019-01-31 17:36:13,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:13,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:13,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:13,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:13,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:13,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:36:13,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:13,383 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:13,383 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:36:13,384 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [27] [2019-01-31 17:36:13,385 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:13,385 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:13,698 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:13,698 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-01-31 17:36:13,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:13,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:13,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:13,699 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-01-31 17:36:13,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:13,707 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:13,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:13,717 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-01-31 17:36:13,722 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-01-31 17:36:13,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,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, 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-01-31 17:36:13,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,749 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-01-31 17:36:13,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, 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-01-31 17:36:13,766 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:13,789 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:13,802 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:13,812 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:13,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36: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 26 treesize of output 25 [2019-01-31 17:36:13,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36: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, 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-01-31 17:36:13,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,883 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-01-31 17:36:13,883 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:13,892 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:13,901 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:13,920 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-01-31 17:36:13,921 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-31 17:36:13,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,952 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-01-31 17:36:13,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:13,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:13,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-31 17:36:13,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,984 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-01-31 17:36:13,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:13,998 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-01-31 17:36:13,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2019-01-31 17:36:14,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-01-31 17:36:14,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:14,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:14,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:14,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:36:14,046 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:14,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:36:14,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:36:14,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:36:14,047 INFO L87 Difference]: Start difference. First operand 134 states and 697 transitions. Second operand 8 states. [2019-01-31 17:36:14,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:14,571 INFO L93 Difference]: Finished difference Result 175 states and 783 transitions. [2019-01-31 17:36:14,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:36:14,571 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:36:14,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:14,574 INFO L225 Difference]: With dead ends: 175 [2019-01-31 17:36:14,574 INFO L226 Difference]: Without dead ends: 174 [2019-01-31 17:36:14,574 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-01-31 17:36:14,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-31 17:36:14,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 132. [2019-01-31 17:36:14,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-31 17:36:14,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-01-31 17:36:14,810 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-01-31 17:36:14,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:14,810 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-01-31 17:36:14,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:36:14,810 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-01-31 17:36:14,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:36:14,811 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:14,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:36:14,811 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:14,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:14,812 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2019-01-31 17:36:14,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:14,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:14,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:14,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:14,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:14,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 17:36:14,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:36:14,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-31 17:36:14,900 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:36:14,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 17:36:14,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 17:36:14,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-31 17:36:14,901 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 5 states. [2019-01-31 17:36:15,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:15,271 INFO L93 Difference]: Finished difference Result 185 states and 858 transitions. [2019-01-31 17:36:15,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:36:15,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-31 17:36:15,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:15,273 INFO L225 Difference]: With dead ends: 185 [2019-01-31 17:36:15,273 INFO L226 Difference]: Without dead ends: 184 [2019-01-31 17:36:15,273 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-01-31 17:36:15,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-01-31 17:36:15,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 132. [2019-01-31 17:36:15,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-31 17:36:15,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-01-31 17:36:15,512 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-01-31 17:36:15,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:15,512 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-01-31 17:36:15,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 17:36:15,512 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-01-31 17:36:15,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:36:15,512 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:15,513 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:36:15,513 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:15,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:15,513 INFO L82 PathProgramCache]: Analyzing trace with hash 897299026, now seen corresponding path program 1 times [2019-01-31 17:36:15,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:15,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:15,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:15,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:15,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:15,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:36:15,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:15,672 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:15,672 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:36:15,673 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [27] [2019-01-31 17:36:15,673 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:15,674 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:15,883 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:15,883 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-01-31 17:36:15,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:15,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:15,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:15,884 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-01-31 17:36:15,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:15,892 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:15,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:15,903 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-01-31 17:36:15,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:15,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:15,924 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-01-31 17:36:15,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:15,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:15,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:15,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:15,967 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-01-31 17:36:15,967 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:15,980 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:15,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:16,000 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-01-31 17:36:16,003 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-01-31 17:36:16,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, 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-01-31 17:36:16,009 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-01-31 17:36:16,015 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-01-31 17:36:16,016 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:16,032 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:16,042 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:16,052 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:16,061 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:16,080 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-01-31 17:36:16,080 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-31 17:36:16,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,109 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-01-31 17:36:16,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:16,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:16,120 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-31 17:36:16,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,137 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:36:16,138 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-01-31 17:36:16,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:16,150 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-01-31 17:36:16,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-31 17:36:16,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:16,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:16,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:16,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:16,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:36:16,201 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:16,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:36:16,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:36:16,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:36:16,202 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 8 states. [2019-01-31 17:36:16,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:16,686 INFO L93 Difference]: Finished difference Result 142 states and 698 transitions. [2019-01-31 17:36:16,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:36:16,687 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:36:16,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:16,689 INFO L225 Difference]: With dead ends: 142 [2019-01-31 17:36:16,689 INFO L226 Difference]: Without dead ends: 141 [2019-01-31 17:36:16,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:36:16,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-31 17:36:17,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2019-01-31 17:36:17,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-01-31 17:36:17,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 682 transitions. [2019-01-31 17:36:17,055 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 682 transitions. Word has length 6 [2019-01-31 17:36:17,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:17,056 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 682 transitions. [2019-01-31 17:36:17,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:36:17,056 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 682 transitions. [2019-01-31 17:36:17,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:36:17,056 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:17,056 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-31 17:36:17,056 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:17,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:17,057 INFO L82 PathProgramCache]: Analyzing trace with hash 897354700, now seen corresponding path program 1 times [2019-01-31 17:36:17,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:17,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:17,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:17,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:17,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:17,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:36:17,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:17,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:17,100 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:36:17,100 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [25] [2019-01-31 17:36:17,101 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:17,101 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:17,624 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:17,624 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-01-31 17:36:17,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:17,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:17,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:17,624 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-01-31 17:36:17,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:17,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:17,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:17,645 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-01-31 17:36:17,649 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-01-31 17:36:17,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:17,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:17,658 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-01-31 17:36:17,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:17,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:17,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:17,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, 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-01-31 17:36:17,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:17,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:17,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:17,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:17,687 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-01-31 17:36:17,687 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:17,721 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:17,735 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:17,747 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:17,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:17,778 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-01-31 17:36:17,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:17,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:17,794 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-01-31 17:36:17,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:17,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:17,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:17,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:17,830 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-01-31 17:36:17,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:17,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:17,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:17,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:17,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:17,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:17,873 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-01-31 17:36:17,873 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:17,887 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:17,901 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:17,917 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:17,945 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-01-31 17:36:17,946 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-31 17:36:17,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:17,974 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-01-31 17:36:17,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:36:18,068 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-01-31 17:36:18,069 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-01-31 17:36:18,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:18,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:18,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:18,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:18,105 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-01-31 17:36:18,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:18,129 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-01-31 17:36:18,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-01-31 17:36:18,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:18,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:18,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:18,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:18,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:18,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:18,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:18,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:18,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:18,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:18,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:18,157 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-01-31 17:36:18,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:18,184 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-01-31 17:36:18,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-31 17:36:18,201 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:18,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:18,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:18,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:18,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-31 17:36:18,242 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:18,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:36:18,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:36:18,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:36:18,243 INFO L87 Difference]: Start difference. First operand 130 states and 682 transitions. Second operand 9 states. [2019-01-31 17:36:18,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:18,960 INFO L93 Difference]: Finished difference Result 219 states and 1011 transitions. [2019-01-31 17:36:18,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:36:18,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-31 17:36:18,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:18,963 INFO L225 Difference]: With dead ends: 219 [2019-01-31 17:36:18,963 INFO L226 Difference]: Without dead ends: 216 [2019-01-31 17:36:18,964 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-01-31 17:36:18,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-01-31 17:36:19,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 148. [2019-01-31 17:36:19,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-01-31 17:36:19,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 790 transitions. [2019-01-31 17:36:19,262 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 790 transitions. Word has length 6 [2019-01-31 17:36:19,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:19,262 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 790 transitions. [2019-01-31 17:36:19,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:36:19,262 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 790 transitions. [2019-01-31 17:36:19,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:36:19,263 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:19,263 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:36:19,263 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:19,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:19,264 INFO L82 PathProgramCache]: Analyzing trace with hash 896937626, now seen corresponding path program 3 times [2019-01-31 17:36:19,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:19,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:19,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:19,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:19,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:19,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:36:19,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:19,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:19,331 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:36:19,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:36:19,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:19,331 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-01-31 17:36:19,341 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:36:19,341 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:36:19,345 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:36:19,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:36:19,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:19,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,367 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-01-31 17:36:19,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,403 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-01-31 17:36:19,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,436 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-01-31 17:36:19,436 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:19,444 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:19,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:19,466 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-01-31 17:36:19,469 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-01-31 17:36:19,471 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-01-31 17:36:19,474 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-01-31 17:36:19,480 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-01-31 17:36:19,480 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:19,498 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:19,511 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:19,522 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:19,532 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:19,553 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-01-31 17:36:19,554 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-31 17:36:19,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,588 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-01-31 17:36:19,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:36:19,659 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-01-31 17:36:19,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:75 [2019-01-31 17:36:19,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,718 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-01-31 17:36:19,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:36:19,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,864 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-01-31 17:36:19,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:19,928 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-01-31 17:36:19,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:99, output treesize:90 [2019-01-31 17:36:19,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,990 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:36:20,006 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-01-31 17:36:20,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-01-31 17:36:20,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:20,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:20,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:20,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:20,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:20,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:20,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:20,188 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:36:20,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:20,190 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-01-31 17:36:20,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:20,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:20,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:20,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:20,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:20,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:20,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:20,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:20,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:20,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:20,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:20,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:20,297 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-01-31 17:36:20,298 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:20,390 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-01-31 17:36:20,391 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:117, output treesize:151 [2019-01-31 17:36:20,501 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:20,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:20,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:20,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:20,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:36:20,570 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:20,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:36:20,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:36:20,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:36:20,571 INFO L87 Difference]: Start difference. First operand 148 states and 790 transitions. Second operand 10 states. [2019-01-31 17:36:21,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:21,786 INFO L93 Difference]: Finished difference Result 218 states and 1012 transitions. [2019-01-31 17:36:21,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:36:21,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:36:21,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:21,789 INFO L225 Difference]: With dead ends: 218 [2019-01-31 17:36:21,789 INFO L226 Difference]: Without dead ends: 215 [2019-01-31 17:36:21,790 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-01-31 17:36:21,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-31 17:36:22,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 165. [2019-01-31 17:36:22,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-31 17:36:22,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 892 transitions. [2019-01-31 17:36:22,134 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 892 transitions. Word has length 6 [2019-01-31 17:36:22,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:22,135 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 892 transitions. [2019-01-31 17:36:22,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:36:22,135 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 892 transitions. [2019-01-31 17:36:22,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:36:22,135 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:22,136 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:36:22,136 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:22,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:22,136 INFO L82 PathProgramCache]: Analyzing trace with hash 900993110, now seen corresponding path program 1 times [2019-01-31 17:36:22,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:22,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:22,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:36:22,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:22,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:22,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:22,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:22,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:22,197 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:36:22,197 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [27] [2019-01-31 17:36:22,198 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:22,198 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:22,531 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:22,531 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-01-31 17:36:22,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:22,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:22,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:22,532 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-01-31 17:36:22,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:22,549 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:22,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:22,584 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-01-31 17:36:22,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:22,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:22,626 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-01-31 17:36:22,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:22,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:22,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:22,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:22,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, 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-01-31 17:36:22,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:22,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:22,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:22,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:22,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:22,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:22,708 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-01-31 17:36:22,709 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:22,724 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:22,738 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:22,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:22,775 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-01-31 17:36:22,779 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-01-31 17:36:22,782 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-01-31 17:36:22,786 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-01-31 17:36:22,788 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-01-31 17:36:22,789 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:22,971 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:22,984 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:22,994 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:23,004 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:23,032 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-01-31 17:36:23,033 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-31 17:36:23,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:23,055 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-01-31 17:36:23,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:23,084 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-01-31 17:36:23,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:36:23,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:23,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:23,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:23,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:23,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:23,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:23,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:23,109 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-01-31 17:36:23,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:23,139 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-01-31 17:36:23,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:34 [2019-01-31 17:36:23,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:23,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:23,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:23,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:23,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:36:23,196 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:23,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:36:23,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:36:23,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:36:23,197 INFO L87 Difference]: Start difference. First operand 165 states and 892 transitions. Second operand 8 states. [2019-01-31 17:36:24,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:24,055 INFO L93 Difference]: Finished difference Result 274 states and 1371 transitions. [2019-01-31 17:36:24,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:36:24,055 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:36:24,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:24,058 INFO L225 Difference]: With dead ends: 274 [2019-01-31 17:36:24,059 INFO L226 Difference]: Without dead ends: 269 [2019-01-31 17:36:24,059 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-01-31 17:36:24,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-01-31 17:36:24,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 221. [2019-01-31 17:36:24,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-31 17:36:24,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1227 transitions. [2019-01-31 17:36:24,557 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1227 transitions. Word has length 6 [2019-01-31 17:36:24,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:24,557 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1227 transitions. [2019-01-31 17:36:24,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:36:24,557 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1227 transitions. [2019-01-31 17:36:24,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:36:24,558 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:24,558 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:36:24,558 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:24,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:24,558 INFO L82 PathProgramCache]: Analyzing trace with hash 900750874, now seen corresponding path program 1 times [2019-01-31 17:36:24,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:24,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:24,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:24,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:24,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:24,669 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:24,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:24,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:24,670 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:36:24,670 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [25] [2019-01-31 17:36:24,671 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:24,672 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:25,625 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:25,625 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-01-31 17:36:25,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:25,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:25,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:25,626 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-01-31 17:36:25,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:25,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:25,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:25,644 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-01-31 17:36:25,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, 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-01-31 17:36:25,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,658 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-01-31 17:36:25,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,672 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-01-31 17:36:25,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,687 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-01-31 17:36:25,688 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:25,721 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:25,736 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:25,745 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:25,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:25,802 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-01-31 17:36:25,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,819 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-01-31 17:36:25,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,854 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-01-31 17:36:25,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,900 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-01-31 17:36:25,900 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:25,916 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:25,930 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:25,946 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:25,975 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-01-31 17:36:25,975 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:36:26,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,003 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-01-31 17:36:26,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:26,032 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-01-31 17:36:26,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:36:26,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,070 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-01-31 17:36:26,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:36:26,169 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-01-31 17:36:26,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-01-31 17:36:26,569 WARN L181 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 24 [2019-01-31 17:36:26,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,591 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:36:26,592 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-01-31 17:36:26,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:26,615 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-01-31 17:36:26,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2019-01-31 17:36:26,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:26,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:26,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:26,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:26,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-31 17:36:26,683 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:26,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:36:26,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:36:26,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:36:26,684 INFO L87 Difference]: Start difference. First operand 221 states and 1227 transitions. Second operand 10 states. [2019-01-31 17:36:28,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:28,340 INFO L93 Difference]: Finished difference Result 480 states and 2479 transitions. [2019-01-31 17:36:28,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-31 17:36:28,341 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:36:28,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:28,346 INFO L225 Difference]: With dead ends: 480 [2019-01-31 17:36:28,346 INFO L226 Difference]: Without dead ends: 477 [2019-01-31 17:36:28,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:36:28,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-01-31 17:36:29,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 348. [2019-01-31 17:36:29,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-01-31 17:36:29,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1989 transitions. [2019-01-31 17:36:29,224 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1989 transitions. Word has length 6 [2019-01-31 17:36:29,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:29,224 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 1989 transitions. [2019-01-31 17:36:29,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:36:29,224 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1989 transitions. [2019-01-31 17:36:29,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:36:29,225 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:29,225 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-31 17:36:29,225 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:29,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:29,225 INFO L82 PathProgramCache]: Analyzing trace with hash -2019467998, now seen corresponding path program 1 times [2019-01-31 17:36:29,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:29,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:29,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:29,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:29,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:29,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:29,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:29,270 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:29,270 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:36:29,271 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [28], [29] [2019-01-31 17:36:29,271 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:29,271 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:29,476 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:29,476 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-01-31 17:36:29,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:29,476 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:29,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:29,476 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-01-31 17:36:29,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:29,491 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:29,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:29,524 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-01-31 17:36:29,561 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-01-31 17:36:29,642 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-01-31 17:36:29,797 INFO L303 Elim1Store]: Index analysis took 154 ms [2019-01-31 17:36:29,798 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-01-31 17:36:30,039 INFO L303 Elim1Store]: Index analysis took 239 ms [2019-01-31 17:36:30,040 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-01-31 17:36:30,040 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:30,183 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:30,334 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:30,484 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:30,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:30,771 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-01-31 17:36:30,772 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-01-31 17:36:30,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:30,862 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-01-31 17:36:30,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:30,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:30,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-31 17:36:31,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:31,022 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-01-31 17:36:31,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:31,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:31,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2019-01-31 17:36:31,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:31,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:31,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:31,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:36:31,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2019-01-31 17:36:31,309 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:36:31,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 17:36:31,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 17:36:31,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:36:31,311 INFO L87 Difference]: Start difference. First operand 348 states and 1989 transitions. Second operand 5 states. [2019-01-31 17:36:33,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:33,752 INFO L93 Difference]: Finished difference Result 804 states and 4563 transitions. [2019-01-31 17:36:33,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:36:33,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-31 17:36:33,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:33,759 INFO L225 Difference]: With dead ends: 804 [2019-01-31 17:36:33,759 INFO L226 Difference]: Without dead ends: 800 [2019-01-31 17:36:33,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:36:33,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-01-31 17:36:35,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 774. [2019-01-31 17:36:35,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-01-31 17:36:35,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 4522 transitions. [2019-01-31 17:36:35,830 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 4522 transitions. Word has length 7 [2019-01-31 17:36:35,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:35,830 INFO L480 AbstractCegarLoop]: Abstraction has 774 states and 4522 transitions. [2019-01-31 17:36:35,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 17:36:35,830 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 4522 transitions. [2019-01-31 17:36:35,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:36:35,833 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:35,833 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:36:35,833 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:35,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:35,833 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2019-01-31 17:36:35,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:35,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:35,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:35,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:35,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:36,006 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-31 17:36:36,161 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-31 17:36:36,192 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:36:36,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:36,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:36,193 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:36:36,193 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [25] [2019-01-31 17:36:36,194 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:36,194 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:36,544 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:36,545 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-01-31 17:36:36,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:36,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:36,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:36,545 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-01-31 17:36:36,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:36,553 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:36,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:36,581 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-01-31 17:36:36,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, 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-01-31 17:36:36,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:36,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:36,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, 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-01-31 17:36:36,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:36,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:36,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:36,607 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-01-31 17:36:36,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:36,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:36,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:36,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:36,621 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-01-31 17:36:36,622 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:36,652 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:36,667 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:36,678 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:36,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:36,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:36,718 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-01-31 17:36:36,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:36,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:36,752 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-01-31 17:36:36,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:36,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:36,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:36,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:36,805 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-01-31 17:36:36,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:36,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:36,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:36,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:36,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:36,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:36,873 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-01-31 17:36:36,874 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:36,897 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:36,919 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:36,942 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:36,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:36,979 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-01-31 17:36:37,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,025 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-01-31 17:36:37,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:37,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:37,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-31 17:36:37,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,112 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-01-31 17:36:37,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:37,156 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-01-31 17:36:37,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-31 17:36:37,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,261 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:36:37,261 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-01-31 17:36:37,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:37,303 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-01-31 17:36:37,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-31 17:36:37,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,380 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:36:37,381 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-01-31 17:36:37,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:37,415 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-01-31 17:36:37,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-31 17:36:37,439 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:37,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:37,498 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:37,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:37,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:36:37,517 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:37,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:36:37,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:36:37,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:36:37,517 INFO L87 Difference]: Start difference. First operand 774 states and 4522 transitions. Second operand 12 states. [2019-01-31 17:36:40,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:40,211 INFO L93 Difference]: Finished difference Result 821 states and 4651 transitions. [2019-01-31 17:36:40,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:36:40,212 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-31 17:36:40,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:40,218 INFO L225 Difference]: With dead ends: 821 [2019-01-31 17:36:40,218 INFO L226 Difference]: Without dead ends: 820 [2019-01-31 17:36:40,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-01-31 17:36:40,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-01-31 17:36:42,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 736. [2019-01-31 17:36:42,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-01-31 17:36:42,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 4294 transitions. [2019-01-31 17:36:42,211 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 4294 transitions. Word has length 7 [2019-01-31 17:36:42,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:42,211 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 4294 transitions. [2019-01-31 17:36:42,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:36:42,211 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 4294 transitions. [2019-01-31 17:36:42,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:36:42,213 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:42,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:36:42,213 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:42,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:42,214 INFO L82 PathProgramCache]: Analyzing trace with hash -2017620956, now seen corresponding path program 1 times [2019-01-31 17:36:42,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:42,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:42,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:42,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:42,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:42,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:42,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:42,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:42,252 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:36:42,252 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [29] [2019-01-31 17:36:42,253 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:42,253 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:42,476 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:42,476 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-01-31 17:36:42,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:42,476 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:42,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:42,477 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-01-31 17:36:42,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:42,485 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:42,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:42,493 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-01-31 17:36:42,497 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-01-31 17:36:42,509 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-01-31 17:36:42,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:42,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:42,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:42,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:42,544 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-01-31 17:36:42,544 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:42,554 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:42,565 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:42,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:42,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, 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-01-31 17:36:42,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, 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-01-31 17:36:42,598 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-01-31 17:36:42,607 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-01-31 17:36:42,614 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-01-31 17:36:42,615 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:42,630 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:42,639 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:42,649 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:42,659 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:42,679 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-01-31 17:36:42,680 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:36, output treesize:42 [2019-01-31 17:36:42,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:42,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-31 17:36:42,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:42,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:42,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-31 17:36:42,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:42,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:42,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:42,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:42,723 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-01-31 17:36:42,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:42,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:42,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-01-31 17:36:42,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:42,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:42,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:42,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:42,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:36:42,780 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:42,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:36:42,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:36:42,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:36:42,781 INFO L87 Difference]: Start difference. First operand 736 states and 4294 transitions. Second operand 8 states. [2019-01-31 17:36:44,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:44,920 INFO L93 Difference]: Finished difference Result 805 states and 4572 transitions. [2019-01-31 17:36:44,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:36:44,921 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-31 17:36:44,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:44,929 INFO L225 Difference]: With dead ends: 805 [2019-01-31 17:36:44,929 INFO L226 Difference]: Without dead ends: 804 [2019-01-31 17:36:44,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:36:44,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-01-31 17:36:47,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 776. [2019-01-31 17:36:47,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-01-31 17:36:47,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 4534 transitions. [2019-01-31 17:36:47,006 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 4534 transitions. Word has length 7 [2019-01-31 17:36:47,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:47,007 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 4534 transitions. [2019-01-31 17:36:47,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:36:47,007 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 4534 transitions. [2019-01-31 17:36:47,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:36:47,010 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:47,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:36:47,011 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:47,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:47,011 INFO L82 PathProgramCache]: Analyzing trace with hash -2018040016, now seen corresponding path program 1 times [2019-01-31 17:36:47,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:47,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:47,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:47,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:47,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:47,201 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:36:47,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:47,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:47,202 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:36:47,202 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [27] [2019-01-31 17:36:47,203 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:47,203 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:47,514 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:47,514 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-01-31 17:36:47,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:47,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:47,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:47,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 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-01-31 17:36:47,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:47,522 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:47,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:47,531 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-01-31 17:36:47,536 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-01-31 17:36:47,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,543 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-01-31 17:36:47,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,552 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-01-31 17:36:47,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,573 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-01-31 17:36:47,574 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:47,613 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:47,626 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:47,636 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:47,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:47,667 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-01-31 17:36:47,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,685 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-01-31 17:36:47,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,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, 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-01-31 17:36:47,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,768 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-01-31 17:36:47,769 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:47,784 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:47,799 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:47,815 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:47,843 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-01-31 17:36:47,843 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-31 17:36:47,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,889 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-01-31 17:36:47,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:47,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:47,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:36:47,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,933 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-01-31 17:36:47,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:47,952 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-01-31 17:36:47,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:36:47,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,981 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:36:47,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,982 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-01-31 17:36:47,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:48,007 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-01-31 17:36:48,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-31 17:36: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-01-31 17:36:48,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:48,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:48,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:48,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:36:48,095 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:48,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:36:48,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:36:48,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:36:48,096 INFO L87 Difference]: Start difference. First operand 776 states and 4534 transitions. Second operand 10 states. [2019-01-31 17:36:50,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:50,976 INFO L93 Difference]: Finished difference Result 1004 states and 5711 transitions. [2019-01-31 17:36:50,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:36:50,984 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:36:50,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:50,994 INFO L225 Difference]: With dead ends: 1004 [2019-01-31 17:36:50,994 INFO L226 Difference]: Without dead ends: 1003 [2019-01-31 17:36:50,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:36:50,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-01-31 17:36:53,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 847. [2019-01-31 17:36:53,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-01-31 17:36:53,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 4961 transitions. [2019-01-31 17:36:53,274 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 4961 transitions. Word has length 7 [2019-01-31 17:36:53,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:53,275 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 4961 transitions. [2019-01-31 17:36:53,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:36:53,275 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 4961 transitions. [2019-01-31 17:36:53,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:36:53,277 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:53,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:36:53,278 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:53,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:53,278 INFO L82 PathProgramCache]: Analyzing trace with hash -2030550250, now seen corresponding path program 1 times [2019-01-31 17:36:53,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:53,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:53,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:53,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:53,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:53,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:53,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:53,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:53,376 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:36:53,377 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [28], [29] [2019-01-31 17:36:53,378 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:53,378 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:53,597 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:53,598 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-01-31 17:36:53,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:53,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:53,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:53,598 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-01-31 17:36:53,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:53,607 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:53,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:53,615 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-01-31 17:36:53,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,642 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-01-31 17:36:53,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,689 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-01-31 17:36:53,689 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:53,698 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:53,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:53,720 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-01-31 17:36:53,724 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-01-31 17:36:53,726 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-01-31 17:36:53,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, 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-01-31 17:36:53,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, 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-01-31 17:36:53,737 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:53,753 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:53,767 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:53,777 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:53,787 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:53,807 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-01-31 17:36:53,807 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-31 17:36:53,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,836 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-01-31 17:36:53,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:53,853 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-01-31 17:36:53,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:29 [2019-01-31 17:36:53,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,890 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-01-31 17:36:53,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:36:53,998 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-01-31 17:36:53,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:46 [2019-01-31 17:36:54,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:54,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:54,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:54,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:54,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-31 17:36:54,116 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:54,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:36:54,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:36:54,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:36:54,117 INFO L87 Difference]: Start difference. First operand 847 states and 4961 transitions. Second operand 9 states. [2019-01-31 17:36:57,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:57,487 INFO L93 Difference]: Finished difference Result 1213 states and 6892 transitions. [2019-01-31 17:36:57,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:36:57,487 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-31 17:36:57,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:57,496 INFO L225 Difference]: With dead ends: 1213 [2019-01-31 17:36:57,496 INFO L226 Difference]: Without dead ends: 1212 [2019-01-31 17:36:57,496 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-01-31 17:36:57,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-01-31 17:37:00,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1101. [2019-01-31 17:37:00,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2019-01-31 17:37:00,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 6484 transitions. [2019-01-31 17:37:00,468 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 6484 transitions. Word has length 7 [2019-01-31 17:37:00,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:37:00,468 INFO L480 AbstractCegarLoop]: Abstraction has 1101 states and 6484 transitions. [2019-01-31 17:37:00,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:37:00,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 6484 transitions. [2019-01-31 17:37:00,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:37:00,470 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:37:00,471 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:37:00,471 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:37:00,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:00,471 INFO L82 PathProgramCache]: Analyzing trace with hash -2026994678, now seen corresponding path program 1 times [2019-01-31 17:37:00,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:37:00,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:00,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:37:00,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:00,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:37:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:37:00,606 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:00,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:00,607 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:37:00,607 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:37:00,607 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [25] [2019-01-31 17:37:00,608 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:37:00,608 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:37:00,989 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:37:00,989 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-01-31 17:37:00,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:00,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:37:00,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:00,990 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-01-31 17:37:00,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:37:00,998 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:37:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:37:01,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:37:01,034 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-01-31 17:37:01,037 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-01-31 17:37:01,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,047 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-01-31 17:37:01,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,055 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-01-31 17:37:01,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,069 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-01-31 17:37:01,070 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:01,099 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:01,115 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:01,126 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:01,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:01,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,166 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-01-31 17:37:01,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,200 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-01-31 17:37:01,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,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, 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-01-31 17:37:01,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,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-01-31 17:37:01,291 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:01,308 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:01,322 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:01,338 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:01,369 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-01-31 17:37:01,369 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-31 17:37:01,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,402 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-01-31 17:37:01,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:01,431 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-01-31 17:37:01,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-31 17:37:01,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,464 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:37:01,465 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-01-31 17:37:01,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:01,495 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-01-31 17:37:01,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:42 [2019-01-31 17:37:01,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,530 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-01-31 17:37:01,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:01,561 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-01-31 17:37:01,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:38 [2019-01-31 17:37:01,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,594 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:37:01,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 40 treesize of output 96 [2019-01-31 17:37:01,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:01,631 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-01-31 17:37:01,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:37:01,654 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:01,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:37:01,700 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:01,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:37:01,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:37:01,718 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:37:01,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:37:01,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:37:01,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:37:01,719 INFO L87 Difference]: Start difference. First operand 1101 states and 6484 transitions. Second operand 12 states. [2019-01-31 17:37:06,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:37:06,209 INFO L93 Difference]: Finished difference Result 1577 states and 9103 transitions. [2019-01-31 17:37:06,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:37:06,209 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-31 17:37:06,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:37:06,223 INFO L225 Difference]: With dead ends: 1577 [2019-01-31 17:37:06,224 INFO L226 Difference]: Without dead ends: 1575 [2019-01-31 17:37:06,224 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-01-31 17:37:06,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2019-01-31 17:37:08,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 754. [2019-01-31 17:37:08,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-01-31 17:37:08,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 4401 transitions. [2019-01-31 17:37:08,344 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 4401 transitions. Word has length 7 [2019-01-31 17:37:08,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:37:08,345 INFO L480 AbstractCegarLoop]: Abstraction has 754 states and 4401 transitions. [2019-01-31 17:37:08,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:37:08,345 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 4401 transitions. [2019-01-31 17:37:08,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:37:08,346 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:37:08,346 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:37:08,346 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:37:08,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:08,346 INFO L82 PathProgramCache]: Analyzing trace with hash -2027404064, now seen corresponding path program 1 times [2019-01-31 17:37:08,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:37:08,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:08,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:37:08,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:08,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:37:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:37:08,496 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-31 17:37:08,536 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:37:08,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:08,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:37:08,536 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:37:08,536 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [25] [2019-01-31 17:37:08,537 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:37:08,537 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:37:08,860 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:37:08,860 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-01-31 17:37:08,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:08,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:37:08,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:08,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 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-01-31 17:37:08,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:37:08,869 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:37:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:37:08,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:37:08,901 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-01-31 17:37:08,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, 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-01-31 17:37:08,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:08,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:08,909 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-01-31 17:37:08,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:08,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:08,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:08,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, 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-01-31 17:37:08,933 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-01-31 17:37:08,933 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:08,958 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:08,972 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:08,984 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:08,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:09,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:09,018 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-01-31 17:37:09,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:09,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:09,046 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-01-31 17:37:09,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:09,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:09,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:09,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:09,078 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-01-31 17:37:09,078 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:09,088 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:09,097 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:09,118 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-01-31 17:37:09,119 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-31 17:37:09,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:09,165 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-01-31 17:37:09,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:09,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:09,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:37:09,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:09,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:09,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:09,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:09,209 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:37:09,210 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-01-31 17:37:09,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:09,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:09,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-01-31 17:37:09,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:09,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:09,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:09,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:09,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:09,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:09,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:09,255 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-01-31 17:37:09,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:09,277 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-01-31 17:37:09,277 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-31 17:37:09,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:09,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:09,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:09,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:09,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:09,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:09,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:09,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:09,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:09,306 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:37:09,307 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-01-31 17:37:09,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:09,330 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-01-31 17:37:09,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-31 17:37:09,349 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:09,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:37:09,398 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:09,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:37:09,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-31 17:37:09,416 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:37:09,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:37:09,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:37:09,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:37:09,417 INFO L87 Difference]: Start difference. First operand 754 states and 4401 transitions. Second operand 11 states. [2019-01-31 17:37:12,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:37:12,885 INFO L93 Difference]: Finished difference Result 1108 states and 6316 transitions. [2019-01-31 17:37:12,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:37:12,885 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-31 17:37:12,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:37:12,892 INFO L225 Difference]: With dead ends: 1108 [2019-01-31 17:37:12,892 INFO L226 Difference]: Without dead ends: 1107 [2019-01-31 17:37:12,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:37:12,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-01-31 17:37:15,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1052. [2019-01-31 17:37:15,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-01-31 17:37:15,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 6189 transitions. [2019-01-31 17:37:15,883 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 6189 transitions. Word has length 7 [2019-01-31 17:37:15,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:37:15,883 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 6189 transitions. [2019-01-31 17:37:15,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:37:15,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 6189 transitions. [2019-01-31 17:37:15,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:37:15,885 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:37:15,885 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:37:15,885 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:37:15,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:15,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1973291948, now seen corresponding path program 1 times [2019-01-31 17:37:15,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:37:15,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:15,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:37:15,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:15,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:37:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:37:15,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:37:15,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:15,989 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:37:15,989 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:37:15,990 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [26], [28], [29] [2019-01-31 17:37:15,990 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:37:15,991 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:37:16,494 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:37:16,495 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-01-31 17:37:16,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:16,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:37:16,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:16,495 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-01-31 17:37:16,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:37:16,504 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:37:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:37:16,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:37:16,519 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-01-31 17:37:16,523 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-01-31 17:37:16,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:16,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:16,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, 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-01-31 17:37:16,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:16,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:16,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:16,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, 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-01-31 17:37:16,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:16,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:16,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:16,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:16,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, 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-01-31 17:37:16,560 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:16,594 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:16,608 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:16,617 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:16,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:16,650 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-01-31 17:37:16,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:16,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:16,666 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-01-31 17:37:16,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:16,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:16,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:16,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:16,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, 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-01-31 17:37:16,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:16,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:16,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:16,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:16,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:16,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:16,748 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-01-31 17:37:16,748 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:16,762 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:16,776 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:16,792 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:16,820 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-01-31 17:37:16,821 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:37:16,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:16,846 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-01-31 17:37:16,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:16,874 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-01-31 17:37:16,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:37:16,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:16,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:16,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:16,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:16,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:16,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:16,901 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:37:16,910 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-01-31 17:37:16,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:37:17,006 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-01-31 17:37:17,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-31 17:37:17,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:17,039 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:37:17,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:17,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:37:17,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:37:17,078 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:37:17,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:37:17,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:37:17,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:37:17,079 INFO L87 Difference]: Start difference. First operand 1052 states and 6189 transitions. Second operand 8 states. [2019-01-31 17:37:20,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:37:20,193 INFO L93 Difference]: Finished difference Result 1075 states and 6230 transitions. [2019-01-31 17:37:20,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:37:20,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-31 17:37:20,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:37:20,199 INFO L225 Difference]: With dead ends: 1075 [2019-01-31 17:37:20,199 INFO L226 Difference]: Without dead ends: 1074 [2019-01-31 17:37:20,200 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-01-31 17:37:20,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2019-01-31 17:37:23,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1054. [2019-01-31 17:37:23,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-01-31 17:37:23,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 6201 transitions. [2019-01-31 17:37:23,169 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 6201 transitions. Word has length 7 [2019-01-31 17:37:23,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:37:23,169 INFO L480 AbstractCegarLoop]: Abstraction has 1054 states and 6201 transitions. [2019-01-31 17:37:23,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:37:23,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 6201 transitions. [2019-01-31 17:37:23,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:37:23,171 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:37:23,171 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:37:23,172 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:37:23,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:23,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1973720682, now seen corresponding path program 1 times [2019-01-31 17:37:23,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:37:23,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:23,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:37:23,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:23,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:37:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:37:23,320 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-31 17:37:23,650 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:37:23,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:23,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:37:23,650 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:37:23,650 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [25] [2019-01-31 17:37:23,651 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:37:23,651 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:37:24,398 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:37:24,399 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-01-31 17:37:24,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:24,399 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:37:24,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:24,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 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-01-31 17:37:24,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:37:24,415 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:37:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:37:24,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:37:24,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, 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-01-31 17:37:24,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, 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-01-31 17:37:24,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:24,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:24,453 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-01-31 17:37:24,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:24,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:24,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:24,484 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-01-31 17:37:24,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:24,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:24,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:24,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:24,495 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-01-31 17:37:24,495 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:24,528 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:24,544 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:24,556 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:24,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:24,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:24,594 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-01-31 17:37:24,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:24,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:24,629 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-01-31 17:37:24,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:24,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:24,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:24,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:24,668 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-01-31 17:37:24,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:24,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:24,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:24,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:24,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:24,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:24,717 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-01-31 17:37:24,717 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:24,734 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:24,750 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:24,766 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:24,796 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-01-31 17:37:24,797 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-31 17:37:24,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:24,829 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-01-31 17:37:24,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:24,858 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-01-31 17:37:24,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-31 17:37:24,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:24,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:24,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:24,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:24,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:24,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:24,981 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:37:24,981 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-01-31 17:37:24,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:25,012 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-01-31 17:37:25,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-31 17:37:25,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:25,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:25,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:25,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:25,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:25,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:25,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:25,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:25,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:25,043 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-01-31 17:37:25,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:25,078 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-01-31 17:37:25,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-01-31 17:37:25,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:25,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:25,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:25,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:25,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:25,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:25,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:25,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:25,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:25,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:25,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:25,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:25,118 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:37:25,121 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-01-31 17:37:25,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:25,166 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-01-31 17:37:25,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-31 17:37:25,197 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:25,197 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:37:25,252 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:25,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:37:25,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:37:25,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:37:25,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:37:25,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:37:25,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:37:25,272 INFO L87 Difference]: Start difference. First operand 1054 states and 6201 transitions. Second operand 12 states. [2019-01-31 17:37:29,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:37:29,981 INFO L93 Difference]: Finished difference Result 1522 states and 8743 transitions. [2019-01-31 17:37:29,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:37:29,982 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-31 17:37:29,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:37:29,990 INFO L225 Difference]: With dead ends: 1522 [2019-01-31 17:37:29,990 INFO L226 Difference]: Without dead ends: 1521 [2019-01-31 17:37:29,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:37:29,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2019-01-31 17:37:33,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1125. [2019-01-31 17:37:33,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-01-31 17:37:33,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 6627 transitions. [2019-01-31 17:37:33,252 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 6627 transitions. Word has length 7 [2019-01-31 17:37:33,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:37:33,253 INFO L480 AbstractCegarLoop]: Abstraction has 1125 states and 6627 transitions. [2019-01-31 17:37:33,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:37:33,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 6627 transitions. [2019-01-31 17:37:33,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:37:33,255 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:37:33,255 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:37:33,255 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:37:33,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:33,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1956607002, now seen corresponding path program 1 times [2019-01-31 17:37:33,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:37:33,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:33,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:37:33,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:33,256 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:37:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:37:33,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:33,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:33,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:37:33,288 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:37:33,288 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [28], [30], [31] [2019-01-31 17:37:33,289 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:37:33,289 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:37:34,634 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:37:34,634 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-01-31 17:37:34,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:34,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:37:34,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:34,634 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-01-31 17:37:34,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:37:34,643 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:37:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:37:34,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:37:34,652 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-01-31 17:37:34,656 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-01-31 17:37:34,667 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-01-31 17:37:34,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, 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-01-31 17:37:34,705 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-01-31 17:37:34,706 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:34,719 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:34,727 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:34,737 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:34,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:34,756 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-01-31 17:37:34,756 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-01-31 17:37:34,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:34,761 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-01-31 17:37:34,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:34,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:34,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-31 17:37:34,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:34,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:37:34,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:34,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:37:34,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-31 17:37:34,796 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:37:34,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:37:34,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:37:34,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:37:34,796 INFO L87 Difference]: Start difference. First operand 1125 states and 6627 transitions. Second operand 4 states. [2019-01-31 17:37:38,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:37:38,967 INFO L93 Difference]: Finished difference Result 1559 states and 9048 transitions. [2019-01-31 17:37:38,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:37:38,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-31 17:37:38,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:37:38,975 INFO L225 Difference]: With dead ends: 1559 [2019-01-31 17:37:38,975 INFO L226 Difference]: Without dead ends: 1554 [2019-01-31 17:37:38,975 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-01-31 17:37:38,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2019-01-31 17:37:43,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1528. [2019-01-31 17:37:43,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2019-01-31 17:37:43,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 8994 transitions. [2019-01-31 17:37:43,553 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 8994 transitions. Word has length 7 [2019-01-31 17:37:43,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:37:43,553 INFO L480 AbstractCegarLoop]: Abstraction has 1528 states and 8994 transitions. [2019-01-31 17:37:43,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:37:43,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 8994 transitions. [2019-01-31 17:37:43,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:37:43,556 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:37:43,556 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:37:43,556 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:37:43,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:43,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1969597864, now seen corresponding path program 1 times [2019-01-31 17:37:43,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:37:43,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:43,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:37:43,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:43,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:37:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:37:43,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:37:43,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:43,621 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:37:43,621 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:37:43,621 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [29] [2019-01-31 17:37:43,622 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:37:43,622 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:37:44,105 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:37:44,106 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-01-31 17:37:44,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:44,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:37:44,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:44,106 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-01-31 17:37:44,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:37:44,115 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:37:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:37:44,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:37:44,125 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-01-31 17:37:44,129 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-01-31 17:37:44,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:44,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:44,139 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-01-31 17:37:44,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:44,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:44,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:44,153 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-01-31 17:37:44,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:44,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:44,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:44,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:44,169 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-01-31 17:37:44,170 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:44,198 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:44,210 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:44,221 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:44,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:44,250 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-01-31 17:37:44,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:44,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:44,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 36 treesize of output 49 [2019-01-31 17:37:44,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:44,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:44,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:44,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:44,307 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-01-31 17:37:44,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:44,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:44,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:44,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:44,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:44,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:44,354 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-01-31 17:37:44,354 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:44,368 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:44,383 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:44,399 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:44,428 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-01-31 17:37:44,428 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:37:44,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:44,454 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-01-31 17:37:44,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:44,484 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-01-31 17:37:44,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:37:44,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:44,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:44,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:44,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:44,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:44,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:44,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:44,524 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-01-31 17:37:44,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:37:44,627 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-01-31 17:37:44,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-31 17:37:44,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:44,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:37:44,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:44,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:37:44,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:37:44,715 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:37:44,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:37:44,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:37:44,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:37:44,716 INFO L87 Difference]: Start difference. First operand 1528 states and 8994 transitions. Second operand 8 states. [2019-01-31 17:37:49,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:37:49,208 INFO L93 Difference]: Finished difference Result 1574 states and 9156 transitions. [2019-01-31 17:37:49,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:37:49,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-31 17:37:49,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:37:49,213 INFO L225 Difference]: With dead ends: 1574 [2019-01-31 17:37:49,213 INFO L226 Difference]: Without dead ends: 1570 [2019-01-31 17:37:49,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:37:49,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-01-31 17:37:53,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1547. [2019-01-31 17:37:53,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-01-31 17:37:53,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 9102 transitions. [2019-01-31 17:37:53,718 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 9102 transitions. Word has length 7 [2019-01-31 17:37:53,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:37:53,718 INFO L480 AbstractCegarLoop]: Abstraction has 1547 states and 9102 transitions. [2019-01-31 17:37:53,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:37:53,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 9102 transitions. [2019-01-31 17:37:53,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:37:53,721 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:37:53,721 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-31 17:37:53,721 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:37:53,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:53,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1969901668, now seen corresponding path program 2 times [2019-01-31 17:37:53,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:37:53,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:53,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:37:53,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:53,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:37:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:37:53,784 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:37:53,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:53,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:37:53,784 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:37:53,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:37:53,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:53,785 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-01-31 17:37:53,795 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:37:53,795 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:37:53,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:37:53,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:37:53,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:37:53,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, 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-01-31 17:37:53,810 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-01-31 17:37:53,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:53,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:53,818 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-01-31 17:37:53,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:53,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:53,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:53,832 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-01-31 17:37:53,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:53,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:53,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:53,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:53,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, 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-01-31 17:37:53,852 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:53,897 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:53,913 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:53,927 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:53,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:53,959 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-01-31 17:37:53,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:53,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:53,976 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-01-31 17:37:54,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,014 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-01-31 17:37:54,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,061 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-01-31 17:37:54,061 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:54,073 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:54,088 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:54,104 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:54,132 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-01-31 17:37:54,133 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:37:54,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,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-01-31 17:37:54,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:54,187 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-01-31 17:37:54,187 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-31 17:37:54,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,225 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-01-31 17:37:54,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:37:54,327 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-01-31 17:37:54,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:72 [2019-01-31 17:37:54,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,377 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:37:54,377 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-01-31 17:37:54,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:54,406 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-01-31 17:37:54,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:27 [2019-01-31 17:37:54,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,437 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-01-31 17:37:54,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:54,462 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-01-31 17:37:54,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-01-31 17:37:54,482 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:54,482 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:37:54,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:54,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:37:54,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:37:54,551 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:37:54,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:37:54,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:37:54,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:37:54,552 INFO L87 Difference]: Start difference. First operand 1547 states and 9102 transitions. Second operand 11 states. [2019-01-31 17:38:00,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:38:00,719 INFO L93 Difference]: Finished difference Result 2098 states and 12192 transitions. [2019-01-31 17:38:00,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:38:00,719 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-31 17:38:00,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:38:00,724 INFO L225 Difference]: With dead ends: 2098 [2019-01-31 17:38:00,725 INFO L226 Difference]: Without dead ends: 2091 [2019-01-31 17:38:00,725 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-01-31 17:38:00,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2019-01-31 17:38:06,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1838. [2019-01-31 17:38:06,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-31 17:38:06,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10847 transitions. [2019-01-31 17:38:06,142 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10847 transitions. Word has length 7 [2019-01-31 17:38:06,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:38:06,142 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10847 transitions. [2019-01-31 17:38:06,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:38:06,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10847 transitions. [2019-01-31 17:38:06,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:38:06,145 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:38:06,145 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:38:06,145 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:38:06,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:06,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1965903780, now seen corresponding path program 1 times [2019-01-31 17:38:06,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:38:06,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:06,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:38:06,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:06,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:38:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38: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-01-31 17:38:06,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:06,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:38:06,222 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:38:06,222 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [26], [28], [29] [2019-01-31 17:38:06,223 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:38:06,223 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:38:06,746 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:38:06,747 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-01-31 17:38:06,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:06,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:38:06,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:06,747 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-01-31 17:38:06,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:06,756 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:38:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:06,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:38:06,767 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-01-31 17:38:06,805 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-01-31 17:38:06,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,818 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-01-31 17:38:06,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,829 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-01-31 17:38:06,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,838 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-01-31 17:38:06,838 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:06,867 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:06,880 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:06,891 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:06,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:06,924 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-01-31 17:38:06,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,941 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-01-31 17:38:06,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,976 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-01-31 17:38:07,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,024 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-01-31 17:38:07,024 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:07,037 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:07,052 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:07,068 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:07,096 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-01-31 17:38:07,097 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:38:07,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,134 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-01-31 17:38:07,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:07,152 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-01-31 17:38:07,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:38:07,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,176 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:38:07,177 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-01-31 17:38:07,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:07,195 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-01-31 17:38:07,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-31 17:38:07,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:07,213 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:38:07,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:07,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:38:07,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:38:07,302 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:38:07,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:38:07,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:38:07,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:38:07,303 INFO L87 Difference]: Start difference. First operand 1838 states and 10847 transitions. Second operand 8 states. [2019-01-31 17:38:12,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:38:12,542 INFO L93 Difference]: Finished difference Result 1846 states and 10859 transitions. [2019-01-31 17:38:12,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:38:12,542 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-31 17:38:12,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:38:12,547 INFO L225 Difference]: With dead ends: 1846 [2019-01-31 17:38:12,547 INFO L226 Difference]: Without dead ends: 1839 [2019-01-31 17:38:12,547 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-01-31 17:38:12,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2019-01-31 17:38:17,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1838. [2019-01-31 17:38:17,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-31 17:38:17,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10841 transitions. [2019-01-31 17:38:17,883 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10841 transitions. Word has length 7 [2019-01-31 17:38:17,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:38:17,883 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10841 transitions. [2019-01-31 17:38:17,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:38:17,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10841 transitions. [2019-01-31 17:38:17,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:38:17,887 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:38:17,887 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:38:17,887 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:38:17,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:17,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1931530426, now seen corresponding path program 1 times [2019-01-31 17:38:17,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:38:17,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:17,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:17,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:17,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:38:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:18,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:38:18,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:18,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:38:18,034 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:38:18,034 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [27] [2019-01-31 17:38:18,036 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:38:18,036 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:38:18,295 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:38:18,295 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-01-31 17:38:18,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:18,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:38:18,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:18,296 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-01-31 17:38:18,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:18,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:38:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:18,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:38:18,349 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-01-31 17:38:18,353 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-01-31 17:38:18,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,365 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-01-31 17:38:18,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,377 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-01-31 17:38:18,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,392 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-01-31 17:38:18,392 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:18,419 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:18,432 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:18,441 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:18,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:18,472 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-01-31 17:38:18,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,492 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-01-31 17:38:18,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,528 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-01-31 17:38:18,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,573 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-01-31 17:38:18,574 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:18,589 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:18,603 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:18,620 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:18,648 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-01-31 17:38:18,648 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-31 17:38:18,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,688 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-01-31 17:38:18,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:38:18,785 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-01-31 17:38:18,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:96 [2019-01-31 17:38:18,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,884 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-01-31 17:38:18,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:18,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,950 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-01-31 17:38:18,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:18,997 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-01-31 17:38:18,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:64 [2019-01-31 17:38:19,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:19,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:19,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:19,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:19,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:19,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:19,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:19,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:19,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:19,051 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:38:19,052 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-01-31 17:38:19,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:19,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:19,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:19,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:19,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:19,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:19,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:19,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:19,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:19,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:19,110 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:38:19,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:19,112 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-01-31 17:38:19,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:19,168 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-01-31 17:38:19,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-01-31 17:38:19,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:19,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:38:19,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:19,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:38:19,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-31 17:38:19,320 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:38:19,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:38:19,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:38:19,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:38:19,320 INFO L87 Difference]: Start difference. First operand 1838 states and 10841 transitions. Second operand 11 states. [2019-01-31 17:38:21,226 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-01-31 17:38:26,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:38:26,490 INFO L93 Difference]: Finished difference Result 2193 states and 12710 transitions. [2019-01-31 17:38:26,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:38:26,490 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-31 17:38:26,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:38:26,496 INFO L225 Difference]: With dead ends: 2193 [2019-01-31 17:38:26,496 INFO L226 Difference]: Without dead ends: 2192 [2019-01-31 17:38:26,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:38:26,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2019-01-31 17:38:32,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1949. [2019-01-31 17:38:32,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2019-01-31 17:38:32,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 11505 transitions. [2019-01-31 17:38:32,315 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 11505 transitions. Word has length 7 [2019-01-31 17:38:32,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:38:32,315 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 11505 transitions. [2019-01-31 17:38:32,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:38:32,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 11505 transitions. [2019-01-31 17:38:32,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:38:32,318 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:38:32,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:38:32,318 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:38:32,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:32,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 2 times [2019-01-31 17:38:32,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:38:32,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:32,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:32,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:32,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:38:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:32,462 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-31 17:38:32,613 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-31 17:38:33,081 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:33,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:33,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:38:33,081 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:38:33,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:38:33,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:33,082 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-01-31 17:38:33,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:38:33,097 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:38:33,142 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:38:33,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:38:33,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:38:33,314 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-31 17:38:33,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,337 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-01-31 17:38:33,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,375 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-01-31 17:38:33,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,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, 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-01-31 17:38:33,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,471 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-01-31 17:38:33,471 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:33,613 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:33,631 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:33,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:33,680 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-01-31 17:38:33,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, 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-01-31 17:38:33,687 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-01-31 17:38:33,689 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-01-31 17:38:33,691 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-01-31 17:38:33,691 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:33,715 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:33,730 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:33,740 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:33,749 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:33,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-01-31 17:38:33,781 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-31 17:38:33,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,813 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-01-31 17:38:33,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:33,845 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-01-31 17:38:33,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-31 17:38:33,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,907 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-01-31 17:38:33,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:33,944 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-01-31 17:38:33,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:38 [2019-01-31 17:38:33,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,980 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:38:33,981 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-01-31 17:38:33,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:34,016 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-01-31 17:38:34,016 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-31 17:38:34,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:34,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:34,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:34,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:34,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:34,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:34,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:34,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:34,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:34,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:34,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:34,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:34,053 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:38:34,054 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-01-31 17:38:34,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:34,090 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-01-31 17:38:34,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-31 17:38:34,114 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:34,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:38:34,167 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:34,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:38:34,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:38:34,188 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:38:34,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:38:34,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:38:34,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:38:34,189 INFO L87 Difference]: Start difference. First operand 1949 states and 11505 transitions. Second operand 12 states. [2019-01-31 17:38:41,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:38:41,747 INFO L93 Difference]: Finished difference Result 2526 states and 14755 transitions. [2019-01-31 17:38:41,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:38:41,748 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-31 17:38:41,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:38:41,754 INFO L225 Difference]: With dead ends: 2526 [2019-01-31 17:38:41,754 INFO L226 Difference]: Without dead ends: 2520 [2019-01-31 17:38:41,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:38:41,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2019-01-31 17:38:47,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 1960. [2019-01-31 17:38:47,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1960 states. [2019-01-31 17:38:47,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 11570 transitions. [2019-01-31 17:38:47,640 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 11570 transitions. Word has length 7 [2019-01-31 17:38:47,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:38:47,640 INFO L480 AbstractCegarLoop]: Abstraction has 1960 states and 11570 transitions. [2019-01-31 17:38:47,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:38:47,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 11570 transitions. [2019-01-31 17:38:47,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:38:47,643 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:38:47,643 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:38:47,644 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:38:47,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:47,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1928255402, now seen corresponding path program 1 times [2019-01-31 17:38:47,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:38:47,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:47,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:38:47,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:47,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:38:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:47,849 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-31 17:38:48,056 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-31 17:38:48,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:38:48,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:48,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:38:48,079 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:38:48,079 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [26], [28], [29] [2019-01-31 17:38:48,080 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:38:48,080 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:38:48,280 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:38:48,280 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-01-31 17:38:48,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:48,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:38:48,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:48,280 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-01-31 17:38:48,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:48,292 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:38:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:48,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:38:48,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 18 treesize of output 21 [2019-01-31 17:38:48,309 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-01-31 17:38:48,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:48,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:48,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-31 17:38:48,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:48,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:48,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:48,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, 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-01-31 17:38:48,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:48,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:48,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:48,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:48,354 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-01-31 17:38:48,354 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:48,381 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:48,395 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:48,406 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:48,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:48,438 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-01-31 17:38:48,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:48,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:48,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-01-31 17:38:48,571 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2019-01-31 17:38:48,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:48,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:48,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:48,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:48,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, 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-01-31 17:38:48,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:48,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:48,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:48,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:48,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:48,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:48,625 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-01-31 17:38:48,625 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:48,640 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:48,655 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:48,671 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:48,700 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-01-31 17:38:48,700 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:38:48,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:48,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, 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-01-31 17:38:48,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:38:48,834 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-01-31 17:38:48,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:96 [2019-01-31 17:38:48,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:48,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:48,875 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:38:48,876 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-01-31 17:38:48,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:48,896 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-01-31 17:38:48,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:29 [2019-01-31 17:38:48,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-01-31 17:38:48,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:38:48,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:48,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:38:48,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-01-31 17:38:48,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:38:48,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:38:48,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:38:48,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:38:48,960 INFO L87 Difference]: Start difference. First operand 1960 states and 11570 transitions. Second operand 9 states. [2019-01-31 17:38:54,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:38:54,757 INFO L93 Difference]: Finished difference Result 1971 states and 11600 transitions. [2019-01-31 17:38:54,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:38:54,758 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-31 17:38:54,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:38:54,763 INFO L225 Difference]: With dead ends: 1971 [2019-01-31 17:38:54,763 INFO L226 Difference]: Without dead ends: 1964 [2019-01-31 17:38:54,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:38:54,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-01-31 17:39:00,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-01-31 17:39:00,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-01-31 17:39:00,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 11590 transitions. [2019-01-31 17:39:00,699 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 11590 transitions. Word has length 7 [2019-01-31 17:39:00,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:39:00,699 INFO L480 AbstractCegarLoop]: Abstraction has 1964 states and 11590 transitions. [2019-01-31 17:39:00,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:39:00,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 11590 transitions. [2019-01-31 17:39:00,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:39:00,703 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:39:00,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:39:00,704 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:39:00,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:39:00,704 INFO L82 PathProgramCache]: Analyzing trace with hash 2048132400, now seen corresponding path program 2 times [2019-01-31 17:39:00,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:39:00,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:00,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:39:00,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:00,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:39:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:39:00,851 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-31 17:39:00,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:39:00,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:00,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:39:00,918 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:39:00,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:39:00,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:00,918 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-01-31 17:39:00,928 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:39:00,928 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:39:00,934 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:39:00,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:39:00,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:39:00,939 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-01-31 17:39:00,943 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-01-31 17:39:00,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:00,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:00,950 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-01-31 17:39:00,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:00,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:00,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:00,957 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-01-31 17:39:00,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:00,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:00,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:00,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:00,965 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-01-31 17:39:00,965 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:00,990 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:01,003 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:01,014 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:01,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:01,047 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-01-31 17:39:01,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,064 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-01-31 17:39:01,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,103 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-01-31 17:39:01,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,150 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-01-31 17:39:01,150 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:01,163 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:01,178 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:01,194 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:01,222 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-01-31 17:39:01,222 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-31 17:39:01,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,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, 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-01-31 17:39:01,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:01,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:01,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:39:01,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,317 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-01-31 17:39:01,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:01,340 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-01-31 17:39:01,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:39:01,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,369 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:01,370 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-01-31 17:39:01,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:01,393 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-01-31 17:39:01,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-31 17:39:01,414 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:01,414 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:39:01,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:01,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:39:01,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-31 17:39:01,469 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:39:01,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:39:01,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:39:01,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:39:01,470 INFO L87 Difference]: Start difference. First operand 1964 states and 11590 transitions. Second operand 9 states. [2019-01-31 17:39:07,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:39:07,595 INFO L93 Difference]: Finished difference Result 2036 states and 11913 transitions. [2019-01-31 17:39:07,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:39:07,595 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-31 17:39:07,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:39:07,601 INFO L225 Difference]: With dead ends: 2036 [2019-01-31 17:39:07,601 INFO L226 Difference]: Without dead ends: 2033 [2019-01-31 17:39:07,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:39:07,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2019-01-31 17:39:13,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2012. [2019-01-31 17:39:13,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2019-01-31 17:39:13,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 11885 transitions. [2019-01-31 17:39:13,737 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 11885 transitions. Word has length 7 [2019-01-31 17:39:13,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:39:13,737 INFO L480 AbstractCegarLoop]: Abstraction has 2012 states and 11885 transitions. [2019-01-31 17:39:13,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:39:13,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 11885 transitions. [2019-01-31 17:39:13,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:39:13,741 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:39:13,741 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:39:13,741 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:39:13,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:39:13,741 INFO L82 PathProgramCache]: Analyzing trace with hash 2047765234, now seen corresponding path program 3 times [2019-01-31 17:39:13,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:39:13,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:13,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:39:13,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:13,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:39:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:39:13,849 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:39:13,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:13,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:39:13,850 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:39:13,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:39:13,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:13,850 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-01-31 17:39:13,861 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:39:13,861 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:39:13,865 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:39:13,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:39:13,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:39:13,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:13,889 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-01-31 17:39:13,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:13,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:13,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, 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-01-31 17:39:13,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:13,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:13,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:13,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:13,952 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-01-31 17:39:13,953 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:13,964 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:13,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:14,014 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-01-31 17:39:14,023 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-01-31 17:39:14,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, 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-01-31 17:39:14,028 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-01-31 17:39:14,035 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-01-31 17:39:14,036 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:14,054 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:14,068 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:14,080 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:14,090 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39: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-01-31 17:39:14,110 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-31 17:39:14,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:14,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, 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-01-31 17:39:14,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:39:14,222 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-01-31 17:39:14,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:75 [2019-01-31 17:39:14,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:14,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:14,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:14,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:14,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:14,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:14,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:14,312 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-01-31 17:39:14,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-31 17:39:14,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:14,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:14,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:14,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:14,490 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:14,490 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-01-31 17:39:14,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:14,581 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-01-31 17:39:14,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:96, output treesize:167 [2019-01-31 17:39:14,704 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-01-31 17:39:14,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:14,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, 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-01-31 17:39:14,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:15,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,060 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-01-31 17:39:15,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:15,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,154 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:15,154 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-01-31 17:39:15,155 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:15,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,236 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:15,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,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 37 treesize of output 71 [2019-01-31 17:39:15,238 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:15,303 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-01-31 17:39:15,304 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:167, output treesize:115 [2019-01-31 17:39:15,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,376 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:15,377 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-01-31 17:39:15,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:15,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,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, 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-01-31 17:39:15,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:15,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,538 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:15,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,540 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-01-31 17:39:15,540 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:15,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:15,621 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-01-31 17:39:15,621 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:15,691 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-01-31 17:39:15,691 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:155, output treesize:111 [2019-01-31 17:39:15,828 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-01-31 17:39:15,830 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:15,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:39:15,963 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:15,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:39:15,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:39:15,984 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:39:15,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:39:15,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:39:15,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:39:15,985 INFO L87 Difference]: Start difference. First operand 2012 states and 11885 transitions. Second operand 11 states. [2019-01-31 17:39:18,038 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-01-31 17:39:25,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:39:25,587 INFO L93 Difference]: Finished difference Result 2952 states and 17243 transitions. [2019-01-31 17:39:25,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:39:25,587 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-31 17:39:25,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:39:25,596 INFO L225 Difference]: With dead ends: 2952 [2019-01-31 17:39:25,596 INFO L226 Difference]: Without dead ends: 2951 [2019-01-31 17:39:25,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-01-31 17:39:25,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2019-01-31 17:39:31,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1726. [2019-01-31 17:39:31,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-01-31 17:39:31,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 10171 transitions. [2019-01-31 17:39:31,109 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 10171 transitions. Word has length 7 [2019-01-31 17:39:31,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:39:31,109 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 10171 transitions. [2019-01-31 17:39:31,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:39:31,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 10171 transitions. [2019-01-31 17:39:31,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:39:31,111 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:39:31,111 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:39:31,112 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:39:31,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:39:31,112 INFO L82 PathProgramCache]: Analyzing trace with hash 2035383838, now seen corresponding path program 1 times [2019-01-31 17:39:31,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:39:31,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:31,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:39:31,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:31,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:39:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:39:31,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:39:31,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:31,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:39:31,266 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:39:31,266 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [29] [2019-01-31 17:39:31,267 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:39:31,267 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:39:31,464 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:39:31,464 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-01-31 17:39:31,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:39:31,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:39:31,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:31,465 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-01-31 17:39:31,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:39:31,474 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:39:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:39:31,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:39:31,486 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-01-31 17:39:31,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:31,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:31,517 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-01-31 17:39:31,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:31,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:31,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:31,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:31,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, 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-01-31 17:39:31,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:31,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:31,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:31,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:31,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:31,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:31,612 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-01-31 17:39:31,613 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:31,628 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:31,643 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:31,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:31,680 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-01-31 17:39:31,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, 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-01-31 17:39:31,687 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-01-31 17:39:31,690 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-01-31 17:39:31,694 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-01-31 17:39:31,694 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:31,716 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:31,729 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:31,739 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:31,749 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:31,777 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-01-31 17:39:31,777 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:39:31,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:31,813 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-01-31 17:39:31,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:39:31,909 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-01-31 17:39:31,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-01-31 17:39:31,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:31,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:31,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:31,980 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:31,980 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-01-31 17:39:31,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:32,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:32,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:32,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:32,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:32,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:32,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:32,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:32,046 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-01-31 17:39:32,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:32,106 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-01-31 17:39:32,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:112, output treesize:86 [2019-01-31 17:39:32,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:32,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:39:32,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:32,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:39:32,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-01-31 17:39:32,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:39:32,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:39:32,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:39:32,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:39:32,207 INFO L87 Difference]: Start difference. First operand 1726 states and 10171 transitions. Second operand 10 states. [2019-01-31 17:39:42,518 WARN L181 SmtUtils]: Spent 10.19 s on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-01-31 17:39:42,710 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-01-31 17:39:44,476 WARN L181 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-01-31 17:39:50,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:39:50,439 INFO L93 Difference]: Finished difference Result 1903 states and 11093 transitions. [2019-01-31 17:39:50,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:39:50,440 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:39:50,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:39:50,444 INFO L225 Difference]: With dead ends: 1903 [2019-01-31 17:39:50,445 INFO L226 Difference]: Without dead ends: 1896 [2019-01-31 17:39:50,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:39:50,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-01-31 17:39:56,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1875. [2019-01-31 17:39:56,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2019-01-31 17:39:56,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 11063 transitions. [2019-01-31 17:39:56,739 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 11063 transitions. Word has length 7 [2019-01-31 17:39:56,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:39:56,739 INFO L480 AbstractCegarLoop]: Abstraction has 1875 states and 11063 transitions. [2019-01-31 17:39:56,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:39:56,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 11063 transitions. [2019-01-31 17:39:56,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:39:56,742 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:39:56,742 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:39:56,742 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:39:56,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:39:56,742 INFO L82 PathProgramCache]: Analyzing trace with hash -2145066854, now seen corresponding path program 2 times [2019-01-31 17:39:56,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:39:56,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:56,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:39:56,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:56,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:39:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:39:56,908 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 16 [2019-01-31 17:39:56,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:39:56,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:56,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:39:56,928 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:39:56,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:39:56,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:56,928 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-01-31 17:39:56,937 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:39:56,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:39:56,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-31 17:39:56,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:39:56,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:39:56,946 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-01-31 17:39:56,949 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-01-31 17:39:56,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:56,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:56,956 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-01-31 17:39:56,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:56,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:56,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:56,962 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-01-31 17:39:56,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:56,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:56,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:56,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:56,970 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-01-31 17:39:56,971 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:56,997 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:57,009 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:57,020 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:57,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:57,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-01-31 17:39:57,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:57,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:57,082 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-01-31 17:39:57,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:57,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:57,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:57,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:57,118 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-01-31 17:39:57,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:57,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:57,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:57,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:57,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:57,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:57,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-01-31 17:39:57,165 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:57,181 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:57,195 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:57,211 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:57,240 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-01-31 17:39:57,240 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:39:57,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:57,266 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-01-31 17:39:57,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:57,294 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-01-31 17:39:57,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:39:57,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:57,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:57,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:57,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:57,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:57,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:57,323 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:57,332 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-01-31 17:39:57,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:39:57,425 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-01-31 17:39:57,426 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:76 [2019-01-31 17:39:57,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:57,467 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:39:57,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:57,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:39:57,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:39:57,505 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:39:57,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:39:57,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:39:57,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:39:57,506 INFO L87 Difference]: Start difference. First operand 1875 states and 11063 transitions. Second operand 8 states. [2019-01-31 17:40:03,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:40:03,341 INFO L93 Difference]: Finished difference Result 1884 states and 11081 transitions. [2019-01-31 17:40:03,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:40:03,342 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-31 17:40:03,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:40:03,347 INFO L225 Difference]: With dead ends: 1884 [2019-01-31 17:40:03,347 INFO L226 Difference]: Without dead ends: 1877 [2019-01-31 17:40:03,347 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-01-31 17:40:03,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2019-01-31 17:40:09,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1877. [2019-01-31 17:40:09,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2019-01-31 17:40:09,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 11071 transitions. [2019-01-31 17:40:09,598 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 11071 transitions. Word has length 7 [2019-01-31 17:40:09,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:40:09,598 INFO L480 AbstractCegarLoop]: Abstraction has 1877 states and 11071 transitions. [2019-01-31 17:40:09,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:40:09,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 11071 transitions. [2019-01-31 17:40:09,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:40:09,601 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:40:09,601 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:40:09,601 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:40:09,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:40:09,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1861574920, now seen corresponding path program 1 times [2019-01-31 17:40:09,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:40:09,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:40:09,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:40:09,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:40:09,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:40:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:40:09,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:40:09,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:40:09,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:40:09,731 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:40:09,731 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [28], [29] [2019-01-31 17:40:09,732 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:40:09,732 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:40:10,013 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:40:10,013 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-01-31 17:40:10,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:40:10,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:40:10,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:40:10,014 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-01-31 17:40:10,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:40:10,021 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:40:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:40:10,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:40:10,033 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-01-31 17:40:10,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:10,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:10,065 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-01-31 17:40:10,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:10,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:10,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:10,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:10,110 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-01-31 17:40:10,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:10,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:10,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:10,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:10,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:10,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:10,158 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-01-31 17:40:10,159 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:10,175 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:10,192 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:10,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:10,246 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-01-31 17:40:10,278 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-01-31 17:40:10,281 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-01-31 17:40:10,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, 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-01-31 17:40:10,287 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-01-31 17:40:10,287 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:10,309 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:10,321 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:10,331 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:10,341 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:10,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-01-31 17:40:10,369 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:40:10,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:10,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 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-31 17:40:10,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:10,423 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-01-31 17:40:10,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-31 17:40:10,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:10,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:10,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:10,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:10,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:10,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:10,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:10,452 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-01-31 17:40:10,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:10,481 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-01-31 17:40:10,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-01-31 17:40:10,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:10,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:10,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:10,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:10,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:10,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:10,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:10,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:10,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:10,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:10,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:10,514 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:40:10,523 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-01-31 17:40:10,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:40:10,627 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-01-31 17:40:10,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:64 [2019-01-31 17:40:10,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:40:10,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:40:10,689 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:40:10,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:40:10,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-31 17:40:10,708 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:40:10,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:40:10,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:40:10,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:40:10,708 INFO L87 Difference]: Start difference. First operand 1877 states and 11071 transitions. Second operand 11 states. [2019-01-31 17:40:20,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:40:20,004 INFO L93 Difference]: Finished difference Result 2991 states and 17341 transitions. [2019-01-31 17:40:20,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:40:20,004 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-31 17:40:20,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:40:20,012 INFO L225 Difference]: With dead ends: 2991 [2019-01-31 17:40:20,012 INFO L226 Difference]: Without dead ends: 2978 [2019-01-31 17:40:20,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:40:20,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2019-01-31 17:40:27,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2350. [2019-01-31 17:40:27,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2350 states. [2019-01-31 17:40:27,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 13866 transitions. [2019-01-31 17:40:27,962 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 13866 transitions. Word has length 8 [2019-01-31 17:40:27,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:40:27,963 INFO L480 AbstractCegarLoop]: Abstraction has 2350 states and 13866 transitions. [2019-01-31 17:40:27,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:40:27,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 13866 transitions. [2019-01-31 17:40:27,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:40:27,966 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:40:27,966 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:40:27,967 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:40:27,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:40:27,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1861146186, now seen corresponding path program 1 times [2019-01-31 17:40:27,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:40:27,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:40:27,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:40:27,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:40:27,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:40:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:40:28,062 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:40:28,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:40:28,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:40:28,063 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:40:28,063 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [25] [2019-01-31 17:40:28,064 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:40:28,064 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:40:28,466 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:40:28,466 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-01-31 17:40:28,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:40:28,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:40:28,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:40:28,467 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-01-31 17:40:28,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:40:28,476 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:40:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:40:28,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:40:28,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,504 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-01-31 17:40:28,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,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-01-31 17:40:28,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,595 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-01-31 17:40:28,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,645 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-01-31 17:40:28,645 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:28,663 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:28,678 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:28,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:28,715 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-01-31 17:40:28,717 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-01-31 17:40:28,720 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-01-31 17:40:28,723 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-01-31 17:40:28,726 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-01-31 17:40:28,727 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:28,752 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:28,765 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:28,777 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:28,787 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:28,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:28,817 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-01-31 17:40:28,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,855 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-01-31 17:40:28,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:28,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:40:28,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-31 17:40:28,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,923 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-01-31 17:40:28,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:28,955 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-01-31 17:40:28,955 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-31 17:40:28,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:28,993 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:40:28,994 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-01-31 17:40:28,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:29,030 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-01-31 17:40:29,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-31 17:40:29,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:29,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:29,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:29,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:29,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:29,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:29,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:29,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:29,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:29,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:29,068 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:40:29,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:29,070 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-01-31 17:40:29,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:29,106 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-01-31 17:40:29,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:34 [2019-01-31 17:40:29,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:29,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:29,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:29,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:29,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:29,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:29,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:29,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:29,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:29,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:29,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:29,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:29,144 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:40:29,144 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-01-31 17:40:29,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:29,180 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-01-31 17:40:29,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-01-31 17:40:29,204 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:40:29,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:40:29,974 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:40:29,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:40:29,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-31 17:40:29,993 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:40:29,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-31 17:40:29,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-31 17:40:29,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:40:29,994 INFO L87 Difference]: Start difference. First operand 2350 states and 13866 transitions. Second operand 14 states. [2019-01-31 17:40:40,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:40:40,590 INFO L93 Difference]: Finished difference Result 3181 states and 18621 transitions. [2019-01-31 17:40:40,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:40:40,590 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-31 17:40:40,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:40:40,598 INFO L225 Difference]: With dead ends: 3181 [2019-01-31 17:40:40,599 INFO L226 Difference]: Without dead ends: 3179 [2019-01-31 17:40:40,599 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-01-31 17:40:40,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2019-01-31 17:40:48,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 2326. [2019-01-31 17:40:48,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-01-31 17:40:48,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13718 transitions. [2019-01-31 17:40:48,522 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13718 transitions. Word has length 8 [2019-01-31 17:40:48,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:40:48,522 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13718 transitions. [2019-01-31 17:40:48,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-31 17:40:48,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13718 transitions. [2019-01-31 17:40:48,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:40:48,526 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:40:48,526 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:40:48,526 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:40:48,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:40:48,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1477451752, now seen corresponding path program 1 times [2019-01-31 17:40:48,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:40:48,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:40:48,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:40:48,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:40:48,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:40:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:40:48,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 17:40:48,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:40:48,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-31 17:40:48,628 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:40:48,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 17:40:48,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 17:40:48,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-31 17:40:48,629 INFO L87 Difference]: Start difference. First operand 2326 states and 13718 transitions. Second operand 5 states. [2019-01-31 17:40:55,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:40:55,986 INFO L93 Difference]: Finished difference Result 2346 states and 13737 transitions. [2019-01-31 17:40:55,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:40:55,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-31 17:40:55,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:40:55,992 INFO L225 Difference]: With dead ends: 2346 [2019-01-31 17:40:55,992 INFO L226 Difference]: Without dead ends: 2337 [2019-01-31 17:40:55,993 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-01-31 17:40:55,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2019-01-31 17:41:03,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2326. [2019-01-31 17:41:03,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-01-31 17:41:03,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13543 transitions. [2019-01-31 17:41:03,715 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13543 transitions. Word has length 8 [2019-01-31 17:41:03,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:41:03,715 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13543 transitions. [2019-01-31 17:41:03,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 17:41:03,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13543 transitions. [2019-01-31 17:41:03,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:41:03,718 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:41:03,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:41:03,719 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:41:03,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:41:03,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 2 times [2019-01-31 17:41:03,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:41:03,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:03,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:41:03,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:03,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:41:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:41:03,947 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2019-01-31 17:41:03,998 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:41:03,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:41:03,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:41:03,999 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:41:03,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:41:03,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:41:03,999 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-01-31 17:41:04,008 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:41:04,009 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:41:04,016 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-31 17:41:04,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:41:04,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:41:04,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:04,036 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-01-31 17:41:04,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:04,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:04,068 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-01-31 17:41:04,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:04,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:04,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:04,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:04,105 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-01-31 17:41:04,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:04,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:04,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:04,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:04,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:04,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:04,152 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-01-31 17:41:04,153 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:04,169 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:04,184 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:04,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:04,220 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-01-31 17:41:04,223 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-01-31 17:41:04,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, 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-01-31 17:41:04,268 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-01-31 17:41:04,274 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-01-31 17:41:04,274 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:04,300 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:04,313 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:04,323 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:04,333 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:04,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:04,361 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-01-31 17:41:04,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:04,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, 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-01-31 17:41:04,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:04,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:41:04,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-31 17:41:04,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:04,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:04,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:04,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:04,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:04,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:04,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:04,474 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-01-31 17:41:04,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:04,505 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-01-31 17:41:04,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-31 17:41:04,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:04,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:04,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:04,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:04,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:04,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:04,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:04,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:04,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:04,742 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:41:04,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:04,768 INFO L303 Elim1Store]: Index analysis took 237 ms [2019-01-31 17:41:04,769 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-01-31 17:41:04,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:05,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-01-31 17:41:05,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:34 [2019-01-31 17:41:05,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:05,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:05,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:05,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:05,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:05,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:05,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:05,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:05,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:05,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:05,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:05,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:05,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:05,043 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:41:05,044 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-01-31 17:41:05,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:05,076 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-01-31 17:41:05,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:41:05,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:05,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:05,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:05,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:05,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:05,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:05,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:05,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:05,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:05,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:05,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:05,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:05,116 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:41:05,117 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-01-31 17:41:05,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:05,151 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-01-31 17:41:05,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-01-31 17:41:05,176 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:05,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:41:05,264 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:05,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:41:05,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-31 17:41:05,282 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:41:05,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-31 17:41:05,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-31 17:41:05,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:41:05,283 INFO L87 Difference]: Start difference. First operand 2326 states and 13543 transitions. Second operand 14 states. [2019-01-31 17:41:13,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:41:13,464 INFO L93 Difference]: Finished difference Result 2345 states and 13559 transitions. [2019-01-31 17:41:13,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:41:13,464 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-31 17:41:13,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:41:13,470 INFO L225 Difference]: With dead ends: 2345 [2019-01-31 17:41:13,470 INFO L226 Difference]: Without dead ends: 2338 [2019-01-31 17:41:13,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2019-01-31 17:41:13,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2019-01-31 17:41:15,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 473. [2019-01-31 17:41:15,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-01-31 17:41:15,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 2593 transitions. [2019-01-31 17:41:15,675 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 2593 transitions. Word has length 8 [2019-01-31 17:41:15,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:41:15,675 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 2593 transitions. [2019-01-31 17:41:15,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-31 17:41:15,676 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 2593 transitions. [2019-01-31 17:41:15,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:41:15,676 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:41:15,677 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-31 17:41:15,677 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:41:15,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:41:15,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1700463206, now seen corresponding path program 1 times [2019-01-31 17:41:15,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:41:15,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:15,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:41:15,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:15,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:41:15,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:41:15,750 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:41:15,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:41:15,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:41:15,751 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:41:15,751 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [27] [2019-01-31 17:41:15,752 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:41:15,752 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:41:16,009 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:41:16,009 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-01-31 17:41:16,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:41:16,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:41:16,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:41:16,010 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-01-31 17:41:16,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:41:16,018 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:41:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:41:16,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:41:16,029 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-01-31 17:41:16,031 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-01-31 17:41:16,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,041 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-01-31 17:41:16,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,057 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-01-31 17:41:16,069 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-01-31 17:41:16,070 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:16,089 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:16,106 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:16,114 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:16,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:16,140 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-01-31 17:41:16,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,153 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-01-31 17:41:16,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,267 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-01-31 17:41:16,268 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:16,302 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:16,311 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:16,329 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-01-31 17:41:16,329 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-31 17:41:16,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,358 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-01-31 17:41:16,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:16,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:16,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-01-31 17:41:16,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,385 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-01-31 17:41:16,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:16,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:16,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:18 [2019-01-31 17:41:16,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,419 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-01-31 17:41:16,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:16,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:41:16,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:16 [2019-01-31 17:41:16,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:16,458 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-01-31 17:41:16,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:16,474 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-01-31 17:41:16,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2019-01-31 17:41:16,489 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:16,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:41:16,530 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:16,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:41:16,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-31 17:41:16,549 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:41:16,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:41:16,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:41:16,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:41:16,549 INFO L87 Difference]: Start difference. First operand 473 states and 2593 transitions. Second operand 11 states. [2019-01-31 17:41:18,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:41:18,874 INFO L93 Difference]: Finished difference Result 480 states and 2609 transitions. [2019-01-31 17:41:18,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:41:18,874 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-31 17:41:18,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:41:18,876 INFO L225 Difference]: With dead ends: 480 [2019-01-31 17:41:18,877 INFO L226 Difference]: Without dead ends: 477 [2019-01-31 17:41:18,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:41:18,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-01-31 17:41:19,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 158. [2019-01-31 17:41:19,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-31 17:41:19,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 805 transitions. [2019-01-31 17:41:19,828 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 805 transitions. Word has length 8 [2019-01-31 17:41:19,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:41:19,828 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 805 transitions. [2019-01-31 17:41:19,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:41:19,828 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 805 transitions. [2019-01-31 17:41:19,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:41:19,828 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:41:19,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:41:19,829 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:41:19,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:41:19,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1702729308, now seen corresponding path program 1 times [2019-01-31 17:41:19,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:41:19,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:19,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:41:19,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:19,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:41:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:41:19,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:41:19,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:41:19,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:41:19,891 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:41:19,891 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [28], [29] [2019-01-31 17:41:19,892 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:41:19,892 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:41:20,173 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:41:20,173 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-01-31 17:41:20,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:41:20,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:41:20,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:41:20,174 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-01-31 17:41:20,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:41:20,184 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:41:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:41:20,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:41:20,199 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-01-31 17:41:20,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, 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-01-31 17:41:20,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,218 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-01-31 17:41:20,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,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, 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-01-31 17:41:20,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,245 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-01-31 17:41:20,245 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:20,270 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:20,284 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:20,294 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:20,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:20,324 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-01-31 17:41:20,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,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, 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-01-31 17:41:20,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,384 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-01-31 17:41:20,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,427 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-01-31 17:41:20,428 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:20,442 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:20,455 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:20,470 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:20,496 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-01-31 17:41:20,497 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:41:20,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,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, 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-01-31 17:41:20,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:20,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:41:20,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:41:20,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,572 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-01-31 17:41:20,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:20,593 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-01-31 17:41:20,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:41:20,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:20,618 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:41:20,619 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-01-31 17:41:20,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:20,639 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-01-31 17:41:20,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-31 17:41:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:20,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:41:20,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:20,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:41:20,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-31 17:41:20,703 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:41:20,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:41:20,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:41:20,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:41:20,704 INFO L87 Difference]: Start difference. First operand 158 states and 805 transitions. Second operand 9 states. [2019-01-31 17:41:22,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:41:22,556 INFO L93 Difference]: Finished difference Result 250 states and 1244 transitions. [2019-01-31 17:41:22,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:41:22,556 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-31 17:41:22,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:41:22,558 INFO L225 Difference]: With dead ends: 250 [2019-01-31 17:41:22,558 INFO L226 Difference]: Without dead ends: 243 [2019-01-31 17:41:22,558 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-01-31 17:41:22,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-31 17:41:24,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 217. [2019-01-31 17:41:24,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-31 17:41:24,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 1122 transitions. [2019-01-31 17:41:24,085 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 1122 transitions. Word has length 8 [2019-01-31 17:41:24,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:41:24,085 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 1122 transitions. [2019-01-31 17:41:24,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:41:24,086 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 1122 transitions. [2019-01-31 17:41:24,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:41:24,086 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:41:24,086 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:41:24,087 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:41:24,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:41:24,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1689800014, now seen corresponding path program 1 times [2019-01-31 17:41:24,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:41:24,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:24,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:41:24,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:24,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:41:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:41:24,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:41:24,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:41:24,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:41:24,210 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:41:24,210 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [28], [29] [2019-01-31 17:41:24,210 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:41:24,210 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:41:24,474 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:41:24,475 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-01-31 17:41:24,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:41:24,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:41:24,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:41:24,475 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-01-31 17:41:24,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:41:24,484 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:41:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:41:24,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:41:24,493 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-01-31 17:41:24,497 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-01-31 17:41:24,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:24,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:24,507 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-01-31 17:41:24,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:24,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:24,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:24,521 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-01-31 17:41:24,536 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-01-31 17:41:24,537 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:24,554 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:24,566 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:24,576 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:24,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:24,603 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-01-31 17:41:24,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:24,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:24,615 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-01-31 17:41:24,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:24,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:24,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:24,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:24,644 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-01-31 17:41:24,644 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:24,652 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:24,659 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:24,677 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-01-31 17:41:24,677 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-31 17:41:24,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:24,706 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-01-31 17:41:24,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:24,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:24,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-01-31 17:41:24,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:24,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:24,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:24,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:24,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:24,733 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-01-31 17:41:24,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:24,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:41:24,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-01-31 17:41:24,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:24,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:24,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:24,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:24,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:24,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:24,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:24,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:24,767 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:41:24,768 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-01-31 17:41:24,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:24,783 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-01-31 17:41:24,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-01-31 17:41:24,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:24,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:41:24,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:24,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:41:24,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:41:24,846 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:41:24,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:41:24,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:41:24,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:41:24,847 INFO L87 Difference]: Start difference. First operand 217 states and 1122 transitions. Second operand 10 states. [2019-01-31 17:41:28,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:41:28,040 INFO L93 Difference]: Finished difference Result 372 states and 1862 transitions. [2019-01-31 17:41:28,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:41:28,041 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-31 17:41:28,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:41:28,042 INFO L225 Difference]: With dead ends: 372 [2019-01-31 17:41:28,042 INFO L226 Difference]: Without dead ends: 362 [2019-01-31 17:41:28,042 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-01-31 17:41:28,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-01-31 17:41:30,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 274. [2019-01-31 17:41:30,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-01-31 17:41:30,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 1432 transitions. [2019-01-31 17:41:30,352 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 1432 transitions. Word has length 8 [2019-01-31 17:41:30,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:41:30,352 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 1432 transitions. [2019-01-31 17:41:30,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:41:30,352 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 1432 transitions. [2019-01-31 17:41:30,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:41:30,353 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:41:30,353 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:41:30,354 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:41:30,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:41:30,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1048110876, now seen corresponding path program 2 times [2019-01-31 17:41:30,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:41:30,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:30,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:41:30,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:30,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:41:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:41:30,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:30,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:41:30,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:41:30,433 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:41:30,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:41:30,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:41:30,433 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-01-31 17:41:30,441 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:41:30,442 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:41:30,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:41:30,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:41:30,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:41:30,451 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-01-31 17:41:30,457 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-01-31 17:41:30,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,463 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-01-31 17:41:30,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,481 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-01-31 17:41:30,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,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, 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-01-31 17:41:30,495 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:30,519 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:30,533 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:30,543 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:30,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:30,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, 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-01-31 17:41:30,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,588 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-01-31 17:41:30,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,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, 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-01-31 17:41:30,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,665 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-01-31 17:41:30,665 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:30,679 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:30,693 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:30,708 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:30,734 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-01-31 17:41:30,734 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:41:30,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,757 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-01-31 17:41:30,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:30,784 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-01-31 17:41:30,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:41:30,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,813 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:41:30,821 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-01-31 17:41:30,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:41:30,908 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-01-31 17:41:30,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-31 17:41:30,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:30,947 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-01-31 17:41:30,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:30,967 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-01-31 17:41:30,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2019-01-31 17:41:30,983 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:30,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:41:31,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:31,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:41:31,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:41:31,051 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:41:31,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:41:31,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:41:31,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:41:31,051 INFO L87 Difference]: Start difference. First operand 274 states and 1432 transitions. Second operand 10 states. [2019-01-31 17:41:33,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:41:33,931 INFO L93 Difference]: Finished difference Result 332 states and 1700 transitions. [2019-01-31 17:41:33,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:41:33,931 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-31 17:41:33,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:41:33,933 INFO L225 Difference]: With dead ends: 332 [2019-01-31 17:41:33,933 INFO L226 Difference]: Without dead ends: 325 [2019-01-31 17:41:33,933 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-01-31 17:41:33,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-01-31 17:41:36,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 285. [2019-01-31 17:41:36,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-01-31 17:41:36,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 1489 transitions. [2019-01-31 17:41:36,345 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 1489 transitions. Word has length 8 [2019-01-31 17:41:36,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:41:36,345 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 1489 transitions. [2019-01-31 17:41:36,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:41:36,345 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 1489 transitions. [2019-01-31 17:41:36,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:41:36,346 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:41:36,346 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:41:36,346 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:41:36,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:41:36,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1051804960, now seen corresponding path program 1 times [2019-01-31 17:41:36,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:41:36,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:36,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:41:36,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:36,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:41:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:41:36,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:41:36,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:41:36,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:41:36,432 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:41:36,432 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [26], [28], [29] [2019-01-31 17:41:36,433 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:41:36,433 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:41:37,014 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:41:37,014 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-01-31 17:41:37,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:41:37,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:41:37,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:41:37,014 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-01-31 17:41:37,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:41:37,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:41:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:41:37,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:41:37,037 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-01-31 17:41:37,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:37,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:37,066 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-01-31 17:41:37,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:37,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:37,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:37,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:37,106 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-01-31 17:41:37,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:37,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:37,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:37,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:37,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:37,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:37,150 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-01-31 17:41:37,151 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:37,164 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:37,178 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:37,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:37,212 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-01-31 17:41:37,216 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-01-31 17:41:37,219 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-01-31 17:41:37,222 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-01-31 17:41:37,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-01-31 17:41:37,225 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:37,245 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:37,257 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:37,266 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:37,275 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:37,301 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-01-31 17:41:37,301 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-31 17:41:37,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:37,349 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-01-31 17:41:37,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:37,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:41:37,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:41:37,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:37,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:37,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:37,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:37,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:37,393 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:41:37,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, 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-01-31 17:41:37,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:37,413 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-01-31 17:41:37,413 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-31 17:41:37,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:37,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:37,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:37,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:37,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:37,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:37,441 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:41:37,441 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-01-31 17:41:37,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:37,462 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-01-31 17:41:37,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-31 17:41:37,483 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:37,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:41:37,527 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:37,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:41:37,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:41:37,546 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:41:37,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:41:37,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:41:37,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:41:37,546 INFO L87 Difference]: Start difference. First operand 285 states and 1489 transitions. Second operand 10 states. [2019-01-31 17:41:40,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:41:40,123 INFO L93 Difference]: Finished difference Result 294 states and 1507 transitions. [2019-01-31 17:41:40,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:41:40,124 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-31 17:41:40,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:41:40,125 INFO L225 Difference]: With dead ends: 294 [2019-01-31 17:41:40,125 INFO L226 Difference]: Without dead ends: 287 [2019-01-31 17:41:40,125 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-01-31 17:41:40,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-01-31 17:41:42,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2019-01-31 17:41:42,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-01-31 17:41:42,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1484 transitions. [2019-01-31 17:41:42,557 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1484 transitions. Word has length 8 [2019-01-31 17:41:42,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:41:42,557 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1484 transitions. [2019-01-31 17:41:42,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:41:42,557 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1484 transitions. [2019-01-31 17:41:42,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:41:42,558 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:41:42,558 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:41:42,558 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:41:42,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:41:42,558 INFO L82 PathProgramCache]: Analyzing trace with hash -944676524, now seen corresponding path program 1 times [2019-01-31 17:41:42,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:41:42,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:42,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:41:42,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:42,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:41:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:41:42,684 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:41:42,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:41:42,684 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:41:42,684 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:41:42,685 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [26], [28], [29] [2019-01-31 17:41:42,686 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:41:42,686 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:41:43,266 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:41:43,266 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-01-31 17:41:43,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:41:43,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:41:43,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:41:43,267 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-01-31 17:41:43,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:41:43,289 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:41:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:41:43,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:41:43,319 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-01-31 17:41:43,322 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-01-31 17:41:43,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,326 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-01-31 17:41:43,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,334 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-01-31 17:41:43,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,342 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-01-31 17:41:43,342 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:43,376 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:43,392 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:43,401 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:43,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:43,430 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-01-31 17:41:43,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,445 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-01-31 17:41:43,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,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, 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-01-31 17:41:43,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,522 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-01-31 17:41:43,523 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:43,537 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:43,550 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:43,565 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:43,591 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-01-31 17:41:43,591 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-31 17:41:43,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,622 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-01-31 17:41:43,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:43,649 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-01-31 17:41:43,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-31 17:41:43,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,692 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-01-31 17:41:43,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:41:43,787 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-01-31 17:41:43,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:74 [2019-01-31 17:41:43,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,905 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:41:43,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,907 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-01-31 17:41:43,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:43,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:43,966 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:41:43,967 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-01-31 17:41:43,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:44,015 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-01-31 17:41:44,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:92, output treesize:70 [2019-01-31 17:41:44,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:44,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:41:44,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:44,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:41:44,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-31 17:41:44,122 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:41:44,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:41:44,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:41:44,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:41:44,123 INFO L87 Difference]: Start difference. First operand 284 states and 1484 transitions. Second operand 11 states. [2019-01-31 17:41:44,666 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2019-01-31 17:41:47,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:41:47,746 INFO L93 Difference]: Finished difference Result 364 states and 1818 transitions. [2019-01-31 17:41:47,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:41:47,747 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-31 17:41:47,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:41:47,748 INFO L225 Difference]: With dead ends: 364 [2019-01-31 17:41:47,748 INFO L226 Difference]: Without dead ends: 357 [2019-01-31 17:41:47,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:41:47,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-01-31 17:41:50,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 283. [2019-01-31 17:41:50,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-01-31 17:41:50,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 1479 transitions. [2019-01-31 17:41:50,325 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 1479 transitions. Word has length 8 [2019-01-31 17:41:50,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:41:50,325 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 1479 transitions. [2019-01-31 17:41:50,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:41:50,326 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 1479 transitions. [2019-01-31 17:41:50,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:41:50,326 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:41:50,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:41:50,326 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:41:50,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:41:50,327 INFO L82 PathProgramCache]: Analyzing trace with hash -937288356, now seen corresponding path program 1 times [2019-01-31 17:41:50,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:41:50,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:50,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:41:50,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:50,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:41:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:41:50,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:41:50,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:41:50,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:41:50,406 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:41:50,406 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [26], [28], [29] [2019-01-31 17:41:50,407 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:41:50,407 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:41:51,007 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:41:51,008 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-01-31 17:41:51,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:41:51,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:41:51,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:41:51,008 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-01-31 17:41:51,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:41:51,016 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:41:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:41:51,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:41:51,024 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-01-31 17:41:51,029 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-01-31 17:41:51,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,042 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-01-31 17:41:51,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,056 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-01-31 17:41:51,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,068 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-01-31 17:41:51,068 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:51,094 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:51,108 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:51,117 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:51,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:51,147 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-01-31 17:41:51,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,161 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-01-31 17:41:51,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,194 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-01-31 17:41:51,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,236 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-01-31 17:41:51,237 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:51,251 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:51,264 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:51,279 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:51,305 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-01-31 17:41:51,305 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-31 17:41:51,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,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, 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-01-31 17:41:51,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:51,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:41:51,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:41:51,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,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, 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-01-31 17:41:51,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:51,414 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-01-31 17:41:51,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-31 17:41:51,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:51,441 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:41:51,441 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-01-31 17:41:51,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:51,462 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-01-31 17:41:51,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-31 17:41:51,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:51,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:41:51,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:51,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:41:51,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-31 17:41:51,534 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:41:51,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:41:51,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:41:51,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:41:51,535 INFO L87 Difference]: Start difference. First operand 283 states and 1479 transitions. Second operand 9 states. [2019-01-31 17:41:54,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:41:54,610 INFO L93 Difference]: Finished difference Result 319 states and 1617 transitions. [2019-01-31 17:41:54,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:41:54,610 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-31 17:41:54,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:41:54,611 INFO L225 Difference]: With dead ends: 319 [2019-01-31 17:41:54,611 INFO L226 Difference]: Without dead ends: 312 [2019-01-31 17:41:54,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:41:54,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-01-31 17:41:57,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 304. [2019-01-31 17:41:57,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-01-31 17:41:57,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 1600 transitions. [2019-01-31 17:41:57,591 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 1600 transitions. Word has length 8 [2019-01-31 17:41:57,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:41:57,591 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 1600 transitions. [2019-01-31 17:41:57,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:41:57,591 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 1600 transitions. [2019-01-31 17:41:57,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:41:57,592 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:41:57,592 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:41:57,592 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:41:57,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:41:57,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1115262138, now seen corresponding path program 1 times [2019-01-31 17:41:57,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:41:57,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:57,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:41:57,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:57,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:41:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:41:57,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 17:41:57,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:41:57,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:41:57,713 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:41:57,713 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [29] [2019-01-31 17:41:57,714 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:41:57,714 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:41:57,975 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:41:57,976 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-01-31 17:41:57,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:41:57,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:41:57,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:41:57,976 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-01-31 17:41:57,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:41:57,984 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:41:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:41:57,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:41: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 43 treesize of output 39 [2019-01-31 17:41:58,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,015 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-01-31 17:41:58,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,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, 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-01-31 17:41:58,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,102 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-01-31 17:41:58,103 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:58,121 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:58,138 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:58,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:58,181 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-01-31 17:41:58,184 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-01-31 17:41:58,187 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-01-31 17:41:58,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, 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-01-31 17:41:58,194 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-01-31 17:41:58,194 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:58,216 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:58,228 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:58,237 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:58,246 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:58,273 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-01-31 17:41:58,273 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-31 17:41:58,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,312 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-01-31 17:41:58,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:41:58,401 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-01-31 17:41:58,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-01-31 17:41:58,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41: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 45 treesize of output 67 [2019-01-31 17:41:58,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:58,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,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, 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-01-31 17:41:58,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:58,600 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-01-31 17:41:58,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:68 [2019-01-31 17:41:58,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,653 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:41:58,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 50 treesize of output 98 [2019-01-31 17:41:58,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:58,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,714 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:41:58,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:58,715 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-01-31 17:41:58,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:58,755 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-01-31 17:41:58,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-01-31 17:41:58,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:58,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:41:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:58,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:41:58,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-31 17:41:58,856 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:41:58,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:41:58,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:41:58,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:41:58,857 INFO L87 Difference]: Start difference. First operand 304 states and 1600 transitions. Second operand 11 states. [2019-01-31 17:42:00,206 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-01-31 17:42:03,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:42:03,217 INFO L93 Difference]: Finished difference Result 392 states and 1929 transitions. [2019-01-31 17:42:03,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:42:03,217 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-31 17:42:03,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:42:03,219 INFO L225 Difference]: With dead ends: 392 [2019-01-31 17:42:03,219 INFO L226 Difference]: Without dead ends: 386 [2019-01-31 17:42:03,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:42:03,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-01-31 17:42:06,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 315. [2019-01-31 17:42:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-01-31 17:42:06,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 1665 transitions. [2019-01-31 17:42:06,321 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 1665 transitions. Word has length 8 [2019-01-31 17:42:06,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:42:06,321 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 1665 transitions. [2019-01-31 17:42:06,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:42:06,322 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 1665 transitions. [2019-01-31 17:42:06,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:42:06,322 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:42:06,322 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:42:06,323 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:42:06,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:42:06,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2019-01-31 17:42:06,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:42:06,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:42:06,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:42:06,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:42:06,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:42:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:42:06,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 17:42:06,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:42:06,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-31 17:42:06,407 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:42:06,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 17:42:06,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 17:42:06,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-31 17:42:06,408 INFO L87 Difference]: Start difference. First operand 315 states and 1665 transitions. Second operand 5 states. [2019-01-31 17:42:09,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:42:09,401 INFO L93 Difference]: Finished difference Result 320 states and 1669 transitions. [2019-01-31 17:42:09,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:42:09,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-31 17:42:09,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:42:09,403 INFO L225 Difference]: With dead ends: 320 [2019-01-31 17:42:09,403 INFO L226 Difference]: Without dead ends: 315 [2019-01-31 17:42:09,403 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-01-31 17:42:09,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-31 17:42:12,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 314. [2019-01-31 17:42:12,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-01-31 17:42:12,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 1654 transitions. [2019-01-31 17:42:12,552 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 1654 transitions. Word has length 8 [2019-01-31 17:42:12,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:42:12,552 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 1654 transitions. [2019-01-31 17:42:12,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 17:42:12,553 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 1654 transitions. [2019-01-31 17:42:12,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:42:12,553 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:42:12,553 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:42:12,553 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:42:12,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:42:12,554 INFO L82 PathProgramCache]: Analyzing trace with hash 95484720, now seen corresponding path program 3 times [2019-01-31 17:42:12,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:42:12,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:42:12,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:42:12,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:42:12,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:42:12,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:42:12,633 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:42:12,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:42:12,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:42:12,633 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:42:12,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:42:12,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:42:12,634 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-01-31 17:42:12,642 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:42:12,642 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:42:12,647 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:42:12,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:42:12,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:42:12,651 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-01-31 17:42:12,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:12,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:12,670 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-01-31 17:42:12,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:12,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:12,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:12,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:12,703 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-01-31 17:42:12,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:12,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:12,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:12,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:12,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:12,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:12,748 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-01-31 17:42:12,748 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:12,763 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:12,777 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:12,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:12,813 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-01-31 17:42:12,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, 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-01-31 17:42:12,819 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-01-31 17:42:12,821 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-01-31 17:42:12,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, 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-01-31 17:42:12,826 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:12,846 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:12,858 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:12,867 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:12,876 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:12,902 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-01-31 17:42:12,903 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:42:12,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:12,931 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-01-31 17:42:12,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:12,956 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-01-31 17:42:12,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-31 17:42:12,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:12,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:12,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:12,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:12,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:12,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:12,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:12,987 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-01-31 17:42:12,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:13,014 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-01-31 17:42:13,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:46 [2019-01-31 17:42:13,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:13,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:13,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:13,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:13,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:13,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:13,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:13,053 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-01-31 17:42:13,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:42:13,147 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-01-31 17:42:13,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:68 [2019-01-31 17:42:13,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:13,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:13,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:13,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:13,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:13,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:13,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:13,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:13,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:13,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:13,215 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:42:13,216 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-01-31 17:42:13,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:13,237 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-01-31 17:42:13,237 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-31 17:42:13,259 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:42:13,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:42:13,322 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:42:13,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:42:13,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:42:13,341 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:42:13,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:42:13,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:42:13,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:42:13,342 INFO L87 Difference]: Start difference. First operand 314 states and 1654 transitions. Second operand 12 states. [2019-01-31 17:42:19,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:42:19,737 INFO L93 Difference]: Finished difference Result 601 states and 3111 transitions. [2019-01-31 17:42:19,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:42:19,737 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-31 17:42:19,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:42:19,739 INFO L225 Difference]: With dead ends: 601 [2019-01-31 17:42:19,739 INFO L226 Difference]: Without dead ends: 591 [2019-01-31 17:42:19,739 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-01-31 17:42:19,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-01-31 17:42:24,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 448. [2019-01-31 17:42:24,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-01-31 17:42:24,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 2380 transitions. [2019-01-31 17:42:24,938 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 2380 transitions. Word has length 9 [2019-01-31 17:42:24,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:42:24,938 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 2380 transitions. [2019-01-31 17:42:24,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:42:24,938 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 2380 transitions. [2019-01-31 17:42:24,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:42:24,939 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:42:24,939 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:42:24,939 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:42:24,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:42:24,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1988764338, now seen corresponding path program 1 times [2019-01-31 17:42:24,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:42:24,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:42:24,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:42:24,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:42:24,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:42:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:42:25,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:42:25,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:42:25,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:42:25,029 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:42:25,029 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [30], [31] [2019-01-31 17:42:25,030 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:42:25,030 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:42:25,323 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:42:25,323 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-01-31 17:42:25,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:42:25,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:42:25,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:42:25,324 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-01-31 17:42:25,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:42:25,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:42:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:42:25,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:42:25,342 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-01-31 17:42:25,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:25,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:25,362 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-01-31 17:42:25,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:25,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:25,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:25,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:25,403 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-01-31 17:42:25,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:25,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:25,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:25,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:25,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:25,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:25,447 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-01-31 17:42:25,448 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:25,465 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:25,482 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:25,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:25,521 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-01-31 17:42:25,524 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-01-31 17:42:25,527 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-01-31 17:42:25,531 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-01-31 17:42:25,534 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-01-31 17:42:25,534 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:25,555 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:25,567 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:25,576 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:25,585 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:25,611 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-01-31 17:42:25,612 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:42:25,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:25,638 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-01-31 17:42:25,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:25,663 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-01-31 17:42:25,663 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:42:25,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:25,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:25,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:25,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:25,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:25,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:25,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:25,693 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-01-31 17:42:25,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:25,721 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-01-31 17:42:25,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-01-31 17:42:25,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:25,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:25,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:25,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:25,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:25,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:25,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:25,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:25,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:25,752 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:42:25,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:25,761 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-01-31 17:42:25,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:42:25,856 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-01-31 17:42:25,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:64 [2019-01-31 17:42:25,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:42:25,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:42:25,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:42:25,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:42:25,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:42:25,944 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:42:25,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:42:25,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:42:25,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:42:25,944 INFO L87 Difference]: Start difference. First operand 448 states and 2380 transitions. Second operand 10 states. [2019-01-31 17:42:35,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:42:35,613 INFO L93 Difference]: Finished difference Result 731 states and 3887 transitions. [2019-01-31 17:42:35,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:42:35,613 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-31 17:42:35,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:42:35,615 INFO L225 Difference]: With dead ends: 731 [2019-01-31 17:42:35,615 INFO L226 Difference]: Without dead ends: 718 [2019-01-31 17:42:35,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:42:35,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-01-31 17:42:44,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 399. [2019-01-31 17:42:44,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-01-31 17:42:44,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 2082 transitions. [2019-01-31 17:42:44,108 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 2082 transitions. Word has length 9 [2019-01-31 17:42:44,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:42:44,108 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 2082 transitions. [2019-01-31 17:42:44,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:42:44,109 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 2082 transitions. [2019-01-31 17:42:44,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:42:44,109 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:42:44,109 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:42:44,110 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:42:44,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:42:44,110 INFO L82 PathProgramCache]: Analyzing trace with hash 2086595996, now seen corresponding path program 1 times [2019-01-31 17:42:44,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:42:44,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:42:44,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:42:44,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:42:44,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:42:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:42:44,197 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:42:44,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:42:44,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:42:44,198 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:42:44,198 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [28], [29] [2019-01-31 17:42:44,199 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:42:44,199 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:42:44,562 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:42:44,562 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-01-31 17:42:44,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:42:44,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:42:44,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:42:44,563 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-01-31 17:42:44,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:42:44,572 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:42:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:42:44,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:42:44,581 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-01-31 17:42:44,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:44,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:44,609 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-01-31 17:42:44,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:44,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:44,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:44,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:44,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, 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-01-31 17:42:44,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:44,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:44,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:44,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:44,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:44,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:44,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, 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-01-31 17:42:44,694 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:44,712 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:44,727 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:44,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:44,770 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-01-31 17:42:44,774 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-01-31 17:42:44,777 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-01-31 17:42:44,780 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-01-31 17:42:44,783 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-01-31 17:42:44,784 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:44,822 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:44,834 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:44,843 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:44,853 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:44,879 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-01-31 17:42:44,879 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-31 17:42:44,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:44,925 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-01-31 17:42:44,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:44,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:44,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:33 [2019-01-31 17:42:44,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:44,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:44,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:44,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:44,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:44,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:44,970 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-01-31 17:42:44,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:44,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:42:44,989 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-01-31 17:42:45,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:45,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:45,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:45,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:45,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:45,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:45,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:45,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:45,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:45,019 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:42:45,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, 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-01-31 17:42:45,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:45,042 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-01-31 17:42:45,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-01-31 17:42:45,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:45,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:45,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:45,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:45,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:45,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:45,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:45,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:45,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:45,074 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:42:45,074 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-01-31 17:42:45,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:45,097 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-01-31 17:42:45,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:35 [2019-01-31 17:42:45,120 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:42:45,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:42:45,188 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:42:45,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:42:45,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:42:45,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:42:45,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:42:45,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:42:45,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:42:45,206 INFO L87 Difference]: Start difference. First operand 399 states and 2082 transitions. Second operand 12 states. [2019-01-31 17:42:55,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:42:55,174 INFO L93 Difference]: Finished difference Result 480 states and 2456 transitions. [2019-01-31 17:42:55,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:42:55,175 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-31 17:42:55,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:42:55,176 INFO L225 Difference]: With dead ends: 480 [2019-01-31 17:42:55,176 INFO L226 Difference]: Without dead ends: 473 [2019-01-31 17:42:55,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2019-01-31 17:42:55,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-01-31 17:42:58,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 193. [2019-01-31 17:42:58,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-01-31 17:42:58,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 982 transitions. [2019-01-31 17:42:58,472 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 982 transitions. Word has length 9 [2019-01-31 17:42:58,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:42:58,473 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 982 transitions. [2019-01-31 17:42:58,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:42:58,473 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 982 transitions. [2019-01-31 17:42:58,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:42:58,474 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:42:58,474 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:42:58,474 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:42:58,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:42:58,474 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2019-01-31 17:42:58,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:42:58,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:42:58,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:42:58,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:42:58,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:42:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:42:58,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 17:42:58,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:42:58,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:42:58,592 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:42:58,592 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [30], [31] [2019-01-31 17:42:58,593 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:42:58,594 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:42:58,879 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:42:58,880 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-01-31 17:42:58,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:42:58,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:42:58,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:42:58,880 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-01-31 17:42:58,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:42:58,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:42:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:42:58,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:42:58,897 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-01-31 17:42:58,902 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-01-31 17:42:58,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:58,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:58,916 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-01-31 17:42:58,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:58,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:58,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:58,926 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-01-31 17:42:58,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:58,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:58,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:58,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:58,933 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-01-31 17:42:58,934 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:58,960 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:58,974 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:58,984 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:58,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:59,013 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-01-31 17:42:59,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:59,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:59,028 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-01-31 17:42:59,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:59,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:59,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:59,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:59,062 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-01-31 17:42:59,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:59,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:59,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:59,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:59,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:59,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:59,104 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-01-31 17:42:59,104 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:59,118 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:59,132 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:59,147 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:59,172 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-01-31 17:42:59,173 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-31 17:42:59,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:59,216 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-01-31 17:42:59,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:59,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:42:59,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:42:59,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:59,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:59,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:59,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:59,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:59,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:59,258 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-01-31 17:42:59,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:59,279 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-01-31 17:42:59,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:42:59,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:59,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:59,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:59,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:59,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:59,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:59,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:59,304 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:42:59,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:59,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, 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-01-31 17:42:59,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:59,330 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-01-31 17:42:59,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-31 17:42:59,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:42:59,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:42:59,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:42:59,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:42:59,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:42:59,397 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:42:59,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:42:59,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:42:59,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:42:59,398 INFO L87 Difference]: Start difference. First operand 193 states and 982 transitions. Second operand 10 states. [2019-01-31 17:43:04,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:43:04,655 INFO L93 Difference]: Finished difference Result 258 states and 1245 transitions. [2019-01-31 17:43:04,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:43:04,655 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-31 17:43:04,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:43:04,657 INFO L225 Difference]: With dead ends: 258 [2019-01-31 17:43:04,657 INFO L226 Difference]: Without dead ends: 243 [2019-01-31 17:43:04,657 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-01-31 17:43:04,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-31 17:43:09,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 219. [2019-01-31 17:43:09,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-01-31 17:43:09,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 1113 transitions. [2019-01-31 17:43:09,173 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 1113 transitions. Word has length 9 [2019-01-31 17:43:09,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:43:09,173 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 1113 transitions. [2019-01-31 17:43:09,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:43:09,173 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 1113 transitions. [2019-01-31 17:43:09,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:43:09,174 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:43:09,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:43:09,174 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:43:09,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:43:09,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1629971288, now seen corresponding path program 1 times [2019-01-31 17:43:09,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:43:09,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:43:09,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:43:09,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:43:09,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:43:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:43:09,329 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 17:43:09,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:43:09,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:43:09,330 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:43:09,330 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [26], [28], [29] [2019-01-31 17:43:09,331 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:43:09,331 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:43:10,028 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:43:10,028 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-01-31 17:43:10,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:43:10,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:43:10,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:43:10,028 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-01-31 17:43:10,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:43:10,037 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:43:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:43:10,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:43:10,049 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-01-31 17:43:10,053 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-01-31 17:43:10,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,070 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-01-31 17:43:10,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,076 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-01-31 17:43:10,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,086 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-01-31 17:43:10,086 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:43:10,111 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:10,123 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:10,132 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:10,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:10,160 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-01-31 17:43:10,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,176 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-01-31 17:43:10,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,210 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-01-31 17:43:10,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,255 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-01-31 17:43:10,255 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:43:10,269 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:10,282 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:10,297 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:10,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:10,323 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-01-31 17:43:10,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,358 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-01-31 17:43:10,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:43:10,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:43:10,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-01-31 17:43:10,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,418 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:43:10,426 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-01-31 17:43:10,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:43:10,514 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-01-31 17:43:10,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:72 [2019-01-31 17:43:10,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,561 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:43:10,562 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-01-31 17:43:10,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:43:10,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,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 52 treesize of output 90 [2019-01-31 17:43:10,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:43:10,672 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-01-31 17:43:10,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:92, output treesize:68 [2019-01-31 17:43:10,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,737 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:43:10,738 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-01-31 17:43:10,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:43:10,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:10,803 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:43:10,804 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-01-31 17:43:10,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:43:10,844 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-01-31 17:43:10,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:90, output treesize:70 [2019-01-31 17:43:10,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:43:10,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:43:10,938 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:43:10,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:43:10,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:43:10,957 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:43:10,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:43:10,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:43:10,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:43:10,957 INFO L87 Difference]: Start difference. First operand 219 states and 1113 transitions. Second operand 12 states. [2019-01-31 17:43:17,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:43:17,147 INFO L93 Difference]: Finished difference Result 295 states and 1406 transitions. [2019-01-31 17:43:17,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:43:17,148 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-31 17:43:17,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:43:17,149 INFO L225 Difference]: With dead ends: 295 [2019-01-31 17:43:17,149 INFO L226 Difference]: Without dead ends: 284 [2019-01-31 17:43:17,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2019-01-31 17:43:17,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-01-31 17:43:21,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 225. [2019-01-31 17:43:21,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-31 17:43:21,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1147 transitions. [2019-01-31 17:43:21,976 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1147 transitions. Word has length 9 [2019-01-31 17:43:21,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:43:21,977 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1147 transitions. [2019-01-31 17:43:21,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:43:21,977 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1147 transitions. [2019-01-31 17:43:21,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:43:21,977 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:43:21,977 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:43:21,977 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:43:21,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:43:21,978 INFO L82 PathProgramCache]: Analyzing trace with hash 894315494, now seen corresponding path program 1 times [2019-01-31 17:43:21,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:43:21,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:43:21,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:43:21,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:43:21,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:43:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:43:22,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:43:22,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:43:22,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:43:22,088 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:43:22,088 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [30], [31] [2019-01-31 17:43:22,089 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:43:22,089 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:43:22,578 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:43:22,578 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-01-31 17:43:22,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:43:22,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:43:22,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:43:22,579 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-01-31 17:43:22,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:43:22,588 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:43:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:43:22,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:43:22,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, 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-01-31 17:43:22,607 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-01-31 17:43:22,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:22,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:22,614 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-01-31 17:43:22,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:22,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:22,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:22,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-01-31 17:43:22,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:22,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:22,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:22,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:22,639 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-01-31 17:43:22,640 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:43:22,666 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:22,679 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:22,688 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:22,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:22,718 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-01-31 17:43:22,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:22,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:22,734 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-01-31 17:43:22,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:22,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:22,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:22,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:22,769 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-01-31 17:43:22,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:22,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:22,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:22,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:22,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:22,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:22,813 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-01-31 17:43:22,813 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:43:22,827 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:22,841 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:22,856 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:22,882 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-01-31 17:43:22,882 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-31 17:43:22,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:22,901 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-01-31 17:43:22,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:43:22,925 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-01-31 17:43:22,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:43:22,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:22,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:22,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:22,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:22,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:22,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:22,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:22,958 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-01-31 17:43:22,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:43:23,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-01-31 17:43:23,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-01-31 17:43:23,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,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, 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-01-31 17:43:23,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:43:23,142 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-01-31 17:43:23,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:25 [2019-01-31 17:43:23,160 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:43:23,160 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:43:23,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:43:23,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:43:23,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:43:23,204 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:43:23,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:43:23,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:43:23,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:43:23,205 INFO L87 Difference]: Start difference. First operand 225 states and 1147 transitions. Second operand 10 states. [2019-01-31 17:43:30,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:43:30,091 INFO L93 Difference]: Finished difference Result 328 states and 1595 transitions. [2019-01-31 17:43:30,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:43:30,091 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-31 17:43:30,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:43:30,092 INFO L225 Difference]: With dead ends: 328 [2019-01-31 17:43:30,092 INFO L226 Difference]: Without dead ends: 315 [2019-01-31 17:43:30,093 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-01-31 17:43:30,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-31 17:43:36,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 258. [2019-01-31 17:43:36,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-01-31 17:43:36,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 1289 transitions. [2019-01-31 17:43:36,774 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 1289 transitions. Word has length 9 [2019-01-31 17:43:36,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:43:36,774 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 1289 transitions. [2019-01-31 17:43:36,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:43:36,774 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 1289 transitions. [2019-01-31 17:43:36,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:43:36,775 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:43:36,775 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:43:36,775 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:43:36,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:43:36,775 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2019-01-31 17:43:36,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:43:36,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:43:36,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:43:36,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:43:36,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:43:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:43:36,978 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-31 17:43:37,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 17:43:37,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:43:37,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:43:37,036 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:43:37,037 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [30], [31] [2019-01-31 17:43:37,037 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:43:37,037 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:43:37,300 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:43:37,300 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-01-31 17:43:37,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:43:37,300 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:43:37,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:43:37,300 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-01-31 17:43:37,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:43:37,309 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:43:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:43:37,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:43:37,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:37,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, 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-01-31 17:43:37,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:37,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:37,377 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-01-31 17:43:37,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:37,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:37,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:37,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:37,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, 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-01-31 17:43:37,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:37,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:37,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:37,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:37,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:37,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:37,465 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-01-31 17:43:37,466 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:43:37,485 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:37,503 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:37,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:37,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, 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-01-31 17:43:37,549 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-01-31 17:43:37,551 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-01-31 17:43:37,554 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-01-31 17:43:37,557 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-01-31 17:43:37,557 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:43:37,581 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:37,594 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:37,604 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:37,613 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:37,642 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-01-31 17:43:37,642 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-31 17:43:37,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:37,677 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-01-31 17:43:37,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:43:37,705 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-01-31 17:43:37,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-31 17:43:37,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:37,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:37,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:37,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:37,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:37,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:37,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:37,738 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-01-31 17:43:37,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:43:37,769 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-01-31 17:43:37,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-31 17:43:37,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:37,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:37,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:37,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:37,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:37,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:37,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:37,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:37,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:37,802 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:43:37,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:37,803 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-01-31 17:43:37,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:43:37,838 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-01-31 17:43:37,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-31 17:43:37,865 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:43:37,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:43:37,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:43:37,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:43:37,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:43:37,922 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:43:37,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:43:37,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:43:37,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:43:37,923 INFO L87 Difference]: Start difference. First operand 258 states and 1289 transitions. Second operand 10 states. [2019-01-31 17:43:47,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:43:47,172 INFO L93 Difference]: Finished difference Result 326 states and 1564 transitions. [2019-01-31 17:43:47,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:43:47,172 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-31 17:43:47,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:43:47,173 INFO L225 Difference]: With dead ends: 326 [2019-01-31 17:43:47,173 INFO L226 Difference]: Without dead ends: 313 [2019-01-31 17:43:47,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:43:47,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-01-31 17:43:55,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2019-01-31 17:43:55,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-01-31 17:43:55,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1425 transitions. [2019-01-31 17:43:55,266 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1425 transitions. Word has length 9 [2019-01-31 17:43:55,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:43:55,266 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1425 transitions. [2019-01-31 17:43:55,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:43:55,266 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1425 transitions. [2019-01-31 17:43:55,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:43:55,267 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:43:55,267 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:43:55,267 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:43:55,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:43:55,267 INFO L82 PathProgramCache]: Analyzing trace with hash -561287958, now seen corresponding path program 1 times [2019-01-31 17:43:55,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:43:55,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:43:55,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:43:55,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:43:55,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:43:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:43:55,343 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-31 17:43:55,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:43:55,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:43:55,344 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:43:55,344 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [29] [2019-01-31 17:43:55,345 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:43:55,345 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:43:55,655 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:43:55,655 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-01-31 17:43:55,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:43:55,655 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:43:55,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:43:55,656 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-01-31 17:43:55,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:43:55,669 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:43:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:43:55,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:43:55,707 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-01-31 17:43:55,752 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-01-31 17:43:55,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:55,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:55,830 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-01-31 17:43:55,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:55,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:55,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:55,934 INFO L303 Elim1Store]: Index analysis took 103 ms [2019-01-31 17:43:55,935 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-01-31 17:43:55,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,055 INFO L303 Elim1Store]: Index analysis took 118 ms [2019-01-31 17:43:56,055 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-01-31 17:43:56,056 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:43:56,189 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:56,202 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:56,211 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:56,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:56,241 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-01-31 17:43:56,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,257 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-01-31 17:43:56,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,291 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-01-31 17:43:56,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,333 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-01-31 17:43:56,333 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:43:56,348 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:56,361 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:56,376 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:56,402 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-01-31 17:43:56,402 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:43:56,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,435 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-01-31 17:43:56,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:43:56,526 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-01-31 17:43:56,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-01-31 17:43:56,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,611 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:43:56,611 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-01-31 17:43:56,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:43:56,631 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-01-31 17:43:56,631 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:31 [2019-01-31 17:43:56,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,655 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-01-31 17:43:56,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:43:56,674 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-01-31 17:43:56,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-31 17:43:56,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:56,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, 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-01-31 17:43:56,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:43:56,729 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-01-31 17:43:56,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:29 [2019-01-31 17:43:56,750 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:43:56,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:43:56,791 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:43:56,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:43:56,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-31 17:43:56,810 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:43:56,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:43:56,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:43:56,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:43:56,811 INFO L87 Difference]: Start difference. First operand 284 states and 1425 transitions. Second operand 11 states. [2019-01-31 17:44:08,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:44:08,059 INFO L93 Difference]: Finished difference Result 400 states and 1978 transitions. [2019-01-31 17:44:08,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:44:08,060 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-31 17:44:08,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:44:08,061 INFO L225 Difference]: With dead ends: 400 [2019-01-31 17:44:08,061 INFO L226 Difference]: Without dead ends: 393 [2019-01-31 17:44:08,062 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-01-31 17:44:08,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-01-31 17:44:18,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 366. [2019-01-31 17:44:18,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-01-31 17:44:18,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1845 transitions. [2019-01-31 17:44:18,200 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1845 transitions. Word has length 9 [2019-01-31 17:44:18,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:44:18,201 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 1845 transitions. [2019-01-31 17:44:18,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:44:18,201 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1845 transitions. [2019-01-31 17:44:18,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:44:18,201 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:44:18,202 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:44:18,202 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:44:18,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:44:18,202 INFO L82 PathProgramCache]: Analyzing trace with hash -975025366, now seen corresponding path program 1 times [2019-01-31 17:44:18,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:44:18,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:44:18,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:44:18,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:44:18,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:44:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:44:18,307 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-31 17:44:18,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:44:18,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:44:18,308 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:44:18,308 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [29] [2019-01-31 17:44:18,309 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:44:18,309 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:44:18,570 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:44:18,571 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-01-31 17:44:18,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:44:18,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:44:18,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:44:18,571 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-01-31 17:44:18,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:44:18,579 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:44:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:44:18,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:44:18,590 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-01-31 17:44:18,594 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-01-31 17:44:18,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,604 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-01-31 17:44:18,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,629 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-01-31 17:44:18,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,636 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-01-31 17:44:18,637 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:44:18,662 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:18,675 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:18,685 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:18,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:18,713 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-01-31 17:44:18,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,729 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-01-31 17:44:18,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,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, 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-01-31 17:44:18,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,808 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-01-31 17:44:18,808 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:44:18,822 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:18,836 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:18,850 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:18,876 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-01-31 17:44:18,876 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-31 17:44:18,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,912 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-01-31 17:44:18,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:44:19,005 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-01-31 17:44:19,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-01-31 17:44:19,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,069 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:44:19,069 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-01-31 17:44:19,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:44:19,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,132 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:44:19,132 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-01-31 17:44:19,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:44:19,176 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-01-31 17:44:19,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:74 [2019-01-31 17:44:19,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,224 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-01-31 17:44:19,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:44:19,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,281 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:44:19,282 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-01-31 17:44:19,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:44:19,320 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-01-31 17:44:19,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:100, output treesize:74 [2019-01-31 17:44:19,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,371 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-01-31 17:44:19,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:44:19,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:19,436 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-01-31 17:44:19,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:44:19,477 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-01-31 17:44:19,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-01-31 17:44:19,520 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:44:19,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:44:19,570 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:44:19,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:44:19,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-31 17:44:19,588 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:44:19,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:44:19,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:44:19,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:44:19,589 INFO L87 Difference]: Start difference. First operand 366 states and 1845 transitions. Second operand 11 states. [2019-01-31 17:44:31,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:44:31,959 INFO L93 Difference]: Finished difference Result 441 states and 2134 transitions. [2019-01-31 17:44:31,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-31 17:44:31,960 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-31 17:44:31,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:44:31,961 INFO L225 Difference]: With dead ends: 441 [2019-01-31 17:44:31,962 INFO L226 Difference]: Without dead ends: 428 [2019-01-31 17:44:31,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:44:31,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-01-31 17:44:42,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 367. [2019-01-31 17:44:42,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-01-31 17:44:42,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1844 transitions. [2019-01-31 17:44:42,258 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1844 transitions. Word has length 9 [2019-01-31 17:44:42,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:44:42,259 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 1844 transitions. [2019-01-31 17:44:42,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:44:42,259 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1844 transitions. [2019-01-31 17:44:42,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:44:42,259 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:44:42,259 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:44:42,260 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:44:42,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:44:42,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1143531808, now seen corresponding path program 1 times [2019-01-31 17:44:42,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:44:42,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:44:42,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:44:42,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:44:42,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:44:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:44:42,551 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2019-01-31 17:44:42,629 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-31 17:44:42,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:44:42,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:44:42,630 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:44:42,630 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [29] [2019-01-31 17:44:42,630 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:44:42,630 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:44:42,980 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:44:42,981 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-01-31 17:44:42,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:44:42,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:44:42,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:44:42,981 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-01-31 17:44:42,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:44:42,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:44:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:44:42,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:44:43,001 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-01-31 17:44:43,005 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-01-31 17:44:43,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,015 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-01-31 17:44:43,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,028 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-01-31 17:44:43,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,040 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-01-31 17:44:43,040 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:44:43,064 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:43,075 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:43,085 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:43,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:43,116 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-01-31 17:44:43,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,132 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-01-31 17:44:43,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,166 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-01-31 17:44:43,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,211 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-01-31 17:44:43,211 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:44:43,225 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:43,238 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:43,253 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:43,279 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-01-31 17:44:43,279 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-31 17:44:43,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,317 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-01-31 17:44:43,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:44:43,406 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-01-31 17:44:43,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-01-31 17:44:43,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,486 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-01-31 17:44:43,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:44:43,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,549 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-01-31 17:44:43,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:44:43,598 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-01-31 17:44:43,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:68 [2019-01-31 17:44:43,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,648 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:44:43,649 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-01-31 17:44:43,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:44:43,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,709 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:44:43,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-01-31 17:44:43,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:44:43,751 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-01-31 17:44:43,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:62 [2019-01-31 17:44:43,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,801 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:44:43,802 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-01-31 17:44:43,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:44:43,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:43,862 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:44:43,863 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-01-31 17:44:43,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:44:43,911 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-01-31 17:44:43,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:66 [2019-01-31 17:44:43,993 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:44:43,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:44:44,052 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:44:44,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:44:44,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:44:44,071 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:44:44,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:44:44,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:44:44,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:44:44,072 INFO L87 Difference]: Start difference. First operand 367 states and 1844 transitions. Second operand 12 states. [2019-01-31 17:45:04,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:45:04,302 INFO L93 Difference]: Finished difference Result 685 states and 3436 transitions. [2019-01-31 17:45:04,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-31 17:45:04,302 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-31 17:45:04,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:45:04,304 INFO L225 Difference]: With dead ends: 685 [2019-01-31 17:45:04,304 INFO L226 Difference]: Without dead ends: 677 [2019-01-31 17:45:04,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:45:04,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-01-31 17:45:19,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 545. [2019-01-31 17:45:19,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-01-31 17:45:19,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 2791 transitions. [2019-01-31 17:45:19,861 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 2791 transitions. Word has length 9 [2019-01-31 17:45:19,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:45:19,861 INFO L480 AbstractCegarLoop]: Abstraction has 545 states and 2791 transitions. [2019-01-31 17:45:19,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:45:19,861 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 2791 transitions. [2019-01-31 17:45:19,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:45:19,862 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:45:19,862 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:45:19,862 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:45:19,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:45:19,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1616311456, now seen corresponding path program 2 times [2019-01-31 17:45:19,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:45:19,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:45:19,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:45:19,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:45:19,863 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:45:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:45:20,072 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 17:45:20,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:45:20,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:45:20,072 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:45:20,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:45:20,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:45:20,072 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-01-31 17:45:20,081 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:45:20,082 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:45:20,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:45:20,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:45:20,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:45:20,105 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-01-31 17:45:20,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:20,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:20,129 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-01-31 17:45:20,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:20,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:20,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:20,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:20,164 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-01-31 17:45:20,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:20,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:20,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:20,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:20,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:20,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:20,208 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-01-31 17:45:20,209 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:45:20,223 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:20,237 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:20,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:20,273 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-01-31 17:45:20,276 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-01-31 17:45:20,279 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-01-31 17:45:20,283 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-01-31 17:45:20,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-01-31 17:45:20,286 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:45:20,307 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:20,319 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:20,328 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:20,337 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:20,363 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-01-31 17:45:20,363 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-31 17:45:20,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:20,404 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-01-31 17:45:20,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:45:20,491 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-01-31 17:45:20,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-01-31 17:45:20,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:20,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:20,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:20,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:20,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:20,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:20,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:20,583 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-01-31 17:45:20,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:45:21,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,050 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:45:21,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, 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-01-31 17:45:21,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:45:21,092 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-01-31 17:45:21,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:86 [2019-01-31 17:45:21,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,159 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:45: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, 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-01-31 17:45:21,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:45:21,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,226 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-01-31 17:45:21,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:45:21,261 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-01-31 17:45:21,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:106, output treesize:70 [2019-01-31 17:45:21,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,312 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-01-31 17:45:21,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:45:21,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:21,369 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:45:21,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, 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-01-31 17:45:21,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:45:21,421 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-01-31 17:45:21,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-01-31 17:45:21,478 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:45:21,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:45:21,534 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:45:21,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:45:21,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-31 17:45:21,553 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:45:21,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 17:45:21,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 17:45:21,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:45:21,554 INFO L87 Difference]: Start difference. First operand 545 states and 2791 transitions. Second operand 13 states. [2019-01-31 17:45:21,747 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-01-31 17:45:23,253 WARN L181 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-01-31 17:45:36,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:45:36,774 INFO L93 Difference]: Finished difference Result 550 states and 2805 transitions. [2019-01-31 17:45:36,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:45:36,775 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-31 17:45:36,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:45:36,776 INFO L225 Difference]: With dead ends: 550 [2019-01-31 17:45:36,776 INFO L226 Difference]: Without dead ends: 543 [2019-01-31 17:45:36,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2019-01-31 17:45:36,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-01-31 17:45:39,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 38. [2019-01-31 17:45:39,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-31 17:45:39,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-01-31 17:45:39,780 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 9 [2019-01-31 17:45:39,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:45:39,781 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-01-31 17:45:39,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 17:45:39,781 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-01-31 17:45:39,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-31 17:45:39,781 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:45:39,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:45:39,781 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:45:39,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:45:39,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1518781026, now seen corresponding path program 1 times [2019-01-31 17:45:39,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:45:39,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:45:39,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:45:39,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:45:39,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:45:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:45:39,860 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 17:45:39,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:45:39,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:45:39,861 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-31 17:45:39,861 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [30], [31] [2019-01-31 17:45:39,862 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:45:39,862 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:45:40,208 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:45:40,208 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-01-31 17:45:40,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:45:40,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:45:40,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:45:40,208 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-01-31 17:45:40,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:45:40,219 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:45:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:45:40,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:45:40,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:40,247 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-01-31 17:45:40,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:40,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:40,281 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-01-31 17:45:40,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:40,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:40,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:40,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:40,317 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-01-31 17:45:40,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:40,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:40,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:40,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:40,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:40,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:40,362 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-01-31 17:45:40,363 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:45:40,379 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:40,394 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:40,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:40,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, 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-01-31 17:45:40,431 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-01-31 17:45:40,434 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-01-31 17:45:40,450 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-01-31 17:45:40,466 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-01-31 17:45:40,467 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:45:40,827 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:41,049 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:41,214 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:41,347 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:41,630 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-01-31 17:45:41,630 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-31 17:45:41,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:41,666 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-01-31 17:45:41,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:45:41,692 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-01-31 17:45:41,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-31 17:45:41,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:41,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:41,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:41,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:41,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:41,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:41,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:41,727 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-01-31 17:45:41,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:45:41,759 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-01-31 17:45:41,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-31 17:45:41,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:41,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:41,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:41,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:41,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:41,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:41,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:41,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:41,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:41,793 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:45:41,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:41,795 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-01-31 17:45:41,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:45:41,829 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-01-31 17:45:41,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-01-31 17:45:42,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,035 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:45:42,036 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-01-31 17:45:42,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:45:42,068 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-01-31 17:45:42,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:45:42,357 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:45:42,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:45:42,445 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:45:42,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:45:42,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-31 17:45:42,464 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:45:42,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 17:45:42,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 17:45:42,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:45:42,465 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-01-31 17:45:48,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:45:48,295 INFO L93 Difference]: Finished difference Result 67 states and 277 transitions. [2019-01-31 17:45:48,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:45:48,295 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-31 17:45:48,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:45:48,296 INFO L225 Difference]: With dead ends: 67 [2019-01-31 17:45:48,296 INFO L226 Difference]: Without dead ends: 58 [2019-01-31 17:45:48,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-01-31 17:45:48,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-31 17:45:51,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2019-01-31 17:45:51,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-31 17:45:51,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 171 transitions. [2019-01-31 17:45:51,522 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 171 transitions. Word has length 10 [2019-01-31 17:45:51,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:45:51,522 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 171 transitions. [2019-01-31 17:45:51,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 17:45:51,522 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 171 transitions. [2019-01-31 17:45:51,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-31 17:45:51,523 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:45:51,523 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:45:51,523 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:45:51,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:45:51,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1744942188, now seen corresponding path program 1 times [2019-01-31 17:45:51,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:45:51,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:45:51,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:45:51,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:45:51,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:45:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:45:51,661 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-31 17:45:51,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:45:51,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:45:51,662 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-31 17:45:51,662 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [28], [30], [31] [2019-01-31 17:45:51,663 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:45:51,663 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:45:52,001 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:45:52,001 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-01-31 17:45:52,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:45:52,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:45:52,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:45:52,002 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-01-31 17:45:52,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:45:52,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:45:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:45:52,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:45:52,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, 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-01-31 17:45:52,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,036 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-01-31 17:45:52,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,071 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-01-31 17:45:52,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,115 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-01-31 17:45:52,115 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:45:52,129 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:52,141 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:52,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:52,174 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-01-31 17:45:52,177 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-01-31 17:45:52,179 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-01-31 17:45:52,181 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-01-31 17:45:52,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-01-31 17:45:52,184 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:45:52,206 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:52,218 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:52,227 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:52,236 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:52,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:52,262 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-01-31 17:45:52,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,300 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-01-31 17:45:52,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:45:52,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:45:52,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-01-31 17:45:52,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,374 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-01-31 17:45:52,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:45:52,467 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-01-31 17:45:52,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:68 [2019-01-31 17:45:52,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,522 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:45:52,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, 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-01-31 17:45:52,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:45:52,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,585 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:45:52,586 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-01-31 17:45:52,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:45:52,637 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-01-31 17:45:52,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:64 [2019-01-31 17:45:52,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,695 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:45:52,695 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-01-31 17:45:52,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:45:52,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:52,759 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:45:52,760 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-01-31 17:45:52,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:45:52,799 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-01-31 17:45:52,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:84, output treesize:64 [2019-01-31 17:45:52,859 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:45:52,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:45:52,918 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:45:52,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:45:52,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:45:52,935 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:45:52,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:45:52,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:45:52,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:45:52,936 INFO L87 Difference]: Start difference. First operand 39 states and 171 transitions. Second operand 12 states. [2019-01-31 17:45:59,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:45:59,149 INFO L93 Difference]: Finished difference Result 74 states and 289 transitions. [2019-01-31 17:45:59,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:45:59,149 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-01-31 17:45:59,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:45:59,150 INFO L225 Difference]: With dead ends: 74 [2019-01-31 17:45:59,150 INFO L226 Difference]: Without dead ends: 59 [2019-01-31 17:45:59,150 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-01-31 17:45:59,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-31 17:46:02,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 38. [2019-01-31 17:46:02,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-31 17:46:02,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-01-31 17:46:02,748 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 10 [2019-01-31 17:46:02,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:46:02,748 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-01-31 17:46:02,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:46:02,748 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-01-31 17:46:02,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-31 17:46:02,748 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:46:02,748 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:46:02,749 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:46:02,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:46:02,749 INFO L82 PathProgramCache]: Analyzing trace with hash 854957070, now seen corresponding path program 1 times [2019-01-31 17:46:02,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:46:02,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:46:02,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:46:02,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:46:02,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:46:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:46:02,886 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 17:46:02,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:46:02,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:46:02,887 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-31 17:46:02,887 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [28], [30], [31] [2019-01-31 17:46:02,888 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:46:02,888 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:46:03,241 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:46:03,242 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-01-31 17:46:03,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:46:03,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:46:03,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:46:03,242 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-01-31 17:46:03,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:46:03,251 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:46:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:46:03,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:46:03,260 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-01-31 17:46:03,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,283 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-01-31 17:46:03,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,319 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-01-31 17:46:03,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,363 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-01-31 17:46:03,364 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:03,378 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:03,392 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:03,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:03,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, 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-01-31 17:46:03,430 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-01-31 17:46:03,433 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-01-31 17:46:03,440 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-01-31 17:46:03,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 27 treesize of output 62 [2019-01-31 17:46:03,443 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:03,465 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:03,476 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:03,485 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:03,495 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:03,521 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-01-31 17:46:03,521 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-31 17:46:03,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,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, 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-01-31 17:46:03,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:03,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:46:03,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:46:03,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,680 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-01-31 17:46:03,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:03,698 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-01-31 17:46:03,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-31 17:46:03,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,725 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:46:03,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,727 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-01-31 17:46:03,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:03,750 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-01-31 17:46:03,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-31 17:46:03,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,780 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:46:03,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, 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-01-31 17:46:03,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:03,801 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-01-31 17:46:03,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-31 17:46:03,823 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:46:03,823 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:46:03,862 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:46:03,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:46:03,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-31 17:46:03,880 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:46:03,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 17:46:03,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 17:46:03,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:46:03,881 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-01-31 17:46:11,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:46:11,087 INFO L93 Difference]: Finished difference Result 80 states and 341 transitions. [2019-01-31 17:46:11,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:46:11,088 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-31 17:46:11,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:46:11,088 INFO L225 Difference]: With dead ends: 80 [2019-01-31 17:46:11,089 INFO L226 Difference]: Without dead ends: 71 [2019-01-31 17:46:11,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-01-31 17:46:11,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-31 17:46:17,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2019-01-31 17:46:17,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-31 17:46:17,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 296 transitions. [2019-01-31 17:46:17,441 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 296 transitions. Word has length 10 [2019-01-31 17:46:17,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:46:17,441 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 296 transitions. [2019-01-31 17:46:17,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 17:46:17,441 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 296 transitions. [2019-01-31 17:46:17,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-31 17:46:17,441 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:46:17,441 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:46:17,441 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:46:17,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:46:17,442 INFO L82 PathProgramCache]: Analyzing trace with hash 997631658, now seen corresponding path program 2 times [2019-01-31 17:46:17,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:46:17,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:46:17,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:46:17,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:46:17,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:46:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:46:17,543 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-31 17:46:17,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:46:17,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:46:17,544 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:46:17,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:46:17,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:46:17,544 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-01-31 17:46:17,555 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:46:17,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:46:17,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-31 17:46:17,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:46:17,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:46:17,569 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-01-31 17:46:17,572 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-01-31 17:46:17,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-01-31 17:46:17,586 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-01-31 17:46:17,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,599 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-01-31 17:46:17,599 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:17,615 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:17,624 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:17,634 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:17,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:17,657 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-01-31 17:46:17,660 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-01-31 17:46:17,664 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-01-31 17:46:17,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,683 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-01-31 17:46:17,683 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:17,690 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:17,697 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:17,704 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:17,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-01-31 17:46:17,720 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:36, output treesize:42 [2019-01-31 17:46:17,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,756 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-01-31 17:46:17,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:46:17,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-31 17:46:17,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:35 [2019-01-31 17:46:17,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,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, 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-01-31 17:46:17,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:17,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 42 [2019-01-31 17:46:17,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:17,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-31 17:46:17,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:35 [2019-01-31 17:46:17,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,892 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-01-31 17:46:17,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:17,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,923 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-01-31 17:46:17,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:17,939 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-01-31 17:46:17,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:28 [2019-01-31 17:46:17,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,965 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-01-31 17:46:17,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:17,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:17,996 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-01-31 17:46:17,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:18,019 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-01-31 17:46:18,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2019-01-31 17:46:18,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:18,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:18,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:18,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:18,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:18,050 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:46:18,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:18,052 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-01-31 17:46:18,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:18,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:18,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:18,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:18,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:18,083 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-01-31 17:46:18,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:18,101 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-01-31 17:46:18,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:34 [2019-01-31 17:46:18,132 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:46:18,132 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:46:18,198 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:46:18,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:46:18,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-31 17:46:18,217 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:46:18,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 17:46:18,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 17:46:18,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:46:18,218 INFO L87 Difference]: Start difference. First operand 64 states and 296 transitions. Second operand 13 states. [2019-01-31 17:46:25,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:46:25,009 INFO L93 Difference]: Finished difference Result 71 states and 316 transitions. [2019-01-31 17:46:25,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:46:25,010 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2019-01-31 17:46:25,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:46:25,010 INFO L225 Difference]: With dead ends: 71 [2019-01-31 17:46:25,010 INFO L226 Difference]: Without dead ends: 0 [2019-01-31 17:46:25,011 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-01-31 17:46:25,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-31 17:46:25,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-31 17:46:25,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-31 17:46:25,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-31 17:46:25,012 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-01-31 17:46:25,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:46:25,012 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-31 17:46:25,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 17:46:25,012 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 17:46:25,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 17:46:25,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-31 17:46:25,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:46:26,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:46:34,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:46:34,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:46:34,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:46:34,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:46:34,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:46:34,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:46:35,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:46:35,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:46:36,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:46:36,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:46:36,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:46:40,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:46:56,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:46:58,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:47:06,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:47:39,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:47:58,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:48:12,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent.